Model enumeration in propositional circumscription via unsatisfiable core analysis
From MaRDI portal
Publication:4592705
DOI10.1017/S1471068417000278zbMath1422.68217arXiv1707.01423MaRDI QIDQ4592705
Publication date: 8 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01423
circumscription; minimal correction subsets; minimal intervention strategies; minimal model enumeration; unsatisfiable core analysis
68T27: Logic in artificial intelligence
Related Items
Cautious reasoning in ASP via minimal models and unsatisfiable cores, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Design and results of the second international competition on computational models of argumentation, Strong inconsistency
Uses Software
Cites Work
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- On the satisfiability of circumscription
- Circumscription - a form of non-monotonic reasoning
- Conflict-driven answer set solving: from theory to practice
- Iterative and core-guided maxsat solving: a survey and assessment
- The ASP system DLV2
- Loop formulas for circumscription
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Parallel Model-Based Diagnosis on Multi-Core Computers
- MCS Extraction with Sublinear Oracle Queries
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Cores in Core Based MaxSat Algorithms: An Analysis
- On Computing Preferred MUSes and MCSes
- Advances in WASP
- Implementing Preferences with asprin
- Progress in clasp Series 3
- optsat: A Tool for Solving SAT Related Optimization Problems
- Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Complexity and compilation of GZ-aggregates in answer set programming
- Anytime answer set optimization via unsatisfiable core shrinking
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Logic Programming
- Answer Set Enumeration via Assumption Literals
- Computing Diverse Optimal Stable Models
- The DLV system for knowledge representation and reasoning
- Unsatisfiability-based optimization in clasp
- Minimal intervention strategies in logical signaling networks with ASP
- Conflict-Driven Answer Set Enumeration
