A Dynamic-Programming Based ASP-Solver

13 years 3 months ago

Download www.dbai.tuwien.ac.at

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

Michael Morak, Reinhard Pichler, Stefan Rümme

Real-time Traffic

Artificial Intelligence | Dynamic Programming | JELIA 2010 | Propositional Answer-set Programming |

claim paper

Related Content

» Constraint Answer Set Solving

» A new video similarity measure model based on video time density function and dynamic prog...

» Dynamic Programming Algorithms for TransitionBased Dependency Parsers

» Expert System Design of Two Electrostatic Lenses Column by Mixing Dynamic Programming and ...

» Type harvesting a practical approach to obtaining typing information in dynamic programmin...

» Pathologies of temporal difference methods in approximate dynamic programming

» A MetaProgramming Technique for Debugging AnswerSet Programs

» Planning in Answer Set Programming using Ordered Task Decomposition

» Accelerating the Nussinov RNA folding algorithm with CUDAGPU

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JELIA
Authors	Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Comments (0)

Sciweavers

A Dynamic-Programming Based ASP-Solver

Artificial Intelligence | Dynamic Programming | JELIA 2010 | Propositional Answer-set Programming |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers