Skip to main content
SpringerLink
Log in

Logic programs with tests

  • Conference paper
  • First Online:
Logic Program Synthesis and Transformation — Meta-Programming in Logic (META 1994, LOPSTR 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 883))

  • 158 Accesses

Abstract

We extend logic programming to deal with logic programs that include new truth functional connectives called tests. Stable Model Semantics and Three Valued Stable Model Semantics are extended to give meaning to programs with tests.

We consider three possible applications of such programs. It is shown how to define a particular semantics in terms of another one with the help of an appropriate transformation of normal programs into programs with tests. Our approach can be applied for resolving inconsistency in logic programs with explicit negation. Programs with tests can serve as a promising tool for eliminating or encoding integrity constraints within particular background semantics.

This paper has been developped during my visit at the Institute for Logic, Complexity and Deductionsystems, University of Karlsruhe, Germany. It was supported by the European Economic Community within the framework of the Community's Action for Cooperation in Science and Technology with Central and Eastern European Countries under the contract number CIPA3510CT924716.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asirelli, P., De Santis, M. and M. Martelli. Integrity constraints in logic databases. J. Logic Programming, vol 2, number 3, 221–233, 1985.

    Google Scholar 

  2. Fitting, M. Kleene's three valued logics and their children. August, 1993. Manuscript.

    Google Scholar 

  3. Gelfond, M and V.Lifschitz. The stable model semantics for logic programming. In R.A.Kowalski and K.A.Bowen, editors, 5th ICLP, 1070–1080. MIT Press, 1988.

    Google Scholar 

  4. Gelfond, M and V.Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, 7th ICLP, 579–597, MIT Press, 1990.

    Google Scholar 

  5. Kowalski, R. A. and F.Sadri. Logic Programs with exceptions. In Warren and Szeredi, editors, 7th ICLP, 588–613. MIT Press, 1990.

    Google Scholar 

  6. Inoue, K. Extended Logic programs with default assumptions. Proceeding of 8th ICLP, 491–504. MIT Press, 1991.

    Google Scholar 

  7. Mircheva, M. Declarative semantics for inconsistent database programs. In D. Pearce and H. Wansing, editors, Proc. of JELIA '92, LNCS 663, 252–263, Springer-Verlag, 1992.

    Google Scholar 

  8. Pearce P. and G. Wagner. Logic Programming with strong negation. In P. Schroeder-Heister, editors, Proceedings of the International Workshop on Extension of Logic Programming, pages 311–326, Tubingen, Dec. 1989. Lecture Notes in Artificial Intelligence, Springer-Verlag.

    Google Scholar 

  9. Pereira, L. M., Aparicio, J.N. and J.J. Alferes. Contradiction removal within well founded semantics. In A. Nerode, W. Marek and V.S. Subrahmanian, editors, Proceedings of the First International Workshop on Logic Programming and Nonmonotonic Reasoning, pages 105–119, MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  10. Poole, D. A logical framework for default reasoning. Artificial Intelligence 36, 27–47, 1988.

    MathSciNet  Google Scholar 

  11. Przymusinski, T. Extended stable semantics for normal and disjunctive programs. In Waren and Szeredi, editors, 7th ICLP, pages 459–477. MIT Press, 1990.

    Google Scholar 

  12. Przymusinski, T. Well founded semantics coincides with three valued stable models. Fundamenta Informaticae 13, pages 445–463, 1990.

    Google Scholar 

  13. Przymusinski, T. and David S. Warren. Well founded semantics: theory and implementation Technical report, Dep. of Computer Science, University of California at Riverside and SUNY at Stony Brook, March, 1992.

    Google Scholar 

  14. Przymusinska, H. and T. Przymusinski. Semantic issues in deductive databases and logic programs. In Formal Techniqies in Artificial Intelligence. A Sourcebook. R.B. Banerji (editor), Elsevier Science Publishers B.V. (North-Holland), 1990.

    Google Scholar 

  15. Van Gelder, A., Ross, K.A. and J.S.Schlipf. The well founded semantics for general logic programs. Journal of ACM, pages 221–230, 1990.

    Google Scholar 

  16. Warren, D. The XWAM: A machine that integrate prolog and inductive database query evaluation. Technical report #25, SUNY at Stony Brook, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics & Computer Science, Bulgarian Academy of Sciences, “Acad. G.Bonchev” str. bl. 8, 1113, Sofia, Bulgaria

    Marion Mircheva

Authors
  1. Marion Mircheva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Fribourg Franco Turini

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mircheva, M. (1994). Logic programs with tests. In: Fribourg, L., Turini, F. (eds) Logic Program Synthesis and Transformation — Meta-Programming in Logic. META LOPSTR 1994 1994. Lecture Notes in Computer Science, vol 883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58792-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-58792-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58792-7

  • Online ISBN: 978-3-540-49104-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation