您要查找的是不是：
- An algorithm in finding minimal reduction based on Propositional Satisfiability(abbreviated as SAT) algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem. 本文提出了一种求最小约简的基于命题可满足性(简称SAT)的算法,提出一个解决SAT问题的分割和结合的算法。
- propositional satisfiability problem 可满足性问题
- Propositional Satisfiability(SAT) 命题可满足性（SAT）
- Propositional satisfiability SAT求解
- He’s a simple propositional bet. 来下个赌如何？
- A propositional content can have different focuses of sentence. 一个命题内容可以有不同的语句焦点。
- What is Situation Model: Propositional Symbol or Perceptual Symbol? 情境模型的实质:命题符号与知觉符号之争?
- The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem. 合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
- Solving Lattice Point Problems by Propositional Reasoning with Isomorphism Cutting Strategy. National Taiwan University, Taipei, Taiwan. 用同构精简策略在命题逻辑中解格子点问题。国立台湾大学资讯工程学研究所硕士论文，台北市。
- However, the causal efficacy of propositional attitudes here is based on the syntactic properties of the attitudes. 然而,在这里,命题态度的因果效力是通过命题态度的句法性质而得到论证的。
- The satisfiability problem is a key problem in computer science and artificial intelligence. 这是计算机科学和人工智能中的重要问题之一。
- Accordingly, of current bubble the bogus that saying should be a model is propositional. 因此，目前的泡沫之说应该是典型的伪命题。”
- The research of this paper is based on the Boolean Satisfiability (SAT) Problem of combinational circuit. 本文研究工作是针对可满足问题（SAT）在组合电路验证和测试中的应用展开的。
- Can attend propositional invitational tournament, this is a challenge, also be an opportunity! 都可以参加命题邀请赛，这是一次挑战，也是一次机会！
- But again,these are sententially simple sentences,and thus are not amenable to treatment by propositional logic. 它们是我们在句子逻辑中所称的简单句，即被看作一个位经分析的句子整体。
- This paper develops the concept of consistency of finite theories in propositional fuzzy logic system. 摘要 推广了命题模糊逻辑系统中有限理论相容性的概念。
- Binary decision diagram (BDD) and Boolean sat satisfiability (SAT) are common techniques of logic circuit-based Boolean reasoning scheme. 摘要在基于逻辑电路的布尔推理过程中，经常用到二叉判决图(BDD)与布尔可满足性(SAT)相结合的算法。
- Prenex normal form of the first order logic propositional is the key to propositional logic. 对于一阶谓词化为其前束范式问题，一般可以通过三个步骤完成，首先去掉逻辑式中的连接词；
- Another goal of the project is to find good methods for checking the satisfiability of first-order formulas (in finite domains). 本项目还研究了逻辑公式的可满足性判定问题。
