Cautious reasoning in ASP via minimal models and unsatisfiable cores

DOI10.1017/S1471068418000145zbMath1451.68267arXiv1804.08480OpenAlexW2963164881WikidataQ62043797 ScholiaQ62043797MaRDI QIDQ4559795

Mario Alviano, Marco Maratea, Carmine Dodaro, Alessandro Previti, Matti Järvisalo

Publication date: 4 December 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.08480

zbMATH Keywords

answer set programmingquery answeringcautious reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items

ASP and subset minimality: enumeration, cautious reasoning and MUSes, Enhancing Magic Sets with an Application to Ontological Reasoning, Abstract Solvers for Computing Cautious Consequences of ASP programs, Omission-Based Abstraction for Answer Set Programs, Abstraction for non-ground answer set programs

Uses Software

• Gringo
• DLV
• WASP
• Datalog
• pyglaf
• maxino
• DLV2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the query complexity of selecting minimal sets for monotone predicates
• Solving satisfiability problems with preferences
• Design and results of the Fifth Answer Set Programming Competition
• On the relation among answer set solvers
• Positive unit hyperresolution tableaux and their application to minimal model generation
• Conflict-driven answer set solving: from theory to practice
• Magic sets for disjunctive Datalog programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Combining answer set programming with description logics for the semantic web
• The ASP system DLV2
• Anytime Computation of Cautious Consequences in Answer Set Programming
• Advances in WASP
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Disjunctive ASP with functions: Decidable queries and effective computation
• GRASP: a search algorithm for propositional satisfiability
• Algorithms for computing backbones of propositional formulae
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Taming primary key violations to query large inconsistent data via ASP
• Anytime answer set optimization via unsatisfiable core shrinking
• 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
• The DLV system for knowledge representation and reasoning
• Consistent query answering via ASP from different perspectives: Theory and practice
• The Sixth Answer Set Programming Competition
• Logic Programming and Nonmonotonic Reasoning