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.

Compositional Decomposition for Program Verification and Logical Reasoning 1
Compiling Disjunctive Logic Programs into Simpler Formats 1
Reducing Logical Entailment to Propositional Satisfiability 1
The Acyclic Constraint in Formal Reasoning Systems 1
Mitigating Representation Size Explosion in Logical Compilation 1
Managing Combinatorial Explosion in Automated Planning 1

Top Authors

AuthorPapers
Thomas Eiter4
Chitta Baral3
Tran Cao Son2
Fangzhen Lin1
Sheila A. McIlraith1

Impactful Papers

Papers from this venue that shaped research clusters.

Influential

Papers

TitleYear
A Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling2005
SELP - A System for Studying Strong Equivalence between Logic Programs2005
Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming2003
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation2003
Computing Preferred and Weakly Preferred Answer Sets by Meta Interpretation in Answer Set Programming2001
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results2001
Effect of knowledge representation on model based planning: experiments using logic programming encodings2001
Extending Answer Set Planning with Sequence, Conditional, Loop, Non-Deterministic Choice, and Procedure Constructs2001
Reasoning about Policies using Logic Programs2001