Static semantics as program transformation and well-founded computation

  • Stefania Costantini
  • Gaetano A. Lanzarone
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 927)

Abstract

In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal programs. Based on considerations about how disjunctive information is treated by a given semantics, we divide the computation of that semantics into two phases. The first one is a program transformation phase, which applies axiom schemata expressing how derivations involving disjunctions are made in the given semantic framework. The second one is a constructive phase, based on a variation of the well-founded model construction for normal programs. We apply this two-phases procedural semantics to the computation of the static semantics of disjunctive logic programs as a case-study, showing how it works and what its results are in several examples. A main perspective of this proposal is a procedural semantics for disjunctive programs consisting of an inefficient preprocessing phase (implementing the program transformation procedure), to be however performed only once, and of an efficient runtime computation, obtained as a variation of any effective procedural semantics for the well-founded model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AVG90]
    J.S. Schlipf A. Van Gelder, K.A. Ross. The well-founded semantics for general logic programs. Journal of the ACM, 38(3), 1990. abstract in: Proc. of the Seventh ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1988.Google Scholar
  2. [Bar91]
    C. Baral. Issues in knowledge representation: semantics and knowledge combination. PhD thesis, Department of Computer Science, 1991.Google Scholar
  3. [CB92]
    J. Minker C. Baral, J. Lobo. Generalized disjunctive well-founded semantics for logic programs. Annals of Mathematics and Artificial Intelligence, 5, 1992.Google Scholar
  4. [Cos95]
    S. Costantini. Contributions to the stable model semantics of logic programs with negation. Theoretical Computer Science, forthcoming, 1995. abstract in: A. Nerode (ed.), Logic Programming and Non-Monotonic Reasoning, Proc. of the Second International Workshop, The MIT Press, 1993.Google Scholar
  5. [Dix91]
    J. Dix. Classifying semantics of logic programs. In V. S. Subrahmanian A. Nerode, W. Marek, editor, Proc. of the First International Workshop on Logic Programming and Non-Monotonic Reasoning. The MIT Press, 1991. Washington D. C., July 1991.Google Scholar
  6. [Dix92]
    J. Dix. Classifying semantics of disjunctive logic programs. In K. Apt, editor, Logic Programming, Proc. of the 1992 Joint Conference and Symposium. The MIT Press, 1992. Washington D. C., November 1991.Google Scholar
  7. [Gel93]
    A. Van Gelder. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences, 47(1), 1993. abstract in: Proc. of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989.Google Scholar
  8. [Got92]
    G. Gottlob. The complexity of propositional default reasoning under the stationary semantics. Technical Report CD-TR-92/42, Institut fur Information-Systeme, Technische University, A-1040 Wien, Austria, 1992.Google Scholar
  9. [HP90]
    T. C. Przymusinski H. Przymusinska. Semantic issues in deductive databases and logic programs. In R.B. Banerji, editor, Formal Techniques in Artificial Intelligence. North Holland, Amsterdam, 1990.Google Scholar
  10. [JD94]
    M. Müller J. Dix. An axiomatic framework for representing and characterizing semantics of disjunctive logic programs. In P. Van Hentenryck, editor, Logic Programming, Proc. of the 11th International Conference. The MIT Press, 1994. Santa Margherita Ligure, June 1994.Google Scholar
  11. [JL92]
    A. Rajasekar J. Lobo, J. Minker. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.Google Scholar
  12. [Llo87]
    J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second, extended edition, 1987.Google Scholar
  13. [McC80]
    J. McCarthy. Circumscription — a form of non-monotonic reasoning. Artificial Intelligence, 13, 1980.Google Scholar
  14. [MG88]
    V. Lifschitz M. Gelfond. The stable model semantics for logic programming. In R.A. Kowalski K. Bowen, editor, Logic Programming, Proceedings of the Fifth Symposium. The MIT Press, 1988.Google Scholar
  15. [Min82]
    J. Minker. On indefinite data bases and the closed world assumption. In Proc. of the 6th Conference on Automated Deduction, New-York, 1982. Springer-Verlag.Google Scholar
  16. [MM93]
    J. Dix M. Müller. Implementing semantics of disjunctive logic programs using fringes and abstract properties. In A. Nerode, editor, Logic Programming and Non-Monotonic Reasoning, Proc. of the Second International Workshop. The MIT Press, 1993.Google Scholar
  17. [Prz89]
    T. C. Przymusinski. Every logic program has a natural stratification and an iterated fixpoint model. In Proc. of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, 1989. Philadelphia, Pennsylvania.Google Scholar
  18. [Prz91]
    T. C. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In Y. Masunega C. Delobel, M. Kifer, editor, DOOD'91, Proc. of the 2nd International Conference on Deductive and Object-Oriented Databases, Berlin, 1991. Springer-Verlag. Munich, Germany.Google Scholar
  19. [Prz94]
    T. C. Przymusinski. Static semantics for normal and disjunctive logic programs, the Annals of Mathematics and Artificial Intelligence, ??, 1994. Special Issue on Disjunctive Programs.Google Scholar
  20. [SC94]
    G.A. Lanzarone S. Costantini. Metalevel negation and non-monotonic reasoning. Methods of Logic in Computer Science: An International Journal, 1(1), 1994. abstract in: Proc. of the Workshop on Non-Monotonic Reasoning and Logic Programming, Austin, TX, November 1–2, 1990.Google Scholar
  21. [Sch92]
    J.S. Schlipf. A survey of complexity and undecidability results in logic programming. In Proc. of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, November 1992. held in conjunction to JICSLP'92, Washington, D. C.Google Scholar
  22. [VS92]
    C.Vago V.S. Subrahmanian, D. Nau. Wfs + branch and bound = stable models. Technical Report CS-TR-2935 UMIACS-TR-92.82, University of Maryland, July 1992. submitted to IEEE Transactions on Knowledge and Data Engineering.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Stefania Costantini
    • 1
  • Gaetano A. Lanzarone
    • 1
  1. 1.Dip. di Scienze dell'InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations