메뉴 건너뛰기




Volumn 9, Issue 3-4, 1991, Pages 401-424

Stable semantics for disjunctive programs

Author keywords

Disjunctive Programs; Non monotonic Formalisms; Stable Semantics; Well founded Semantics

Indexed keywords


EID: 0000810454     PISSN: 02883635     EISSN: 18827055     Source Type: Journal    
DOI: 10.1007/BF03037171     Document Type: Article
Times cited : (263)

References (37)
  • 2
    • 84934529789 scopus 로고    scopus 로고
    • Bidoit, N. and Froidevaux, C., “General Logical Databases and Programs: Default Logic Semantics and Stratification,”Journal of Information and Computation, 1988. In print.
  • 3
    • 84934529792 scopus 로고    scopus 로고
    • Bidoit, N. and Hull, R., “Positivism vs. Minimalism in Deductive Databases,” in Proceedings of the Symposium on Principles of Database Systems, Cambridge, Mass., ACM SIGACT-SIGMOD, pp. 123–132, 1986.
  • 5
    • 84934529793 scopus 로고    scopus 로고
    • Bry, F., “Logic Programming as Constructivism: A Formalization and Its Application to Databases,” in Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 34–50, 1989.
  • 7
    • 84934529762 scopus 로고    scopus 로고
    • Gelfond, M., “On Stratified Autoepistemic Theories,” in Proceedings AAAI-87, Los Altos, CA, American Association for Artificial Intelligence, Morgan Kaufmann, pp. 207–211, 1987.
  • 10
    • 84934529758 scopus 로고    scopus 로고
    • Gelfond, M. and Lifschitz, V., “Logic Programs with Classical Negation,”Research Report, UT El Paso and Stanford University, 1989.
  • 12
    • 84934529761 scopus 로고    scopus 로고
    • Horty, J., Thomason, R. and Touretzky, D., “A Skeptical Theory of Inheritance in Nonmonotonic Semantic Nets,” in Proceedings AAAI-87, Los Altos, CA, American Association for Artificial Intelligence, Morgan Kaufmann, 1987.
  • 17
    • 84934529760 scopus 로고    scopus 로고
    • Morris, P. H., “Autoepistemic Stable Closures and Contradiction Resolution,” in Proceedings of the Second Workshop on Non-Monotonic Reasoning, Munich, July 1988, pp. 60–73, 1988.
  • 18
    • 84934529755 scopus 로고    scopus 로고
    • Marek, W. and Truszczynski, M., “Autoepistemic Logic,”Research Report, University of Kentucky, 1988.
  • 20
    • 84934529754 scopus 로고    scopus 로고
    • Przymusinska, H. and Przymusinski, T. C., “Translating Non-Monotonic Formalisms into Logic Programs,”Research Report, University of Texas at El Paso, 1991.
  • 22
    • 84934529757 scopus 로고    scopus 로고
    • Przymusinski, T. C., “Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model,” in Proceedings of the Eighth Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 11–21, 1989.
  • 27
    • 84934529753 scopus 로고    scopus 로고
    • Przymusinski, T. C., “Semantics of Disjunctive Logic Programs and Deductive Databases,” in Proceedings of the Second International Conference on Deductive and Object-Oriented Databases (DOOD’91), Munich, Germany, 1991, Springer-Verlag (In print.), 1991.
  • 28
    • 84934529752 scopus 로고    scopus 로고
    • Przymusinski, T. C., “Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs,”Journal of Artificial Intelligence, 1991 (In print. Extended abstract appeared in: Przymusinski, T. C., “Three-Valued Non-Monotonic Formalisms and Logic Programming,” in Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning KR’89) (R. Brachman, H. Leveque and R. Reiter, eds.), Toronto, Canada, Morgan Kaufmann, pp. 341–348, 1989.
  • 29
    • 84934529751 scopus 로고    scopus 로고
    • Przymusinski, T. C., “Well-Founded Completions of Logic Programs,” in Proceedings of the Eighth International Logic Programming Conference, Paris, France, Cambridge, Mass., 1991. Association for Logic Programming, MIT Press (In print).
  • 30
    • 84934529750 scopus 로고    scopus 로고
    • Przymusinski, T. C. and Warren, D. S., “Well-Founded Semantics: Theory and Implementation,”Research Report, UT El Paso and SUNY at Stony Brook, 1991. (in preparation).
  • 31
    • 84934529749 scopus 로고    scopus 로고
    • Ross, K., “A Procedural Semantics for Well-Founded Negation in Logic Programs,” in Proceedings of the Eighth Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 22–33, 1989.
  • 32
    • 84934529748 scopus 로고    scopus 로고
    • Ross, K., “The Well-Founded Semantics for Disjunctive Logic Programs,” in Proceedings of the First International Conference on Deductive and Object Oriented Databases, pp. 352–369, 1989.
  • 34
    • 84934529747 scopus 로고    scopus 로고
    • Van Gelder, A., “The Alternating Fixpoint of Logic Programs with Negation,” in Proceedings of the Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD, pp. 1–10, 1989.
  • 36
    • 84934529746 scopus 로고    scopus 로고
    • Van Gelder, A., Ross, K. A. and Schlipf, J. S., “The Well-Founded Semantics for General Logic Programs,”Journal of the ACM, 1990 (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, March 1988, pp. 221–230, 1988.
  • 37
    • 84934529745 scopus 로고    scopus 로고
    • Warren, D. S., “The XWAM: A Machine That Integrates Prolog and Deductive Database Query Evaluation,”Technical Report, #25, SUNY at Stony Brook, 1989.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.