The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Progress Report on the Disjunctive Deductive Database System dlv
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
The Diagnosis Frontend of the dlv system
AI Communications
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Optimizing the Computation of Heuristics for Answer Set Programming Systems
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Planning under Incomplete Knowledge
CL '00 Proceedings of the First International Conference on Computational Logic
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The DLV Project: A Tour from Theory and Research to Applications and Market
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A 25-year perspective on logic programming
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Synthesis from temporal specifications using preferred answer set programming
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
The nomore++ approach to answer set solving
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An ordered logic program solver
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
The disjunctive datalog system DLV
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
| Hi-index | 0.00 |
dlv is a knowledge representation system, based on disjunctive logic programming, which offers front-ends to several advanced KR formalisms. This paper describes new techniques for the computation of answer sets of disjunctive logic programs, that have been developed and implemented in the dlv system. These techniques try to "push" the query goals in the process of model generation (query goals are often present either explicitly, like in planning and diagnosis, or implicitly in the form of integrity constraints). This way, a lot of useless models are discarded "a priori" and the computation converges rapidly toward the generation of the "right" answer set. A few preliminary benchmarks show dramatic efficiency gains due to the new techniques.