Extended stable semantics for normal and disjunctive programs
Logic programming
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Journal of the ACM (JACM)
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Reducing disjunctive to non-disjunctive semantics by shift-operations
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
ACM Transactions on Database Systems (TODS)
A characterization of the partial stable models for disjunctive deductive databases
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Expressive power and complexity of partial models for disjunctive deductive databases
Theoretical Computer Science
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fundamenta Informaticae - Special issue on Petri nets
Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Proceedings of the 1999 international conference on Logic programming
Extending and implementing the stable model semantics
Artificial Intelligence
On the partial semantics for disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Abduction in logic programming: a new definition and an abductive procedure based on rewriting
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
An incremental algorithm for generating all minimal models
Artificial Intelligence
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Recycling computed answers in rewrite systems for abduction
ACM Transactions on Computational Logic (TOCL)
Annals of Mathematics and Artificial Intelligence
Enhancing DLV instantiator by backjumping techniques
Annals of Mathematics and Artificial Intelligence
Experimenting with parallelism for the instantiation of ASP programs
Journal of Algorithms
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Enhancing a DLP System for Advanced Database Applications
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Journal of Computer Science and Technology
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
A parallel ASP instantiator based on DLV
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
A 25-year perspective on logic programming
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
DLVMC: enhanced model checking in DLV
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Dynamic Magic Sets and super-coherent answer set programs
AI Communications - Answer Set Programming
Detecting inconsistencies in large biological networks with answer set programming
Theory and Practice of Logic Programming
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Dynamic magic sets for programs with monotone recursive aggregates
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
ASPIDE: integrated development environment for answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
The third answer set programming competition: preliminary report of the system competition track
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Application of answer set programming for public health data integration and analysis
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
CIRC2DLP: translating circumscription into disjunctive logic programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Analysing and extending well-founded and partial stable semantics using partial equilibrium logic
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
On elementary loops of logic programs
Theory and Practice of Logic Programming
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
The intelligent grounder of DLV
Correct Reasoning
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Advanced conflict-driven disjunctive answer set solving
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.01 |
This article studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementation of stable models for normal (disjunction-free) programs can be used as the core inference engine. The unfolding is done in two separate steps. First, it is shown that partial stable models can be captured by total stable models using a simple linear and modular program transformation. Hence, reasoning tasks concerning partial stable models can be solved using an implementation of total stable models. Disjunctive partial stable models have been lacking implementations which now become available as the translation handles also the disjunctive case. Second, it is shown how total stable models of disjunctive programs can be determined by computing stable models for normal programs. Thus an implementation of stable models of normal programs can be used as a core engine for implementing disjunctive programs. The feasibility of the approach is demonstrated by constructing a system for computing stable models of disjunctive programs using the SMODELS system as the core engine. The performance of the resulting system is compared to that of DLV, which is a state-of-the-art system for disjunctive programs.