New methods for computing inferences in first order logic

DOI10.1007/BF02027814zbMath0788.03014MaRDI QIDQ1309900

John N. Hooker

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

satisfiability algorithmsdecidable fragment of first order logicpartial instantiation

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items

Many-valued logic and mixed integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Computational experience with an interior point algorithm on the satisfiability problem
• Probabilistic logic
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• Probabilistic satisfiability
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
• Branch-and-cut solution of inference problems in propositional logic
• Solving propositional satisfiability problems
• A linear programming approach to reasoning about probabilities
• Algorithms for testing the satisfiability of propositional formulae
• Input Proofs and Rank One Cutting Planes
• Solving the incremental satisfiability problem
• Extended Horn sets in propositional logic
• A note on the Entscheidungsproblem