Answer Set Programming 2005

2 papers
Answer Set Programming 2005 featured research focused on enhancing the efficiency and modularity of logic programming systems. A primary theme involved solving complex reasoning problems through reductions to Boolean Satisfiability (SAT) and the integration of hybrid satisfiability search with symbolic computation. These technical advancements aimed to improve performance in large-scale planning by pruning search spaces more effectively. Practical applications and theoretical foundations were also prominent. Notable work included the development of modular ASP languages, exemplified by their application to complex scheduling tasks such as the ACC Tournament. Additionally, the introduction of the SELP system facilitated the study of strong equivalence between logic programs, providing tools for program analysis and optimization. Prolific contributors during this period included Fangzhen Lin, Yin Chen, and Chitta Baral, whose work bridged the gap between theoretical logic and practical problem-solving frameworks.

Top Research Directions

The 4 research directions with Answer Set Programming 2005 papers, ranked by paper count, next to 2003. Share is the fraction of the edition’s papers in the direction.

#Direction20052003Share 2005Share 20032003 rank
1Compositional Decomposition for Program Verification and Logical Reasoning1050.0%0.0%—
2Managing Combinatorial Explosion in Automated Planning1050.0%0.0%—
3Reducing Logical Entailment to Propositional Satisfiability1050.0%0.0%—
4The Acyclic Constraint in Formal Reasoning Systems1050.0%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Answer Set Programming 2005 papers: a paper credits every institution named in its affiliations, once. 4 institutions share 2 credited papers.

#InstitutionPapersShare20032003 rank
1Arizona State University 150.0%0—
2Hong Kong University of Science and Technology 150.0%0—
3South China Normal University 150.0%0—
4Sun Yat-sen University 150.0%0—

Download all institutions as CSV

About this data

Papers. Answer Set Programming 2005 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2003 use shares, since the edition went from 2 to 2 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Answer Set Programming 2005”, https://lacuna.tiptreesystems.com/venue/answer-set-programming/2005.

Top Authors

AuthorPapers
Chitta Baral1
Fangzhen Lin1

Impactful Papers

Papers from Answer Set Programming 2005 that shaped research clusters.

Influential

Papers

Title
A Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling
SELP - A System for Studying Strong Equivalence between Logic Programs