Answer Set Programming
9 papers6 directions
Answer Set Programming (ASP) functioned as a research venue between 2001 and 2005, focusing on the development and application of declarative logic programming within the broader field of artificial intelligence. The venue published research centered on solving complex reasoning problems, often through SAT reductions and hybrid satisfiability search techniques combined with symbolic computation. Key research directions included the complexity of answer set checking, knowledge compilation, and addressing the challenges of representation blow-up in knowledge-based systems.
The venue's contributions to the AI community involved both theoretical advancements and practical implementations. Research frequently explored methods for pruning search spaces in large-scale planning and techniques for eliminating disjunction in logic programs while preserving stable models. Notable work also addressed the formal properties of logic programs, such as strong equivalence, and the application of modular ASP to real-world scheduling tasks like the ACC tournament. Prolific authors associated with this venue include Chitta Baral, Thomas Eiter, Stefan Woltran, and Tran Cao Son, whose collective work advanced the understanding of stable model semantics and the use of quantified Boolean formulas for computation.
Papers by Year
| 2005 | 2 |
| 2003 | 2 |
| 2001 | 5 |
Top Research Directions
Research directions most represented by papers from this venue.
Top Authors
| Author | Papers |
|---|---|
| Thomas Eiter | 4 |
| Chitta Baral | 3 |
| Tran Cao Son | 2 |
| Fangzhen Lin | 1 |
| Sheila A. McIlraith | 1 |
Impactful Papers
Papers from this venue that shaped research clusters.
Influential
SELP - A System for Studying Strong Equivalence between Logic Programs
influential
Reducing Logical Entailment to Propositi
2005