Planning with different forms of domain-dependent control knowledge - an answer set programming approach

From Semantic Portal Wiki

{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}

Edit

Reference: {{#vardefine:pagename|planning with different forms of domain-dependent control knowledge - an answer set programming approach }}

1. [[]]

bibtex

{{#vardefine:pagename|Planning with different forms of domain-dependent control knowledge - an answer set programming approach }}{{#vardefine:key| }}

abstract: In this paper we present a declarative approach to addingdomain-dependent control knowledge for Answer Set Planning (ASP).Our approach allows different types of domain-dependent control knowledgesuch as hierarchical, temporal, or procedural knowledge to be representedand exploited in parallel, thus combining the ideas of controlknowledge in HTN-planning, GOLOG-programming, and planning withtemporal knowledge into ASP. To do so, we view domain-dependent controlknowledge as sets of independent constraints. An advantage of thisapproach is that domain-dependent control knowledge can be modularlyformalized and added to the planning problem as desired. We define a setof constructs for constraint representation and provide a set of domainindependentlogic programming rules for checking constraint satisfaction.

download:

• paper:
• slides: