Implementing Deductive Databases by Mixed Integer Programming

ACM Transactions on Database Systems

Volumn 21, Issue 2, 1996, Pages 238-269

  Bell, Colin ^a   Nerode, Anil ^b   Ng, Raymond T ^c   Subrahmanian, V S ^d,e  

^a UNIVERSITY OF IOWA   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d UNIVERSITY OF MARYLAND   (United States)

^e University of Iowa ^*  (United States)

Author keywords

Deductive databases; F.4.1 Mathematical Logic and Formal Languages : Mathematical Logic; H.2.3 Database Management : Languages; I.2.4 Artificial Intelligence : Knowledge Representation Formalisms and Methods; Languages; Theory; Verification

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SOFTWARE; INTEGER PROGRAMMING; QUERY LANGUAGES;

DEDUCTIVE DATABASES; MIXED INTEGER PROGRAMMING;

DATABASE SYSTEMS;

EID: 0030164696     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/232616.232691     Document Type: Article

References (52)

1. BANCILHON, F., MAIER, D., SAGIV, Y., AND ULLMAN, J. 1986. Magic sets and other strange ways to implement logic programs. In Proceedings of ACM-PODS, 1-15.
2. BANCILHON, F. AND RAMAKKISHNAN, R. 1986. An amateur's introduction to recursive query processing strategies. In Proceedings of ACM-SIGMOD, 16-52.
3. BEERI, C. AND RAMAKRISHNAN, R. 1987. On the Power of Magic. In Proceedings of the Sixth Symposium on Principles of Database Systems, 269-283.
4. BELL, C., NERODE, A., NG, R., AND SUBRAHMANIAN, V. S. 1994. Mixed integer programming methods for computing nonmonotonic deductive databases. J. ACM 41, 6 (Nov.) 1178-1215.
5. BLAIR, C., JEROSLOW, R. G., AND LOWE, J. K. 1988. Some results and experiments in programming techniques for propositional logic. Comput. Oper. Res. 13, 633-645.
6. BLAKELEY, J., LARSON, P., AND TOWPA, F. 1986. Efficiently updating materialized views. In Proceedings of ACM-SIGMOD, 61-71.
7. BLUM, L., SHUB, M., AND SMALE, S. 1989. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21, 1-46.
8. BRY, R. 1989. Query evaluation in deductive databases: Bottom-up and top-down reconciled. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases, 25-44.
9. CADOLI, M. AND LENZERINI, M. 1990. The complexity of closed world reasoning and circumscription. In Proceedings of AAAI-90, 550-555.
10. CHANDRASEKARAN, R. 1984. Integer programming problems for which a simple rounding type of algorithm works. In Progress in Combinatorial Optimization, W. Pulleyblank, Ed., Academic Press, San Diego, CA, 101-106.
11. CHANDRU, V. AND HOOKER, J. 1991. Extended Horn sets in propositional logic. J. ACM 38, 1, 205-221.
12. CHARNIAK, E., RIESBECK, C., AND MCDERMOTT, D. 1980. Artificial Intelligence Programming, L. Erlbaum Associates, New York.
13. DIETRICH, S. W. 1987. Extension tables: Memo relations in logic programming. In Proceedings of the Fourth IEEE Symposium on Logic Programming, 264-272.
14. DOWLING, W. AND GALLIER, J. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn theories. J. Logic Program. 3, 267-284.
15. FERNANDEZ, J. A. AND MINKER, J. 1991. Bottom-up evaluation of hierarchical disjunctive deductive databases. In Proceedings of the International Conference on Logic Programming, (Paris, France, June) 661-675.
16. GILLETT, B. E. 1976. Introduction to Operations Research: A Computer-Oriented Algorithmic Approach. McGraw Hill, New York.
17. GOMORY, R. E. 1965. On the relation between integer and non-integer solutions to linear programs. Proc. Nat. Acad. Sci. 53, 260-265.
18. GOTTLOB, G., MARCUS, S., NERODE, A., SALZER, G., AND SUBRAHMANIAN, V. S. 1993. A non-ground realization of stable and well-founded semantics. Accepted for publication: Theoretical Computer Science.
19. GUPTA, A., MUMICK, I., AND SUBRAHMANIAN, V. S. 1993. Maintaining views incrementally. In Proceedings of the 1993 ACM SIGMOD Conference on Management of Data (Washington, D.C., May), 157-166.
20. HAILPERIN, T. 1976. Boole's Logic and Probability: A Critical Exposition from the Standpoint of Contemporary Algebra, Logic and Probability Theory. North Holland, Amsterdam.
21. HILLIER, F. AND LIEBERMAN, G. 1990. Operations Research. McGraw-Hill, New York.
22. HOOKER, J. 1988. A quantitative approach to logical inferences. Decis. Support Syst. 4, 45-69.
23. HOOKER, J. AND FEDJKI, C. 1990. Branch-and-cut solution of inference problems in propositional logic. Ann. Math. Artif. Intell. 123-139.
24. JAFFAR, J. AND LASSEZ, J. L. 1987. Constraint logic programming. In Proceedings of ACM Principles of Programming Languages, 111-119.
25. JEROSLOW, R. E. 1989. Logic-Based Decision Support: Mixed Integer Model Formulation. North Holland, Amsterdam.
26. JEROSLOW, R. E. 1988. Computation-oriented reductions of predicate to propositional logic. Decis. Support Syst. 4, 183-187.
27. JEROSLOW, R. AND WANG, J. 1990. Solving propositional satisfiability problems. Ann. Math. Artif. Intell. 167-187.
28. KAGAN, V., NERODE, A., AND SUBRAHMANIAN, V. S. 1994a. Computing definite logic programs by partial instantiation. Ann. Pure Appl. Logic, 67, 161-182.
29. KAGAN, V., NERODE, A., AND SUBRAHMANIAN, V. S. 1994b. Computing minimal models by partial instantiation. Accepted for publication: Theoretical Computer Science.
30. KARMARKAR, N. 1988. Methods and apparatus for efficient resource allocation. Patent Number 4744028, US Patent Office.
31. KOHN, W. 1991. Declarative control architecture. CACM 34, 8, 64-79.
32. KOHN, W. AND NERODE, A. 1993. Autonomous control theory of hybrid systems: The implementation. IEEE-CDC 93 (to appear).
33. LI, Z. AND YES, P. 1990. Some results on exact data dependence analysis. In Languages and Compilers for Parallel Computing, D. Gelernter, A. Nicolau, and D. Padua, Eds. MIT Press, Cambridge, MA.
34. LIU, K. AND SUNDERRAMAN, R. 1990. Indefinite and maybe information in relational databases. ACM Trans. Database Syst. 15, 1, 1-39.
35. LLOYD, J. W. 1987. Foundations of Logic Programming. Springer-Verlag, Heidelberg, Germany.
36. LUO, J. AND REIJNS, G. 1992. Parallel implementation of two algorithms to solve linear programming problems. In Transputing in Numerical and Neural Network Applications, IOS Press, Amsterdam, 48-65.
37. MAHER, M. 1991. Personal electronic mail message, July 29, 1991.
38. MINKER, J. 1982. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction (New York), D. Loveland, Ed., Lecture Notes in Computer Science, Vol. 138, Springer-Verlag, 292-308.
39. MORRIS, K., ULLMAN, J., AND VAN GELDER, A. 1986. Design overview of the NAIL system. In Proceedings of the Third International Conference on Logic Programming (London, UK), E. Shapiro, Ed., Springer LNCS 225, Springer-Verlag, 554-568.
40. NAQVI, S. AND TSUR, S. 1989. A Logical Language for Data and Knowledge Bases. Computer Science Press, New York.
41. NERODE, A., NG, R., AND SUBRAHMANIAN, V. S. 1995. Computing circumscription by linear programming. Inf. Comput., 116, 58-80.
42. RAMAKRISHNAN, R., SRIVASTAVA, D., AND SUDARSHAN, S. 1992. CORAL - control, relations and logic. In Proceedings of the Eighteenth VLDB, 238-250.
43. ROUSSOPOULOS, N. 1991. The incremental access method of view cache: Concept and cost analysis. ACM Trans. Database Syst. 16, 3, 535-563.
44. SELLIS, T., ROUSSOPOULOS, N., AND NG, R. 1990. Efficient compilation of large rule bases using logical access paths. Inf. Syst. 15, 1, 73-84.
45. SHMUELI, O., TSUR, S., AND ZANIOLO, C. 1988. Rewriting of rules containing set terms in a logic data language. In Proceedings of the Seventh Symposium on Principles of Database Systems, 15-28.
46. ULLMAN, J. D. 1989. Bottom-up beats top-down for Datalog. In Proceedings of the 1989 Symposium on Principles of Database Systems (Philadelphia, PA, May), 140-149.
47. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base System, Vol. 1. Computer Science Press, New York.
48. VAN EMDEN, M. H. AND KOWALSKI, R. A. 1976. The semantics of predicate logic as a programming language. J. ACM 23, 4, 733-742.
49. VAN GELDER, A. 1989. The alternating fixpoint of logic programs with negation. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, 1-10.
50. WARREN, D. S. 1992. Memoing for logic programs. Commun. ACM 35, 3, 94-111.
51. YAHYA, A. AND HENSCHEN, L. J. 1985. Deduction in non-Horn databases. J. Autom. Reasoning 1, 2, 141-160.
52. ZANIOLO, C. 1988. Design and implementation of a logic-based language for data-intensive applications. In Proceedings of the International Conference on Logic Programming, K. Bowen and R. Kowalski, Eds. MIT Press, Cambridge, MA, 1666-1687.