The power of non-ground rules in Answer Set Programming
From MaRDI portal
Publication:4593042
DOI10.1017/S1471068416000338zbMath1379.68042arXiv1608.01856MaRDI QIDQ4593042
Manuel Bichler, Michael Morak, Stefan Woltran
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01856
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items
Lpopt: a rule optimization tool for answer set programming ⋮ Reasoning on with Defeasibility in ASP ⋮ Unnamed Item ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Abstraction for non-ground answer set programs
Uses Software
Cites Work
- Unnamed Item
- Abduction from logic programs: Semantics and complexity
- On the complexity of single-rule datalog queries.
- Conflict-driven answer set solving: from theory to practice
- On the computational cost of disjunctive logic programming: Propositional case
- Complexity results for answer set programming with bounded predicate arities and implications
- Complex optimization in answer set programming
- GASP: Answer Set Programming with Lazy Grounding
- Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
- Complexity of Finding Embeddings in a k-Tree
- Unfolding partiality and disjunctions in stable model semantics
- Lazy Model Expansion by Incremental Grounding
- Preprocessing of Complex Non-Ground Rules in Answer Set Programming
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
