A MaxSAT-based framework for computing circumscription
From MaRDI portal
Cites work
- A novel SAT-based approach to model based diagnosis
- A theory of diagnosis from first principles
- An algorithm to compute circumscription
- An efficient method for eliminating varying predicates from a circumscription
- Argumentation reasoning via circumscription with \textsc{pyglaf}
- ASSAT: computing answer sets of a logic program by SAT solvers
- Circumscription - a form of non-monotonic reasoning
- College Admissions and the Stability of Marriage
- Complex optimization in answer set programming
- Computing circumscription revisited: A reduction algorithm
- Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach
- Eliminating the fixed predicates from a circumscription
- Embedding circumscriptive theories in general disjunctive programs
- scientific article; zbMATH DE number 1759374 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- Logic Programming
- Logics in Artificial Intelligence
- Loop formulas for circumscription
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Model-based diagnosis of hardware designs
- New models for generating hard random Boolean formulas and disjunctive logic programs
- Optimizing answer set computation via heuristic-based decomposition
- optsat: A Tool for Solving SAT Related Optimization Problems
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Witnesses for Answer Sets of Logic Programs
This page was built for publication: A MaxSAT-based framework for computing circumscription
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355852)
