Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATHOpenAlexMaRDI QIDQ5714743FDO

Authors E. Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais

Publication date 16 December 2005

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

Full work available at URL https://doi.org/10.1007/11527695

zbMATH Keywords

SATBoolean functionpropositional reasoning and search

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080473
• scientific article; zbMATH DE number 4106266
• scientific article; zbMATH DE number 1755716
• Functional and embedded dependency inference: A data mining point of view
• Algorithms for inferring functional dependencies from relations

Cited in

(10)

• Computer Aided Verification
• Function extraction
• On propositional definability
• An efficient approach to solving random \(k\)-SAT problems
• Reasoning with propositional logic: from SAT solvers to knowledge compilation
• scientific article; zbMATH DE number 1690149 (Why is no real title available?)
• Exploiting functional dependencies in declarative problem specifications
• Logics in Artificial Intelligence
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• About some UP-based polynomial fragments of SAT

This page was built for publication: Theory and Applications of Satisfiability Testing

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