scientific article; zbMATH DE number 1538056

MaRDI QIDQ4518913zbMATH OpenFDO

Authors Enrico Giunchiglia, Roberto Sebastiani

Publication date 11 March 2001

zbMATH Keywords

satisfiabilitypropositional logicdecision procedures for non-CNF formulas

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Recommendations

• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 1149437
• Implementing the Davis-Putnam method
• scientific article; zbMATH DE number 1098495
• Implementing the Davis-Putnam method

Cited in

(10)

• Nonserial dynamic programming formulations of satisfiability
• Implementing the Davis-Putnam method
• scientific article; zbMATH DE number 1149437 (Why is no real title available?)
• Automated reformulation of specifications by safe delay of constraints
• Formal verification based on Boolean expression diagrams
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• Exploiting functional dependencies in declarative problem specifications
• Implementing the Davis-Putnam method
• Programming for modular reconfigurable robots
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication:

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