ASP and subset minimality: enumeration, cautious reasoning and MUSes
From MaRDI portal
Publication:6103676
DOI10.1016/j.artint.2023.103931OpenAlexW4366496760MaRDI QIDQ6103676
Alessandro Previti, Francesco Ricca, Salvatore Fiorentino, Mario Alviano, Carmine Dodaro
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2023.103931
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-equilibrium models for paracoherent answer set programs
- Fast, flexible MUS enumeration
- Complexity-sensitive decision procedures for abstract argumentation
- Solving satisfiability problems with preferences
- Positive unit hyperresolution tableaux and their application to minimal model generation
- Extending and implementing the stable model semantics
- Minimal sets on propositional formulae. Problems and reductions
- Conflict-driven answer set solving: from theory to practice
- Paracoherent answer set computation
- Explanation in artificial intelligence: insights from the social sciences
- Strong inconsistency
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Reasoning about strong inconsistency in ASP
- Enumeration of minimal models and MUSes in WASP
- Anytime Computation of Cautious Consequences in Answer Set Programming
- Advances in WASP
- Catching the Ouroboros: On debugging non-ground answer-set programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- GRASP: a search algorithm for propositional satisfiability
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Improved answer-set programming encodings for abstract argumentation
- Taming primary key violations to query large inconsistent data via ASP
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- A tableau calculus for minimal model reasoning
- Answer sets for consistent query answering in inconsistent databases
- Tight logic programs
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Debugging Non-ground ASP Programs: Technique and Graphical Tools
- Argumentation Reasoning via Circumscription with Pyglaf
- Model Enumeration via Assumption Literals
- Computing Diverse Optimal Stable Models
- The DLV system for knowledge representation and reasoning
- Conflict-Driven Answer Set Enumeration
