The inverse satisfiability problem
From MaRDI portal
Publication:6184669
DOI10.1007/3-540-61332-3_158zbMath1529.68188OpenAlexW1618427815MaRDI QIDQ6184669
Dimitris J. Kavvadias, Martha Sideris
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
Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Model theory.
- Structure identification in relational data
- Learning conjunctions of Horn clauses
- Horn approximations of empirical data
- Model-preference default theories
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
This page was built for publication: The inverse satisfiability problem
