Integrating Boolean and mathematical solving: Foundations, basic algorithms, and requirements

DOI10.1007/3-540-45470-5_22MaRDI QIDQ4808722zbMATH OpenFDO

Authors Gilles Audemard, Alessandro Cimatti, Artur Korniłowicz, Roberto Sebastiani, Piergiorgio Bertoli

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2385/23850231.htm, https://hdl.handle.net/11572/358463

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5785317
• Abstract solvers for quantified Boolean formulas and their applications
• Contributions to the theory of practical quantified Boolean formula solving
• Solution of systems of Boolean equations via the integer domain
• The Solution of Inferential Problems by Boole Algebra
• On solvability of Boolean equations
• Publication:4828947
• Integrating algebraic and SAT solvers
• Boolean functional synthesis: from under the hood of solvers
• Satisfiability-based algorithms for Boolean optimization

Cited in

(5)

• How to augment a formal system with a Boolean algebra component
• The use of associative information processing for constructing algorithms for solving systems of Boolean equations
• Integrating algebraic and SAT solvers
• A SAT based approach for solving formulas over Boolean and linear mathematical propositions
• Applying SAT solving in classification of finite algebras

This page was built for publication: Integrating Boolean and mathematical solving: Foundations, basic algorithms, and requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808722)