Allen Van Gelder
Kenneth A. Ross
- 1 APT, K. R., BLAIR, H., AND WALKER, A. Towards a theory of declarative knowledge. In J. Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan- Kaufmann, San Mateo, Calif., 1988, pp. 89-148. Google Scholar
- 2 APT, K. R., AND VAN EMDEN, M. H. Contributions to the theory of logic programming. J. ACM29, 3 (July 1982), 841-862. Google Scholar
- 3 BRY, F. Logic programming as constructivism: A formalization and its application to databases. In Proceedings of the 8th A CM Symposium on Principles of Database Systems. ACM, New York, pp. 34-50. Google Scholar
- 4 CHANDRA, A., AND HAREL, D. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 1 (I982), 99-128.Google Scholar
- 5 CHANDRA, A., AND HAREL, D. Horn clause queries and generalizations. J. Logic Prog. 2, 1 (1985), 1 - 15.Google Scholar
- 6 CLARK, K.L. Negation as failure. In H. Gallaire and J. Minker, eds., Logic and Databases. Plenum Press, New York, 1978, pp. 293-322.Google Scholar
- 7 DUMMETT, M. A.E. Elements of Intuitionism. Clarendon Press, Oxford, England, 1977.Google Scholar
- 8 DUNG, PH. M., AND KANCHANASUT, K. A natural semantics for logic programs with negation. Tech. Rep. Asian Institute of Technology, Bangkok 10501, Thailand, 1989. (manuscript).Google Scholar
- 9 FITTINC, M. A Kripke-Kleene semantics for logic programs. J. Logic Progr. 2, 4 (1985), 295-312.Google Scholar
- 10 GELFOND, M. On stratified autoepistemic theories. In Proceedings of the 6th National Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., 1987, pp. 207-211.Google Scholar
- 11 GELFOND, M, AND LIFSCHITZ, V. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.). IEEE, New York, 1988, pp. 1070-1080.Google Scholar
- 12 GUREVrCrI, Y., AND SHELAH, S. Fixed-point extensions of first order logic. Ann. Pure Appl. Logic 32 (1986), 265-280.Google Scholar
- 13 HANKS, S., AND MCDERMOTT, D. Default reasoning, nonmonotonic logics, and the frame problem. In Proceedings of 5th National Conference on Artificial intelligence. Morgan- Kaufmann, San Mateo, Calif., 1986, pp. 328-333.Google Scholar
- 14 IMMERMAN, N. Relational queries computable in polynomial time. Inf. Contr. 68, 1 (1986), 86-104. Google Scholar
- 15 JAFFAR, J., LASSEZ, J.-L., AND LLOYD, J. Completeness of the negation-as-failure rule. In Proceedings of the International Joint Conference on Artificial Intelligence. Morgan- Kaufmann, San Mateo, Calif., 1983, pp. 500-506.Google Scholar
- 16 KoL~aa'~s, P. G. The expressive power of stratified programs. Inf. Comput. 90 1 (1991), 50-66. Google Scholar
- 17 KUNEN, K. Negation in logic programming. J. Logic Prog. 4, 4 (1987), 289-308. Google Scholar
- 18 KUNEN, K. Some remarks on the completed database. Tech. Rep. 775. Univ. of Wisconsin, Madison, Wisc., 1988. (Abstract appeared in Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash., Aug.) 1988).Google Scholar
- 19 LIFSCHITZ, V. On the declarative semantics of logic programs with negation. In J. Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann, San Mateo, Calif., 1988, pp. 172-192. Google Scholar
- 20 LLOYD, J.W. Foundations of Logic Programming. Springer-Verlag, New York, 2nd edition, 1987. Google Scholar
- 21 LLOYD, J, W., AND TOPOR, R. W. Making Prolog more expressive. J. Logic Prog. 1. 3 (1984), 225-240.Google Scholar
- 22 MAHER, M.J. Equivalences of logic programs. In J. Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann, San Mateo, Calif., 1988, pp. 388-402. Google Scholar
- 23 MAREK, W. Stable theories in autoepistemic logic. Tech. Rep., Univ. Kentucky, Lexington, Ky., 1986.Google Scholar
- 24 MAREK, A., AND TRUSZCZYNSKI, M. Autoepistemic logic. Tech. Rep., Umv. Kentucky, Lexington, Ky., 1988.Google Scholar
- 25 MINKER, J. Oil indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction. Sprlnger-Verlag, New York, 1982, pp. 292-308. Google Scholar
- 26 MOORE, R.C. Semantical considerations on nonmonotonic logic. Artif. Int. 28 (1985), 75-94. Google Scholar
- 27 MORRIS, K. Talk at Workshop XP8.3i, Oregon Graduate Center, July 1987.Google Scholar
- 28 MORRIS, K., ULLMAN, J. D., AND VAN GELDER, A. Design overview of the Nail! system. In Proceedings of the 3rd International Conference on Logic Programming. 1986, pp. 554-568. Google Scholar
- 29 MOSCHOVAKIS, Y. N. Elementary Induction on Abstract Structures. North-Holland, New York, 1974. Google Scholar
- 30 PRZYMUSINSKA, H, AND PRZYMUSINSKI, T. C. Weakly perfect model semantics for logic programs. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.), 1988, pp. 1106-1120.Google Scholar
- 31 PRZYMUSINSKI, T.C. On the declarative semantics of deductive databases and logic programs. In J. Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Mateo, Calif., 1988, pp. 193-216. Google Scholar
- 32 PRZYMUSINSI, a, T.C. Every logic program has a natural stratification and an iterated fixed point model. In Proceedings of the 8th A CM Symposium on Principles of Database Systems. ACM, New York, 1989, pp. 11-21. Google Scholar
- 33 REITER, R. On closed world databases. In H. Gallaire and J. Minker, Logic and Databases. Plenum Press, New York, 1978, pp. 55-76.Google Scholar
- 34 Ross, K.A. A procedural semantics for well-founded negation in logic programs. In Proceedings of the 8th A CM Symposium on Principles of Database Systems. ACM, New York, 1989, pp. 22-33. Google Scholar
- 35 Ross, K., AND TOPOR, R. W. Inferring negative reformation from disjunctive databases. J. Autom. Reas. 4 (1988), 397-424. Google Scholar
- 36 SCHLIPF, J. S. Negation by securable failure in logic programming. Unpubhshed manuscript, 1987.Google Scholar
- 37 SHEPHER~SON, J.C. Negation as failure, II. J. Logic Prog. 2, 3 (1985), 185-202. Google Scholar
- 38 SHEPHERDSON, J. C. Negation in logic programming. In J. Minker, ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Mateo, Calif., 1988, pp. 19-88. Google Scholar
- 39 VAN EMDEN, M. H., aND KOWALSKI, R.A. The semantics of predicate logic as a programming language. J. ACM23, 4 (Oct. 1976), 733-742. Google Scholar
- 40 VAN GELDER, A. Negation as failure using tight derivations for general logic programs. J. Logic Prog., 6, 1 (1989), 109-i33. (Preliminary versions appeared in Proceedings of the 3rd IEEE Symposium on Logic Programming, IEEE, New York, 1986, and Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufmann, San Mateo, Calif., 1988. Google Scholar
- 41 VAN GELDER, A. Modeling simultaneous events with default reasoning and tight derivations. J. Logic Prog. 8, 1 (1990), 41- 52. Google Scholar
- 42 VAN GELDER, A. The alternating fixpoint of logic programs with negation. J. Comput. Syst. Sci. 1992, to appear. (Available as Tech. Rep. UCSC-CRL-89-39, Preliminary abstract appeared in Proceedings of the 8th Annual A CM Symposium on Principles of Database Systems. ACM, New York, 1989.) Google Scholar
- 43 VARD~, M. The complexity of relational query languages. In Proceedings of the 14th A CM Symposium on Theory of Computing. ACM, New York, 1982, pp. 137-145. Google Scholar
Index Terms
- The well-founded semantics for general logic programs
Recommendations
Unfounded sets and well-founded semantics for general logic programs
PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsA general logic program (abbreviated to “program” hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consisting of rules (IDB) sitting above elementary ...
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
AbstractWe study a new fixpoint semantics for logic programs with negation. Our construction is intermediate between Van Gelder’s well-founded model and Gelfond and Lifschitz’s stable model semantics. We show first that the stable models of a logic ...
Minimal founded semantics for disjunctive logic programs and deductive databases
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs ...
Reviews
Chris Nikolopoulos
A general logic program is a Horn clause logic program with negations. Two approaches have been tried to extend logic programs with negation: the program completion approach (the closed world assumption and SLDNF resolution augmented with negation are examples of this) and the canonical model approach. This paper extends the canonical model approach to general logic programs and introduces a new definition of the canonical model, the well-founded model. Every logic program has either a well-founded total model or a well-founded partial model. Literals in the well-founded partial model are true, their complements are false, and the truth values of other literals are not determined. A partial well-founded model can be viewed as a three-valued logic model. The perfect model of locally stratified programs coincides with the well-founded model. Finally, the authors show how negative conclusions in well-founded semantics are drawn using the notion of “unfounded sets.”
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments