The inverse satisfiability problem

DOI10.1007/3-540-61332-3_158MaRDI QIDQ6184669zbMATH OpenOpenAlexFDO

Authors Dimitris J. Kavvadias, Martha Sideri

Publication date 29 January 2024

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

Full work available at URL https://doi.org/10.1007/3-540-61332-3_158

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)

Recommendations

• The Inverse Satisfiability Problem
• A dichotomy theorem for the inverse satisfiability problem
• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
• The complexity of satisfiability problems
• scientific article; zbMATH DE number 496040

Cites work

• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Horn approximations of empirical data
• scientific article; zbMATH DE number 4053069 (Why is no real title available?)
• scientific article; zbMATH DE number 1354130 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Learning conjunctions of Horn clauses
• Model theory.
• Model-preference default theories
• Structure identification in relational data
• The complexity of satisfiability problems
• The complexity of theorem-proving procedures

This page was built for publication: The inverse satisfiability problem

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