Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
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)
Engineering an Incremental ASP Solver
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A parallel ASP instantiator based on DLV
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
DLVMC: enhanced model checking in DLV
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Approximation of action theories and its application to conformant planning
Artificial Intelligence
Detecting inconsistencies in large biological networks with answer set programming
Theory and Practice of Logic Programming
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CMODELS: SAT-based disjunctive answer set solver
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The seventh QBF solvers evaluation (QBFEVAL’10)
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Unfounded sets and well-founded semantics of answer set programs with aggregates
Journal of Artificial Intelligence Research
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We introduce a new approach to disjunctive ASP solving that aims at an equitable interplay between "generating" and "testing" solver units. To this end, we develop novel characterizations of answer sets and unfounded sets allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks. This results in the new multithreaded disjunctive ASP solver claspD-2, greatly improving the performance of existing systems.