T. C. Przymusinski
- Apt et al, 1987.K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge, in J. Minker, editor, Foundation8 of Deductive Database8 and Logic Programming, pages 89-142, Morgan Kanfmann, Los Altos, CA., 1987. Google Scholar
Digital Library
- Bry, 1989.F. Bry. Logic programming as constructivism: a formalization and its application to databases. In Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT- SIGMOD, 1989. (to appear). Google ScholarDigital Library
- Chan, 1988.D. Chart. Constructive negation based on the completed database. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.Google Scholar
- Chandra and Harel, 1985.A. Chandra and D. Harel. Horn clause queries and generalisations. Journal of Logic Programming, 1:1-15, 1985.Google ScholarCross Ref
- Clark, 1978.K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322, Plenum Press, New York, 1978.Google ScholarCross Ref
- Fitting, 1985.M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295-312, 1985.Google ScholarCross Ref
- Gelder, 1987.A. Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, editor, Foendation~ of Dedectiee Databases and Logic Programming, pages 149-176, Morgan Kaufmann, Los Altos, CA., 1987. Google ScholarDigital Library
- Gelfond and Lifschitz, 1988.M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1079-1080, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.Google Scholar
- Kemp and Topor, 1988.D. Kemp and R. Topor. Completeness of a top-down query evaluation procedure for stratified databases. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 178-194, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.Google Scholar
- Kunen, 1987.K. Kunen. Negation in logic programming. Journal of Logic Programming, 4(4):289- 308, 1987. Google ScholarDigital Library
- Lloyd, 1984.J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, New York, N.Y., first edition, 1984. Google ScholarDigital Library
- Przymusinska and Przymusinski, 1988.H. Przymusinska and T. Przymusinski. Weakly perfect model semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1106-1122, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.Google Scholar
- Przymusinski, 1987.T. Prsymusinski. On the declarative semantics of stratified deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193-216, Morgan Kaufmann, Los Altos, CA., 1987. Google ScholarDigital Library
- Przymusinski, 1988a.T. PrzymusinskL Non-monotonic reasoning vs. logic programming: a new perspective. In D. Partridge and Y. Wilks, editors, Formal Foundations of Artificial Intelligence, Cambridge University Press, London, 1988. In print. (Extended abstract appeared in: T. Prsymusinski. On the relationship between non-monotonic reasoning and logic programming. in Proceedings AAAI-88, pages 444-448, American Association for Artificial intelligence, Morgan Kaufmann, Los Altos, CA, 1988.). Google ScholarDigital Library
- Przymusinski, 1988b.T. Prsymusinski. On Construeties Negation in Logic Programming. Research report, University of Texas at E1 Paso, 1988.Google Scholar
- Przymusinski, 1988c.T. Prsymusinski. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning, 1988. In print. (Extended abstract appeared in: T. Prsymusinski. Perfect model semantics. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1081-1096, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.). Google ScholarDigital Library
- Przymusinski, 1989.T. Prsymusinski. Three-valued non-monotonic formalisms and logic programming. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, 1989. (In print). Google ScholarDigital Library
- Ross, 1989.K. Ross. A procedural semantics for well founded negation in logic programs. In Proceedings of the Eighth Symposium on Principle8 of Database Systems, ACM SIGACT-SIGMOD, 1989. (In print}. Google ScholarDigital Library
- Seki and Itoh, 1988.H. Seki and H. itoh. A query evaluation method for stratified programs under the extended cwa. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 195-211, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.Google Scholar
- Van Gelder, 1989.A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, 1989. (to appear}. Google ScholarDigital Library
- Van Gelder et al, 1988.A. Van Gelder, K. Ross, and Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, 1988. Google ScholarDigital Library
- Zaniolo, 1988.C. Zaniolo. Design and implementation of logic-based language for data intensive applications. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1666-1688, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.Google Scholar
Index Terms
- Every logic program has a natural stratification and an iterated least fixed point model
Recommendations
Sahlqvist theorem for modal fixed point logic
We define Sahlqvist fixed point formulas. By extending the technique of Sambin and Vaccaro we show that (1) for each Sahlqvist fixed point formula @f there exists an LFP-formula @g(@f), with no free first-order variable or predicate symbol, such that a ...
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
The notion of the least fixed-point of an operator is widely applied in computer science as, for instance, in the context of query languages for relational databases. Some extensions of first-order classical logic (FOL) with fixed-point operators, as ...
The expressive power of two-variable least fixed-point logics
MFCS'05: Proceedings of the 30th international conference on Mathematical Foundations of Computer ScienceThe present paper gives a classification of the expressive power of two-variable least fixed-point logics. The main results are:
The two-variable fragment of monadic least fixed-point logic with parameters is as expressive as full monadic least fixed-...
Comments