Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach
From Tetherless World Wiki
Citation: Tran Cao Son and Chitta Baral and Sheila A. McIlraith. (2001) Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001), September,2001.
| Publication inproceedings ( Edit ) | |
| type | InProceedings |
| bibtype | inproceedings |
| Bibtex basics | |
| author | Tran Cao Son and Chitta Baral and Sheila A. McIlraith |
| title | Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach |
| booktitle | Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001) |
| address | Vienna, Austria |
| year | 2001 |
| month | September |
| Bibtex more | |
| Access Paper | |
| abstract | In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP).Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning with temporal knowledge into ASP. To do so, we view domain-dependent control knowledge as sets of independent constraints. An advantage of this approach is that domain-dependent control knowledge can be modularly formalized and added to the planning problem as desired. We define a setof constructs for constraint representation and provide a set of domain independentlogic programming rules for checking constraint satisfaction. |
| KSL Technical Report ID: KSL-01-18 |
Facts about Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming ApproachRDF feed
| Abstract | In this paper we present a declarative app … In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP).Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning with temporal knowledge into ASP. To do so, we view domain-dependent control knowledge as sets of independent constraints. An advantage of this approach is that domain-dependent control knowledge can be modularly formalized and added to the planning problem as desired. We define a setof constructs for constraint representation and provide a set of domain independentlogic programming rules for checking constraint satisfaction. ules for checking constraint satisfaction. |
| Address | Vienna, Austria + |
| Author | Tran Cao Son and Chitta Baral and Sheila A. McIlraith + |
| Bibtype | inproceedings + |
| Booktitle | Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001) + |
| Has author | Tran Cao Son and Chitta Baral and Sheila A. McIlraith + |
| Has identifier | KSL-01-18 + |
| Has publishing details | September,2001 + |
| Has title | Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach + |
| Has where published | Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001) + |
| Has year | 2001 + |
| Ksl tr id | KSL-01-18 + |
| Month | September + |
| Process note | NO + |
| Title | Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach + |
| Year | 2001 + |
