Computing minimal models by partial instantiation

Theoretical Computer Science

Volumn 155, Issue 1, 1996, Pages 157-177

  Kagan, Vadim ^a   Nerode, Anil ^b   Subrahmanian, V S ^c  

^a University of Maryland ^*  (United States)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MATHEMATICAL MODELS;

MINIMAL MODELS; PARTIAL INSTANTIATION;

LOGIC PROGRAMMING;

EID: 0030085614     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00216-9     Document Type: Article

References (25)

1. C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Mixed integer programming methods for computing nonmonotonic deductive databases, J. Assoc. Comput. Mach. 41 (1994) 1178-1215.
2. C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Implementing deductive databases by linear programming, in: Proc. ACM-PODS (1992) 283-292; full version accepted for publication in: ACM Trans. on Database Systems.
3. C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Implementing deductive databases by linear programming, in: Proc. ACM-PODS (1992) 283-292; full version accepted for publication in: ACM Trans. on Database Systems.
4. C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Implementing stable semantics by linear programming, in: Proc. 1993 Internat. Workshop on Logic Programming and Nonmonotonic Reasoning (MIT Press, Cambridge, MA, 1993).
5. R. Ben-Eliyahu and R. Dechter, On computing minimal models, in: Proc. AAAI-93 (1993) 2-8.
6. V. Chandru and J. Hooker, Extended Horn sets in propositional logic, J. Assoc. Comput. Mach. 38 (1) (1991) 205-221.
7. C.L. Chang and R.C.T. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973)
8. 2-complete, Inform. Process. Lett. 34 (1990) 289-291.
9. M. Falaschi, G. Levi, M. Martelli and C. Palamidessi, A new declarative semantics for logic languages, in: K. Bowen and R. Kowalski, eds., Proc. 1988 Joint Internat. Conf. on Logic Programming, 993-1005.
10. J. Fernandez, J. Lobo, J. Minker and V.S. Subrahmanian, Disjunctive LP + integrity constraints = stable model semantics, Ann. of Math. Artificial Intelligence 8 (1993) 449-474.
11. J. Fernandez and J. Minker, Bottom-up evaluation of hierarchical disjunctive databases, in: K. Furukawa, ed., Proc. Eight Internat. Conf. on Logic Prog, pp. 660-675.
12. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski and K.A. Bowen, eds., Proc. 5th International Conference and Symposium on Logic Programming, 1070-1080
13. R.E. Jeroslow, Computation-oriented reductions of predicate to propositional logic, Decision Support Systems 4 (1988) 183-187.
14. R. Jeroslow and J. Wang, Solving propositional satisfiability problems, Ann of Math. Artificial Intelligence 1 (1990) 167-187.
15. P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages, in: Proc. 9th ACM Symp. on Principles of Database Systems, 299-313.
16. J.-L. Lassez, M. Maher and M. Mariott, Unification Revisited, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan-Kaufmann, Los Altos, 1989).
17. J.W. Lloyd, Foundations of Logic Programming (Springer, Berlin, 1987).
18. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992).
19. D.W. Loveland, A linear format for resolution, in: Proc. IRIA Symp. on Automatic Demonstration, Lecture Notes in Mathematics (Springer, Berlin, 1970) 147-162.
20. W. Marek and V.S. Subrahmanian, The relationship between logic program semantics and non monotonic reasoning, in: G. Levi and M. Martelli, eds., Proc. 6th Internat. Conf. on Logic Programming (Lisbon, Portugal, June 1989) (MIT Press, Cambridge, MA, 1989).
21. W. Marek and V.S. Subrahmanian, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, Theoret. Comput. Sci. 103 (1992) 365-386.
22. A. Martelli and U. Montanari, An efficient unification algorithm, ACM Trans. Programming. Lang. and Systems 4 (2) (1982) 258-282.
23. A. Nerode, R. Ng and V.S. Subrahmanian, Computing circumscriptive deductive databases, I: Theory and Algorithms, Inform and Comput. 116 (1995) 58-80.
24. A. Nerode and R. Shore, Logic for Applications (Springer, Berlin 1993).
25. V.S. Subrahmanian, D.S. Nau and C. Vago, WFS + branch and bound = stable models, IEEE Trans. Knowledge Data Engrg. 7 (1995) 362-377.