Design overview of the NAIL] system
Proceedings on Third international conference on logic programming
Some results and experiments in programming techniques for propositional logic
Computers and Operations Research - Special issue: Applications of integer programming
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Boole's logic and probability: a critical exposititon from the standpoint of contemporary algebra, logic, and probability theory
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
A quantitative approach to logical inference
Decision Support Systems
Computation-oriented reductions of predicate to propositional logic
Decision Support Systems
A logical language for data and knowledge bases
A logical language for data and knowledge bases
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indefinite and maybe information in relational databases
ACM Transactions on Database Systems (TODS)
Efficient compilation of large rule bases using logical access paths
Information Systems - Knowledge engineering
Some results on exact data dependence analysis
Selected papers of the second workshop on Languages and compilers for parallel computing
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Declarative control architecture
Communications of the ACM
An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mixed integer programming methods for computing nonmonotonic deductive databases
Journal of the ACM (JACM)
Computing circumscriptive databases, I: theory and algorithms
Information and Computation
Rewriting of rules containing set terms in a logic data language LDL
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Artificial Intelligence Programming
Artificial Intelligence Programming
CORAL - Control, Relations and Logic
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
ACM Transactions on Database Systems (TODS)
WFS + Branch and Bound = Stable Models
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
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Modelling legal reasoning in a mathematical environment through model theoretic semantics
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
| Hi-index | 0.00 |
Existing and past generations of Prolog compilers have left deduction to run-time and this may account for the poor run-time performance of existing Prolog systems. Our work tries to minimize run-time deduction by shifting the deductive process to compile-time. In addition, we offer an alternative inferencing procedure based on translating logic to mixed integer programming. This makes available for research and implementation in deductive databases, all the theorems, algorithms, and software packages developed by the operations research community over the past 50 years. The method keeps the same query language as for disjunctive deductive databases, only the inferencing procedure changes. The language is purely declarative, independent of the order of rules in the program, and independent of the order in which literals occur in clause bodies. The technique avoids Prolog's problem of infinite looping. It saves run-time by doing primary inferencing at compile-time. Furthermore, it is incremental in nature. The first half of this article translates disjunctive clauses, integrity constraints, and database facts into Boolean equations, and develops procedures to use mixed integer programming methods to compute equations, and develops procedures to use mixed integer programming methods to compute equations, and develops procedures to use mixed integer programming methods to compute equations, and develops procedures to use mixed integer programming methods to compute—least models of definite deductive databases, and—minimal models and the Generalized Closed World Assumption of disjunctive databases.