Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Mixed integer programming methods for computing nonmonotonic deductive databases
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Reasoning with minimal models: efficient algorithms and applications
Artificial Intelligence
Proceedings of the 1999 international conference on Logic programming
Declarative problem-solving in DLV
Logic-based artificial intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Database System Implementation
Database System Implementation
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Answer Set Programming: A Primer
Reasoning Web. Semantic Technologies for Information Systems
Computing Stable Models via Reductions to Difference Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A Simple Distributed Conflict-Driven Answer Set Solver
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Conflict-Driven Answer Set Solver clasp: Progress Report
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The First Version of a New ASP Solver: ASPeRiX
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
GASP: Answer Set Programming with Lazy Grounding
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Detecting inconsistencies in large biological networks with answer set programming
Theory and Practice of Logic Programming
CMODELS: SAT-based disjunctive answer set solver
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The nomore++ approach to answer set solving
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Solving disjunctive temporal problems with preferences using maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
The intelligent grounder of DLV
Correct Reasoning
The multi-engine ASP solver ME-ASP
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
Answer set programming: language, applications and development tools
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
A Tabled Prolog Program for Solving Sokoban
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
Answer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The Third ASP Competition, as the sequel to the ASP Competitions Series held at the University of Potsdam in Germany (2006-2007) and at the University of Leuven in Belgium in 2009, took place at the University of Calabria (Italy) in the first half of 2011. Participants competed on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. The Competition ran on two tracks: the Model & Solve Competition, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Competition, held on the basis of fixed, public problem encodings, written in a standard ASP language. This paper briefly discuss the format and rationale of the System competition track, and preliminarily reports its results.