Enhancing DLV instantiator by backjumping techniques
From MaRDI portal
Publication:2426106
DOI10.1007/S10472-008-9090-9zbMATH Open1138.68019OpenAlexW2056062068MaRDI QIDQ2426106
Gelsomina Catalano, Simona Perri, N. Leone, Francesco Scarcello
Publication date: 21 April 2008
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-008-9090-9
Artificial intelligenceLogic programmingAnswer set programmingDisjunctive logic programmingNonmonotonic reasoningStable model semanticsDeductive databases
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Overview of DASWAM: Exploitation of dependent and-parallelism
- ASSAT: computing answer sets of a logic program by SAT solvers
- The nomore + + Approach to Answer Set Solving
- Extending and implementing the stable model semantics
- Conflict-Driven Answer Set Enumeration
- Logics in Artificial Intelligence
- Foundations of Information and Knowledge Systems
- Logic Programming and Nonmonotonic Reasoning
- Conflict-directed backjumping revisited
- KI 2003: Advances in Artificial Intelligence
Cited In (6)
- The Intelligent Grounder of DLV
- Disjunctive answer set solvers via templates
- Lpopt: a rule optimization tool for answer set programming
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- Conflict-driven answer set solving: from theory to practice
- ASPeRiX, a first-order forward chaining approach for answer set computing
Uses Software
This page was built for publication: Enhancing DLV instantiator by backjumping techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2426106)
