A dynamic-programming based ASP-solver

DOI10.1007/978-3-642-15675-5_34MaRDI QIDQ4930781zbMATH OpenOpenAlexFDO

Authors Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Publication date 1 October 2010

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15675-5_34

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Dynamic programming (90C39)

Recommendations

• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
• D-FLAT: declarative problem solving using tree decompositions and answer-set programming
• The ASP system DLV2
• Answer Set Programming: A Primer
• Answer set programming based on propositional satisfiability

Cited in

(12)

• Backdoors to tractable answer set programming
• The ASP system DLV2
• Hybrid ASP
• Reactive answer set programming
• ASP solving for expanding universes
• Multi-level Algorithm Selection for ASP
• Computing weighted solutions in ASP: representation-based method vs. search-based method
• D-FLAT: declarative problem solving using tree decompositions and answer-set programming
• An ASP-based solver for parametrized-difference revision
• Partial compilation of ASP programs
• Treewidth in non-ground answer set solving and alliance problems in graphs
• scientific article; zbMATH DE number 6261538 (Why is no real title available?)

Describes a project that uses

Uses Software

• dynASP

This page was built for publication: A dynamic-programming based ASP-solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930781)