A dynamic-programming based ASP-solver

Authors:
Michael Morak;Reinhard Pichler;Stefan Rümmele;Stefan Woltran
Affiliations:
Institut für Informationssysteme, Technische Universität Wien, Wien, Austria;Institut für Informationssysteme, Technische Universität Wien, Wien, Austria;Institut für Informationssysteme, Technische Universität Wien, Wien, Austria;Institut für Informationssysteme, Technische Universität Wien, Wien, Austria
Venue:
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Year:
2010

Citing 6
Cited 1

Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Heuristic Methods for Hypertree Decomposition

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial 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 Second Answer Set Programming Competition

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Answer-set programming with bounded treewidth

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Evaluating tree-decomposition based algorithms for answer set programming

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs from standard ASP-solvers which implement techniques stemming from SAT or CSP.