Some results and experiments in programming techniques for propositional logic
Computers and Operations Research - Special issue: Applications of integer programming
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Integer and combinatorial optimization
Integer and combinatorial optimization
A quantitative approach to logical inference
Decision Support Systems
Computation-oriented reductions of predicate to propositional logic
Decision Support Systems
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Paraconsistent logic programming
Theoretical Computer Science
Logic programs with classical negation
Logic programming
Reasoning in inconsistent knowledge bases
Reasoning in inconsistent knowledge bases
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Theoretical Computer Science
Implementing deductive databases by linear programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computing minimal models by partial instantiation
Theoretical Computer Science
A Petri Net Model for Reasoning in the Presence of Inconsistency
IEEE Transactions on Knowledge and Data Engineering
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Implementing deductive databases by mixed integer programming
ACM Transactions on Database Systems (TODS)
Foundations of multimedia database systems
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
ProbView: a flexible probabilistic database system
ACM Transactions on Database Systems (TODS)
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
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
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
Towards Default Reasoning through MAX-SAT
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Automated deduction for many-valued logics
Handbook of automated reasoning
Modelling legal reasoning in a mathematical environment through model theoretic semantics
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
An incremental algorithm for generating all minimal models
Artificial Intelligence
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Experimenting with parallelism for the instantiation of ASP programs
Journal of Algorithms
Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
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
An incremental algorithm for generating all minimal models
Artificial Intelligence
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
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
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Hi-index | 0.01 |
Though the declarative semantics of both explicit and nonmonotonic negation in logic programs has been studied extensively, relatively little work has been done on computation and implementation of these semantics. In this paper, we study three different approaches to computing stable models of logic programs based on mixed integer linear programming methods for automated deduction introduced by R. Jeroslow. We subsequently discuss the relative efficiency of these algorithms. The results of experiments with a prototype compiler implemented by us tend to confirm our theoretical discussion. In contrast to resolution, the mixed integer programming methodology is both fully declarative and handles reuse of old computations gracefully.We also introduce, compare, implement, and experiment with linear constraints corresponding to four semantics for “explicit” negation in logic programs: the four-valued annotated semantics [Blair and Subrahmanian 1989], the Gelfond-Lifschitz semantics [1990], the over-determined models [Grant and Subrahmanian 1989], the Gelfond-Lifschitz semantics [1990], the over-determined models [Grant and Subrahmanian 1990], and the classical logic semantics. Gelfond and Lifschitz[1990] argue for simultaneous use of two modes of negation in logic programs, “classical” and “nonmonotonic,” so we give algorithms for computing “answer sets” for such logic programs too.