An exact algorithm for the constraint satisfaction problem: Application to logical inference

DOI10.1016/0020-0190(93)90258-BzbMath0788.90054OpenAlexW2017946184MaRDI QIDQ1313760

Hachemi Bennaceur, Gérard Plateau

Publication date: 22 March 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90258-b

zbMATH Keywords

propositional logicbranch and cutconstraint satisfaction probleminference problemautomatic theorem proving

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items

Constraint satisfaction -- algorithms and complexity analysis

Cites Work

• Unnamed Item
• Polynomial-average-time satisfiability problems
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• Branch-and-cut solution of inference problems in propositional logic
• Solving propositional satisfiability problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Computing Procedure for Quantification Theory