Answer Set Programming 2001
5 papers
The 2001 edition of the Answer Set Programming workshop featured seven research papers primarily focused on computational methodologies and the application of logic programming to planning. A significant portion of the work addressed the technical aspects of model computation, including the use of meta-interpretation to determine preferred answer sets and the application of Quantified Boolean Formulas to compute stable models.
Planning emerged as a central theme, with researchers exploring how different knowledge representation encodings affect the efficiency of model-based planning. Additionally, work was presented on extending answer set planning to incorporate complex programming constructs such as sequences, conditionals, loops, and non-deterministic choices. Other research explored the use of logic programs for reasoning about policies. Prolific contributors to this year's proceedings included Chitta Baral, Tran Cao Son, Thomas Eiter, and Sheila A. McIlraith. These contributions reflected a trend toward enhancing the expressive power and computational efficiency of ASP in practical reasoning tasks.
Top Authors
| Author | Papers |
|---|---|
| Chitta Baral | 2 |
| Thomas Eiter | 2 |
| Tran Cao Son | 2 |
| Sheila A. McIlraith | 1 |