The Intelligent Grounder of DLV
From MaRDI portal
Publication:2900523
DOI10.1007/978-3-642-30743-0_17zbMath1357.68032OpenAlexW2103446906MaRDI QIDQ2900523
Nicola Leone, Simona Perri, Wolfgang Faber
Publication date: 23 July 2012
Published in: Correct Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30743-0_17
Related Items (7)
ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Partial Compilation of ASP Programs ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Incremental maintenance of overgrounded logic programs with tailored simplifications ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Efficiently Coupling the I-DLV Grounder with ASP Solvers ⋮ Estimating grounding sizes of logic programs under answer set semantics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ASSAT: computing answer sets of a logic program by SAT solvers
- Enhancing DLV instantiator by backjumping techniques
- External sources of knowledge and value invention in logic programming
- OntoDLV: An ASP-based System for Enterprise Ontologies
- Experimenting with parallelism for the instantiation of ASP programs
- Design and implementation of aggregate functions in the DLV system
- Unfolding partiality and disjunctions in stable model semantics
- The DLV system for knowledge representation and reasoning
- Parallel instantiation of ASP programs: techniques and experiments
- One More Decidable Class of Finitely Ground Programs
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Conflict-Driven Answer Set Enumeration
- Experimenting with recursive queries in database and logic programming systems
- Computable Functions in ASP: Theory and Implementation
This page was built for publication: The Intelligent Grounder of DLV
