ASP and subset minimality: enumeration, cautious reasoning and MUSes

DOI10.1016/J.ARTINT.2023.103931MaRDI QIDQ6103676zbMATH OpenOpenAlexFDO

Authors M. Alviano, Carmine Dodaro, Salvatore Fiorentino, Alessandro Previti, F. Ricca

Publication date 27 June 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.artint.2023.103931

zbMATH Keywords

MUSenumerationanswer set programmingminimal modelscautious reasoning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• ASP for minimal entailment in a rational extension of SROEL
• Answer set enumeration via assumption literals
• A minimal predicative set theory
• Minimal sets on propositional formulae. Problems and reductions
• scientific article; zbMATH DE number 871851
• Intuitive minimal abduction in sequent calculi
• Counting minimal unsatisfiable subsets
• On the expressivity of minimal generic quantification

Cites work

• scientific article; zbMATH DE number 1614696 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1890629 (Why is no real title available?)
• A tableau calculus for minimal model reasoning
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• Advances in WASP
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Answer sets for consistent query answering in inconsistent databases
• Anytime computation of cautious consequences in answer set programming
• Argumentation reasoning via circumscription with \textsc{pyglaf}
• Catching the Ouroboros: on debugging non-ground answer-set programs
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Complexity-sensitive decision procedures for abstract argumentation
• Computing Diverse Optimal Stable Models
• Conflict-Driven Answer Set Enumeration
• Conflict-driven answer set solving: from theory to practice
• Debugging non-ground ASP programs: technique and graphical tools
• Enumeration of minimal models and MUSes in WASP
• Explanation in artificial intelligence: insights from the social sciences
• Extending and implementing the stable model semantics
• Fast, flexible MUS enumeration
• GRASP: a search algorithm for propositional satisfiability
• Handbook of knowledge representation.
• Improved answer-set programming encodings for abstract argumentation
• Knowledge Representation, Reasoning and Declarative Problem Solving
• MUSer2: an efficient MUS extractor
• Minimal sets on propositional formulae. Problems and reductions
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Model enumeration via assumption literals
• Paracoherent answer set computation
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Positive unit hyperresolution tableaux and their application to minimal model generation
• Reasoning about strong inconsistency in ASP
• Semi-equilibrium models for paracoherent answer set programs
• Solving satisfiability problems with preferences
• Strong inconsistency
• Taming primary key violations to query large inconsistent data via ASP
• The DLV system for knowledge representation and reasoning
• Tight logic programs

Cited in

(3)

• IASCAR: incremental answer set counting by anytime refinement
• ASP for minimal entailment in a rational extension of SROEL
• A general framework for preferences in answer set programming

This page was built for publication: ASP and subset minimality: enumeration, cautious reasoning and MUSes

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