Algebraic Characterizations of the Satisfiability of First-Order Logical Formulas and the Halting of Programs.
Jean-Pierre BénéjamPublished in: Math. Log. Q. (1977)
Keyphrases
- logical formulas
- first order logic
- propositional logic
- predicate logic
- knowledge base
- partial order
- horn theories
- higher order
- satisfiability problem
- temporal logic
- natural language
- computational complexity
- theorem proving
- decision procedures
- information retrieval
- np complete
- canonical representation
- propositional theories
- quantifier elimination
- bayesian networks
- answer sets
- inference rules
- phase transition
- sequential patterns