Abstract
The PPL framework is proposed as a simple extension to logic programming aiming at handling resources. It is argued that the separation between logical treatments and resource handling is desirable and, to that end, resources are proposed to be manipulated by means of pre- and post-conditions associated with usual Horn clauses. The expressiveness of the resulting framework is evidenced through the coding of several applications involving objects, databases, actions and changes. Operational and declarative semantics are presented as well. The operational semantics rests on a derivation relation stating how goals and conditions are evaluated. The declarative semantics extends the classical model and fixed-point theories to take into account the evaluation of pre- and post-conditions, and in particular the non-monotonic behavior of the world of resources they induce in general. As suggested, an effort has been made to keep the work close to the classical logic programming setting. In particular, the semantics are in the main streams of logic programming semantics. However, the PPL framework raises new problems for which fresh solutions are proposed.
Supported by the Belgian National Fund for Scientific Research as a Senior Research Assistant.
Preview
Unable to display preview. Download preview PDF.
References
J.-M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. In D.H.D. Warren and P. Szeredi, editors, Proc. 7 th Int. Conf. on Logic Programming, pages 495–510, Jerusalem, Israel, 1990. The MIT Press.
A. Baker. Nonmonotonic Reasoning in the Framework of the Situation Calculus. Artificial Intelligence, 49:5–23, 1991.
K. De Bosschere and J.-M. Jacquet. Comparative Semantics of μlog. In D. Etiemble and J.-C. Syre, editors, Proceedings of the PARLE'92 Conference, volume 605 of Lecture Notes in Computer Science, pages 911–926, Paris, 1992. Springer-Verlag.
K. De Bosschere and J.-M. Jacquet. Multi-Prolog: Definition, Operational Semantics, and Implementation. In D.S. Warren, editor, Proceedings of the ICLP'93 Conference, pages 299–314, Budapest, Hungary, 1993. The MIT Press.
A. Brogi. And-Parallelism without Shared Variables. In D.H.D. Warren and P. Szeredi, editors, Proc. 7 th Int. Conf. on Logic Programming, pages 306–321, Jerusalem, Israel, 1990. The MIT Press.
A. Brogi and P. Ciancarini. The Concurrent Language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1):99–123, January 1991.
F.S. de Boer, J. Kok, C. Palamidessi, and J.J.M.M. Rutten. Non-Monotonic Concurrent Constraint Programming. In D. Miller, editor, Proc. Int. Symp. on Logic Programming, pages 315–334, Vancouver, Canada, 1993.
P.M. Dung. Representing Actions in Logic Programming and its Applications in Database Updates. In D.S. Warren, editor, Proc. 10 th Int. Conf. on Logic Programming, pages 222–238, Budapest, Hungary, June 1993. The MIT Press.
M. Falaschi, G. Levi, and C. Palamidessi. A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses. Information and Control, 60:36–69, 1984.
M. Gelfond and V. Lifschitz. Representing Actions in Extended Logic Programming. In K.R. Apt, editor, Proc. Joint International Conference and Symposium on Logic Programming, pages 559–573, Washington, USA, November 1992. The MIT Press.
G. Groβe, S. Hölldobler, J. Schneeberger, U. Sigmund, and M. Tielscher. Equational Logic Programming, Actions, and Change. In K.R. Apt, editor, Proc. Joint International Conference and Symposium on Logic Programming, pages 177–191, Washington, USA, November 1992. The MIT Press.
S. Hanks and D. MacDermott. Nonmonotonic Logic and Temporal Projection. Artificial Intelligence, 33(3):379–412, 1987.
S. Hölldobler and J. Schneeberger. A New Deductive Approach to Planning. New Generation Computing, 8:225–244, 1990.
S. Hölldobler and M. Thielscher. Actions and Specificity. In D. Miller, editor, Proc. Int. Symp. on Logic Programming, pages 164–180, Vancouver, Canada, October 1993. The MIT Press.
J.-M. Jacquet and L. Monteiro. Extended Horn Clauses: the Framework and its Semantics. In J.C.M. Baeten and J.F. Groote, editors, Proc. 2 nd Int. Conf. on Concurrency Theory (Concur'91), volume 527 of Lecture Notes in Computer Science, pages 281–297, Amsterdam, The Netherlands, 1991. Springer-Verlag.
J.-M. Jacquet and L. Monteiro. Communicating Clauses: the Framework and its Semantics. In K.R. Apt, editor, Proc. Joint International Conference and Symposium on Logic Programming, Series in Logic Programming, pages 98–112, Washington, USA, November 1992. The MIT Press.
H. Kautz. The Logic of Persistence. In Proc. AAAI, pages 401–405, 1986.
N. Kobayashi and A. Yonezawa. ACL — A Concurrent Linear Logic Programming Paradigm. In D. Miller, editor, Proc. Int. Symp. on Logic Programming, pages 295–314, Vancouver, Canada, 1993.
R. Kowalski. Logic for Problem Solving. North Holland, New York, 1979.
J. Mac Carthy. Situations and Actions and Causal Laws. Standford Artificial Intelligence Project Memo 2, Stanford University, Palo Alto, CA, USA, 1963.
J. Mac Carthy. Applications of Circumscription to Formalizing Commonsense Knowledge. Artificial Intelligence, 28:89–116, 1986.
J. Mac Carthy and P.J. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence, 4:463–502, 1969.
M. Masseron, C. Tollu, and J. Vauzeilles. Generating Plans in Linear Logic. In Foundations of Software Technology and Theoretical Computer Science, volume 472 of Lecture Notes in Computer Science, pages 63–75. Springer-Verlag, 1990.
L. Monteiro. Distributed Logic, A Theory of Distributed Programming in Logic. Research report, Departamento de Informática, Universidade de Lisboa, 2885 Monte da Caparica, Lisbon, Portugal, 1986.
A. Porto and P. Rosado. The AbstrAct Scheme for Concurrent Programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, volume 660 of Lecture Notes in Artificial Intelligence, pages 216–241, Berlin, 1993. Springer-Verlag.
V. Saraswat and P. Lincoln. Higher-Order, Linear, Concurrent Constraint Programming. Research report, Xerox Palo Research Center, Palo Alto, CA, USA, 1992.
V.A. Saraswat. Concurrent Constraint Programming Languages. The MIT Press, 1993.
L. Schubert. Monotonic Solution for the Frame Problem in the Situation Calculus: an Efficient Method for Worlds with Fully Specified Actions. In H.E. Kyburg, R. Loui, and G. Carlson, editors, Knowledge Representation and Defeasible Reasoning, pages 23–67. Kluwer, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacquet, JM., Monteiro, L. (1994). Towards resource handling in logic programming: The PPL framework and its semantics. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021986
Download citation
DOI: https://doi.org/10.1007/BFb0021986
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58332-5
Online ISBN: 978-3-540-48657-2
eBook Packages: Springer Book Archive