Abstraction for non-ground answer set programs
From MaRDI portal
Publication:5919127
DOI10.1016/j.artint.2021.103563OpenAlexW3183197268MaRDI QIDQ5919127
Thomas Eiter, Zeynep G. Saribatur, Peter Schüller
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103563
abstractionanswer set programmingknowledge representation and reasoningdeclarative problem solvingcounterexample-guided abstraction and refinementexplaining unsatisfiabilitynonmonotonic formalisms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synonymous theories and knowledge representations in answer set programming
- A new representation and associated algorithms for generalized planning
- Hierarchical model-based diagnosis based on structural abstraction
- ASSAT: computing answer sets of a logic program by SAT solvers
- Equilibrium logic
- Theorem proving with abstraction
- A theory of abstraction
- Succinctness as a source of complexity in logical formalisms
- Automatically generating abstractions for planning
- Downward refinement and the efficiency of hierarchical problem solving
- Property preserving abstractions for the verification of concurrent systems
- sCASP
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Extending and implementing the stable model semantics
- Planning in a hierarchy of abstraction spaces
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems
- Characterising relativised strong equivalence with projection for non-ground answer-set programs
- A bird's-eye view of forgetting in answer-set programming
- Blending lazy-grounding and CDNL search for answer-set solving
- Complexity results for answer set programming with bounded predicate arities and implications
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Abstracting soft constraints: framework, properties, examples
- Reactive Policies with Planning for Action Languages
- Causal Graph Justifications of Logic Programs
- GASP: Answer Set Programming with Lazy Grounding
- Interactive Debugging of Non-ground ASP Programs
- Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy
- Counterexample-guided abstraction refinement for symbolic model checking
- Disjunctive ASP with functions: Decidable queries and effective computation
- Catching the Ouroboros: On debugging non-ground answer-set programs
- Justifications for logic programs under answer set semantics
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- 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
- Constraint Answer Set Programming without Grounding
- Handbook of Model Checking
- Anytime answer set optimization via unsatisfiable core shrinking
- The power of non-ground rules in Answer Set Programming
- On local domain symmetry for model expansion
- ASPeRiX, a first-order forward chaining approach for answer set computing
- Strong equivalence made easy: nested expressions and weight constraints
- Omission-Based Abstraction for Answer Set Programs
- Lazy Model Expansion: Interleaving Grounding with Search
- Logic Programming
- Answering the “why” in answer set programming – A survey of explanation approaches
- Unfolding partiality and disjunctions in stable model semantics
- The DLV system for knowledge representation and reasoning
- Semantical characterizations and complexity of equivalences in answer set programming
- Logic Programming
- Unsatisfiability-based optimization in clasp
- Preprocessing of Complex Non-Ground Rules in Answer Set Programming
- Logic Programming and Nonmonotonic Reasoning
- Debugging ASP Programs by Means of ASP
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Twelve Definitions of a Stable Model
- Engineering an Incremental ASP Solver
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Strongly equivalent logic programs
- KI 2003: Advances in Artificial Intelligence
- Abstraction for non-ground answer set programs
