Omission-Based Abstraction for Answer Set Programs

DOI10.1017/S1471068420000095zbMath1472.68029arXiv2004.01410OpenAlexW3101458312MaRDI QIDQ4957218

Zeynep G. Saribatur, Thomas Eiter

Publication date: 3 September 2021

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

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

zbMATH Keywords

knowledge representationnonmonotonic reasoningabstractionanswer set programminginconsistency explanation

Mathematics Subject Classification ID

Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items

Abstraction for non-ground answer set programs

Uses Software

• ASSAT
• Potassco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the query complexity of selecting minimal sets for monotone predicates
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• A theory of diagnosis from first principles
• A theory of abstraction
• Automatically generating abstractions for planning
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Planning in a hierarchy of abstraction spaces
• Nested expressions in logic programs
• Design and results of the second international competition on computational models of argumentation
• Semantic forgetting in answer set programming
• The design of the Seventh Answer Set Programming Competition
• A bird's-eye view of forgetting in answer-set programming
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Merge-and-Shrink Abstraction
• Interactive Debugging of Non-ground ASP Programs
• The Design of the Sixth Answer Set Programming Competition
• Counterexample-guided abstraction refinement for symbolic model checking
• Catching the Ouroboros: On debugging non-ground answer-set programs
• Justifications for logic programs under answer set semantics
• Abstract interpretation and application to logic programs
• The well-founded semantics for general logic programs
• Characterizations of the disjunctive stable semantics by partial evaluation
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• When you must forget: Beyond strong persistence when forgetting in answer set programming
• Anytime answer set optimization via unsatisfiable core shrinking
• A Knowledge Level Account of Forgetting
• Answer sets for consistent query answering in inconsistent databases
• Strong equivalence made easy: nested expressions and weight constraints
• ASP-Core-2 Input Language Format
• Logic Programming
• Unfolding partiality and disjunctions in stable model semantics
• Logic Programming
• Collective dynamics of ‘small-world’ networks
• Logics in Artificial Intelligence
• Unsatisfiability-based optimization in clasp
• Logic Programming and Nonmonotonic Reasoning
• Debugging ASP Programs by Means of ASP
• Engineering an Incremental ASP Solver
• Strongly equivalent logic programs
• Abstraction for non-ground answer set programs