Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
WFS + branch and bound = stable models
WFS + branch and bound = stable models
Safe computation of the well-founded semantics of Datalog queries
Information Systems
Stable and extension class theory for logic programs and default logics
Journal of Automated Reasoning
Mixed integer programming methods for computing nonmonotonic deductive databases
Journal of the ACM (JACM)
Computing minimal models by partial instantiation
Theoretical Computer Science
Implementing deductive databases by mixed integer programming
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mixed integer programming methods for computing nonmonotonic deductive databases
Journal of the ACM (JACM)
Extending and implementing the stable model semantics
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Resolution for Skeptical Stable Model Semantics
Journal of Automated Reasoning
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
Computing Stable Models: Worst-Case Performance Estimates
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Efficient Computation of the Well-Founded Model Using Update Propagation
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Non-monotonic Reasoning on Beowulf Platforms
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Hypothesis-Founded Semantics for Datalog Programs with Negation
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
On the Problem of Computing the Well-Founded Semantics
CL '00 Proceedings of the First International Conference on Computational Logic
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
A Logical Framework for Reasoning on Data Access Control Policies
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Computing stable models: worst-case performance estimates
Theory and Practice of Logic Programming
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
On the problem of computing the well-founded semantics
Theory and Practice of Logic Programming
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
Issues in parallel execution of non-monotonic reasoning systems
Parallel Computing
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Experimenting with parallelism for the instantiation of ASP programs
Journal of Algorithms
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 hierarchy of tractable subsets for computing 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
Towards the computation of stable probabilistic model semantics
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
A 25-year perspective on logic programming
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
Approximating answer sets of unitary lifschitz-woo programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Hi-index | 0.00 |
Though the semantics of nonmonotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. In this paper, we develop techniques to compute the well-founded model of a logic program. We describe a prototype implementation and show, based on experimental results, that our technique is more efficient than the standard alternating fixpoint computation. Subsequently, we develop techniques to compute the set of all stable models of a deductive database. These techniques first compute the well-founded semantics and then use an intelligent branch and bound strategy to compute the stable models. We report on our implementation, as well as on experiments that we have conducted on the efficiency of our approach.