Abstraction for non-ground answer set programs
From MaRDI portal
Recommendations
- Abstraction for non-ground answer set programs
- Omission-based abstraction for answer set programs
- On structural analysis of non-ground answer-set programs
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Abstract Answer Set Solvers
- The power of non-ground rules in Answer Set Programming
- Non-prenex QBF solving using abstraction
- Answer set programming in intuitionistic logic
- scientific article; zbMATH DE number 6747884
Cites work
- A bird's-eye view of forgetting in answer-set programming
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- A new representation and associated algorithms for generalized planning
- A theory of abstraction
- Abstract interpretation and application to logic programs
- Abstracting soft constraints: framework, properties, examples
- Abstraction for non-ground answer set programs
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Anytime answer set optimization via unsatisfiable core shrinking
- ASSAT: computing answer sets of a logic program by SAT solvers
- Automatically generating abstractions for planning
- Blending lazy-grounding and CDNL search for answer-set solving
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- Catching the Ouroboros: on debugging non-ground answer-set programs
- Causal graph justifications of logic programs
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Characterising relativised strong equivalence with projection for non-ground answer-set programs
- Characterizations of the disjunctive stable semantics by partial evaluation
- Complexity results for answer set programming with bounded predicate arities and implications
- Constraint answer set programming without grounding
- Counterexample-guided abstraction refinement for symbolic model checking
- Debugging ASP Programs by Means of ASP
- Disjunctive ASP with functions: decidable queries and effective computation
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Downward refinement and the efficiency of hierarchical problem solving
- Engineering an Incremental ASP Solver
- Equilibrium logic
- Extending and implementing the stable model semantics
- GASP: Answer set programming with lazy grounding
- Handbook of model checking
- Hierarchical model-based diagnosis based on structural abstraction
- scientific article; zbMATH DE number 3956409 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 6902518 (Why is no real title available?)
- scientific article; zbMATH DE number 2090116 (Why is no real title available?)
- Interactive debugging of non-ground ASP programs
- Justifications for logic programs under answer set semantics
- Lazy model expansion: interleaving grounding with search
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Mobile robot planning using action language \({\mathcal {BC}}\) with an abstraction hierarchy
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems
- Omission-based abstraction for answer set programs
- On local domain symmetry for model expansion
- Planning in a hierarchy of abstraction spaces
- Planning in answer set programming using ordered task decomposition
- Preprocessing of complex non-ground rules in answer set programming
- Property preserving abstractions for the verification of concurrent systems
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Reactive policies with planning for action languages
- sCASP
- Semantical characterizations and complexity of equivalences in answer set programming
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- Succinctness as a source of complexity in logical formalisms
- Symmetry-breaking answer set solving
- Synonymous theories and knowledge representations in answer set programming
- The DLV system for knowledge representation and reasoning
- The power of non-ground rules in Answer Set Programming
- The well-founded semantics for general logic programs
- Theorem proving with abstraction
- Twelve Definitions of a Stable Model
- Unfolding partiality and disjunctions in stable model semantics
- Unsatisfiability-based optimization in clasp
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
Cited in
(6)- The power of non-ground rules in Answer Set Programming
- Omission-based abstraction for answer set programs
- An Answer Set Solver for non-Herbrand Programs: Progress Report
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Abstraction for non-ground answer set programs
- Forgetting in answer set programming -- a survey
This page was built for publication: Abstraction for non-ground answer set programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919127)
