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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19–20:9–71, 1994.
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.
K. R. Apt and H. C. Doets. A new definition of SLDNF-resolution. Journal of Logic Programming, 18(2):177–190, 1994.
K. R. Apt. Arrays, bounded quantification and iteration in logic and constraint logic programming. Science of Computer Programming, 26(1–3):133–148, 1996.
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.
K.L.Clark.Negation as failure.In H. Gallaire and J. Minker, editors,Logic and Databases, pages 293–322. Plenum Press, New York, 1978.
D. De Schreye and S. Decorte. Termination of logic programs: the never- ending story. Journal of Logic Programming, 19-20:199–260, 1994.
J. Groenendijk and M. Stokhof. Dynamic predicate logic. Linguistics and philosophy, 14(2):39–101, 1991
P.MHill and J.WLloyd. The Gödel Programming Language.The MIT Press, 1994.
R. Honsberger. Ingenuity in Mathematics. Random House, Inc., New York, 1970.
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
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.
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.
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.
R.A Kowalski.Predicate logic as a programming language.In Proceedings IFIP’74, pages 569–574.North-Holland,1974.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.
J.Lobo, J.Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.
J.WLloyd andR.WTopor. Making Prolog more expressive. Journal of Logic Programming, 1:225–240, 1984.
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
J. R. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, Massachusetts, 1967.
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
A.S. Troelstra and D. van Dalen.Constructivisim in Mathematics. Studies in Logic and the Foundations of Mathematics. North-Holland Publ. Co.,. Amsterdam, 1988
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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