Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68597OpenAlexW2483910514MaRDI QIDQ5714743FDOQ5714743

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

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

zbMATH Keywords

SATBoolean functionpropositional reasoning and search

Mathematics Subject Classification ID

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

Cited In (10)

• An efficient approach to solving random \(k\)-SAT problems
• On propositional definability
• Computer Aided Verification
• Title not available (Why is that?)
• Function extraction
• Logics in Artificial Intelligence
• Reasoning with propositional logic: from SAT solvers to knowledge compilation
• Exploiting functional dependencies in declarative problem specifications
• About some UP-based polynomial fragments of SAT
• Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form

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)