Optimizing Answer Set Computation via Heuristic-Based Decomposition
From MaRDI portal
Publication:4957190
DOI10.1017/S1471068419000036zbMath1472.68024arXiv1812.09718MaRDI QIDQ4957190
Jessica Zangari, Francesco Calimeri, Simona Perri
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.09718
knowledge representation; nonmonotonic reasoning; logic programming; answer set programming; databases; semantic web reasoning
Related Items
Unnamed Item, Incremental Answer Set Programming with Overgrounding, Precomputing Datalog Evaluation Plans in Large-Scale Scenarios, Incremental maintenance of overgrounded logic programs with tailored simplifications, Estimating grounding sizes of logic programs under answer set semantics, Lpopt: a rule optimization tool for answer set programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Answer set programming based on propositional satisfiability
- Design and results of the Fifth Answer Set Programming Competition
- Reasoning with minimal models: efficient algorithms and applications
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Propositional semantics for disjunctive logic programs
- The design of the Seventh Answer Set Programming Competition
- Blending lazy-grounding and CDNL search for answer-set solving
- The ASP system DLV2
- Lpopt: a rule optimization tool for answer set programming
- Enhancing DLV instantiator by backjumping techniques
- The Intelligent Grounder of DLV
- GASP: Answer Set Programming with Lazy Grounding
- Advances in WASP
- Progress in clasp Series 3
- The Design of the Sixth Answer Set Programming Competition
- Experimenting with parallelism for the instantiation of ASP programs
- Graph minors. II. Algorithmic aspects of tree-width
- The power of non-ground rules in Answer Set Programming
- ASPeRiX, a first-order forward chaining approach for answer set computing
- Multi-shot ASP solving with clingo
- The Impact of Treewidth on Grounding and Solving of Answer Set Programs
- Unfolding partiality and disjunctions in stable model semantics
- The DLV system for knowledge representation and reasoning
- Parallel instantiation of ASP programs: techniques and experiments
- Preprocessing of Complex Non-Ground Rules in Answer Set Programming
- Logic Programming and Nonmonotonic Reasoning
- Graph-Theoretic Concepts in Computer Science