On the foundations of grounding in answer set programming
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Abstract gringo
- Advances in WASP
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Answer set programming and plan generation
- Answer set programming based on propositional satisfiability
- Answer Set Programming without Unstratified Negation
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- ASSAT: computing answer sets of a logic program by SAT solvers
- Computable Functions in ASP: Theory and Implementation
- Conflict-driven answer set solving: from theory to practice
- Connecting first-order ASP and the logic FO(ID) through reducts
- Enhancing DLV instantiator by backjumping techniques
- Extending and implementing the stable model semantics
- Fixpoint semantics for logic programming a survey
- GASP: Answer set programming with lazy grounding
- Grounding FO and FO(ID) with bounds
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1884384 (Why is no real title available?)
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- scientific article; zbMATH DE number 1884396 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 3099240 (Why is no real title available?)
- Improving the normalization of weight rules in answer set programs
- Infinitary equilibrium logic and strongly equivalent logic programs
- Logic programs with propositional connectives and aggregates
- Modularity Aspects of Disjunctive Stable Models
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- One More Decidable Class of Finitely Ground Programs
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Semantics of (disjunctive) logic programs based on partial evaluation
- Stable models for infinitary formulas with extensional atoms
- The alternating fixpoint of logic programs with negation
- The DLV system for knowledge representation and reasoning
- The intelligent grounder of DLV
- The Semantics of Predicate Logic as a Programming Language
- Transformation-based bottom-up computation of the well-founded model
- Twelve Definitions of a Stable Model
- Weight constraints as nested expressions
- Well-founded and stable semantics of logic programs with aggregates
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
Cited in
(2)
This page was built for publication: On the foundations of grounding in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027177)
