Colin Bell
- 1.F. Bancilhon, D. Maier, Y. Sagiv and J. Ullman. (1986) Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. ACM-PODS, pp 1-15. Google Scholar
Digital Library
- 2.F. Baneilhon and R. Ramakrishnan. (1986) An Amateur's Introduction to Recursive Query Processing Strategies, Proc. ACM-SIGMOD, pp 16- 52. Google ScholarDigital Library
- 3.C. Beeri and R. Ramakrishnan. (1987) On the Power of Magic, Proc. 6th Syrup. on Principles of Database Systems, pps. 269-283. Google ScholarDigital Library
- 4.C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian. (1991) Implementing Deductzve Databases by Linear Programming, Tech. Report CS-TR- 2747, University of Maryland, College Park. Google Scholar
- 5.C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian. (1991) Computation and {mplemenlatzon of Non-monotonzc Deduclive Databases, submitted to a technical journal. Google ScholarDigital Library
- 6.C. Blair, R.G. Jeroslow and J.K. Lowe. (1988) Some Results and Experiments in Programming Techniques for Propositional Logic, Computers and Operations Research, 13, pps 633-645. Google ScholarDigital Library
- 7.F. Hillier and G. Lieberman. (1974) Operations Research, Holden-Day.Google Scholar
- 8.J. Hooker and C. Fedjki. (1990) Branch-and.Cut Solution of Inference Problems in Propositional Logic, Annals of Mathematics and Artificial intelligence, pp 123-139.Google ScholarDigital Library
- 9.J. Jaffar and J.L. Lassez. (1987) Constraint Logic Programming, Proc. ACM Principles of Programming Languages, pp 111-119. Google ScholarDigital Library
- 10.R. E. Jeroslow. (1988) Computation-Oriented Reductions of Predicate to Propositional Logic, Decision Support Systems, 4, pps 183-187. Google ScholarDigital Library
- 11.P. Kanellakis, G. Kuper and P. Revesz. (1990) Constraint Query Languages, Proc. 9th ACM Syrup. on Principles of Database Systems, pps 299-313. Google ScholarDigital Library
- 12.L. G. Khachian. (1979) A Polynomial Algorithm for Linear Programming, Doklady Akad. Nauk USSR 224, pp 1093-1096. Translated in Soviet Math Doklady, 20, pp. 191-194.Google Scholar
- 13.M. Maher. (1991) Personal electronic mail message, July 29, 1991.Google Scholar
- 14.J. Minker. (1982) On Indefinite Palabases and the Closed World Assumption, Proc. 6th Conference on Automated Deduction, (ed. D. Loveland), Lecture Notes in Computer Science, Vol. 138, pps 292-308, Springer. Google ScholarDigital Library
- 15.K. Morris, a. Ullman and A. van Gelder. (1986) Design Overview of the NAIL System, in: Proc. 3rd Intl. Conf. on Logic Programming (ed. E. Shapiro), pps 554-568, Springer LNCS 225, Springer Verlag. Google ScholarDigital Library
- 16.D.S. Nau, V.S. Subrahmanian and C. Vago. (1992) WFS + Branch and Bound = Stable Models, Tech. Report, Univ. of Maryland, College Park. Google Scholar
- 17.N. Roussopoulos. (1991) The Incremental Access Method of View Cache: Concept and Cost Analysis, ACM Transactions on Database Systems, September 1991. Google ScholarDigital Library
- 18.O. Shmueli, S. Tsur and C. Zaniolo. (1988) Rewriting of Rules Containing Set Terms in a Logic Data Language, in: Proc. 7th Symp. on Principles of Database Systems, pps 15-28. Google ScholarDigital Library
- 19.J. D. Ullman. (1989) Bottom-Up BaaLs Top-Down for Datalog, Proc. 1989 Symp. on Principles of Database Systems, pps 140-149. Google ScholarDigital Library
- 20.A. van Gelder. (1989) The Alternating Fzxpoint of Logic Programs w,lh Negation, Proc. 8th ACM Symp. on Principles of Database Systems, pps 1 -10. Google ScholarDigital Library
Index Terms
- Implementing deductive databases by linear programming
Recommendations
Implementing deductive databases by mixed integer programming
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 ...
Deductive databases: achievements and future directions
Directions for future database research & developmentIn the recent years, Deductive Databases have been the focus of intense research, which has brought dramatic advances in theory, systems and applications. A salient feature of deductive databases is their capability of supporting a declarative, rule-...
On linear programming relaxations for solving polynomial programming problems
Highlights- Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.
AbstractThis paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing ...
Comments