Generalizing DPLL to Richer Logics

DOI10.1007/978-3-642-02658-4_35zbMath1242.68282OpenAlexW1556578161MaRDI QIDQ3636877

K. L. McMillan, Mooly Sagiv, Andreas Kuehlmann

Publication date: 30 June 2009

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_35

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Semantically-guided goal-sensitive reasoning: model representation ⋮ Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs ⋮ Satisfiability Modulo Theories ⋮ Deciding floating-point logic with abstract conflict driven clause learning ⋮ Linear Quantifier Elimination as an Abstract Decision Procedure ⋮ Cutting to the Chase Solving Linear Integer Arithmetic ⋮ Solving Systems of Linear Inequalities by Bound Propagation ⋮ A Survey of Satisfiability Modulo Theory ⋮ Cutting to the chase.