首页> 外文期刊>C - C++ Users Journal >Satisfying the Satisfiability Problem
【24h】

Satisfying the Satisfiability Problem

机译:满足满意度问题

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Prepositional logic plays a central role in digital hardware, software engineering, artificial intelligence, and areas of computer science where it is used to model systems, conditions, and properties. A variety of problems and systems can be modeled using prepositional logic, including practical problems in diagnosis, planning, scheduling, and the like. Analysis of systems modeled in prepositional logic and reasoning about their properties is then performed using standard techniques from prepositional logic. It is common to translate the system model into a standard form called the "conjunctive normal form" (CNF). The most important fundamental technique in propositional logic is that of checking whether a given formula in CNF is satisfiable—the so-called "SAT' problem.
机译:介词逻辑在数字硬件,软件工程,人工智能以及计算机科学领域中发挥着核心作用,用于对系统,条件和属性进行建模。可以使用介词逻辑对各种问题和系统进行建模,包括诊断,计划,调度等中的实际问题。然后使用介词逻辑中的标准技术对介词逻辑中建模的系统进行分析并对其特性进行推理。通常将系统模型转换为称为“合取范式”(CNF)的标准形式。命题逻辑中最重要的基本技术是检查CNF中的给定公式是否可满足-所谓的“ SAT”问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号