Skip to main content
SpringerLink
Log in

Formulas as Programs

  • Chapter
The Logic Programming Paradigm

Part of the book series: Artificial Intelligence ((AI))

Summary

We provide here a computational interpretation of first-order logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves axe programs. This contrasts with the so-called formulas as types approach in which the proofs of the formulas are typed terms that can be taken as programs. This view of computing is inspired by logic programming and constraint logic programming but differs from them in a number of crucial aspects.

Formulas as programs is argued to yield a realistic approach to programming that has been realized in the implemented programming language Alma-0 [ABPS98] that combines the advantages of imperative and logic programming. The work here reported can also be used to reason about the correctness of non-recursive Alma-0 programs that do not include destructive assignment.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19–20:9–71, 1994.

    Article  MathSciNet  Google Scholar 

  2. K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998. In press. Available via http://www.cwi.nl/~apt.

  3. K. R. Apt and H. C. Doets. A new definition of SLDNF-resolution. Journal of Logic Programming, 18(2):177–190, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  4. K. R. Apt. Arrays, bounded quantification and iteration in logic and constraint logic programming. Science of Computer Programming, 26(1–3):133–148, 1996.

    Article  MathSciNet  Google Scholar 

  5. J.Barklundand J.Bevemyr. Prolog with arrays and bounded quantifications. In Andrei Voronkov, editor, Logic Programming and Automated Reasoning—Proc. 4th Intl. Conf., LNCS 698, pages 28–39,Berlin, 1993. Springer-Verlag.

    Google Scholar 

  6. K.L.Clark.Negation as failure.In H. Gallaire and J. Minker, editors,Logic and Databases, pages 293–322. Plenum Press, New York, 1978.

    Google Scholar 

  7. D. De Schreye and S. Decorte. Termination of logic programs: the never- ending story. Journal of Logic Programming, 19-20:199–260, 1994.

    Article  Google Scholar 

  8. J. Groenendijk and M. Stokhof. Dynamic predicate logic. Linguistics and philosophy, 14(2):39–101, 1991

    Article  Google Scholar 

  9. P.MHill and J.WLloyd. The Gödel Programming Language.The MIT Press, 1994.

    MATH  Google Scholar 

  10. R. Honsberger. Ingenuity in Mathematics. Random House, Inc., New York, 1970.

    Google Scholar 

  11. Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. In In POPL’87: Proceedings 14th ACM Symposium on Principles of Programming Languages, pages 111–119ACM1987

    Google Scholar 

  12. J. Jaffar, M.J. MaherK. Marriott, and P. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(l-3):1–46, 1998.

    Article  MathSciNet  Google Scholar 

  13. J. Jaffar, M.J. MaherK. Marriott, and P. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(l-3):1–46, 1998.

    Article  MathSciNet  Google Scholar 

  14. F. Kluźniak and M. Milkowska. Spill: A logic language for writing testable requirements specifications. Science of Computer Programming, 28(2 & 3):193–223, 1997.

    Article  Google Scholar 

  15. R.A Kowalski.Predicate logic as a programming language.In Proceedings IFIP’74, pages 569–574.North-Holland,1974.

    Google Scholar 

  16. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.

    MATH  Google Scholar 

  17. J.Lobo, J.Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.

    Google Scholar 

  18. J.WLloyd andR.WTopor. Making Prolog more expressive. Journal of Logic Programming, 1:225–240, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  19. K. McAloon and C. Tretkoff. 2LP: Linear programming and logic programming. In P. VanHentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming, pages 101–116. MIT Press, 1995

    Google Scholar 

  20. J. R. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, Massachusetts, 1967.

    MATH  Google Scholar 

  21. A. Tarski. Pojęcie prawdy w językach nauk dedukcyjnych. Towarzystwo Naukowe Warszawskie, Warszawa 1933,. In Polish. English version appeared in A. Tarski, Logic, semantics, metamathematics: papers from 1923 to 1938,Oxford, Clarendon 1956

    Google Scholar 

  22. A.S. Troelstra and D. van Dalen.Constructivisim in Mathematics. Studies in Logic and the Foundations of Mathematics. North-Holland Publ. Co.,. Amsterdam, 1988

    Google Scholar 

  23. A. Voronkov.Logic programming with bounded quantifiers. In A. Voronkov, editor, Logic Programming and Automated Reasoning-Proc. 2nd Russian Conference on Logic Programming, LNCS 592, pages 486–514, Berlin, 1992. Springer-Verlag.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 9Aff4079, 1090, GB, Amsterdam, The Netherlands

    Krzysztof R. Apt & Marc Bezem

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Bezem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Krzysztof R. Apt

  2. Department of Computer Science, University of Kentucky, 773 Anderson Hall, 40506-0046, Lexington, KY, USA

    Victor W. Marek  & Mirek Truszczynski  & 

  3. Computer Science Department, University at Stony Brook, Stony Brook, 11794-4400, NY, USA

    David S. Warren

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Apt, K.R., Bezem, M. (1999). Formulas as Programs. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds) The Logic Programming Paradigm. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60085-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60085-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64249-4

  • Online ISBN: 978-3-642-60085-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation