The semantics of lazy functional languages
Theoretical Computer Science
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
All structured programs have small tree width and good register allocation
Information and Computation
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
A comparison of structural CSP decomposition methods
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Query evaluation and optimization in the semantic web
Theory and Practice of Logic Programming
On odd and even cycles in normal logic programs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Belief Revision with Bounded Treewidth
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
A dynamic-programming based ASP-solver
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Evaluating tree-decomposition based algorithms for answer set programming
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
Hi-index | 0.00 |
In this paper, we present a novel approach to the evaluation of propositional answer-set programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our algorithm relies on dynamic programming. Therefore, our approach significantly differs from standard ASP systems which implement techniques stemming from SAT or CSP, and thus usually do not exploit fixed parameter properties of the programs. We provide first experimental results which underline that, for programs with low treewidth, even a prototypical implementation is competitive compared to state-of-the-art systems.