Abstract
In this paper we propose a modal approach for reasoning about dynamic domains in a logic programming setting. We present a logical framework for reasoning about actions in which modal inclusion axioms of the form 〈p o〉 ϕ ⊂ 〈p 1〉〈p 2〉 ... 〈p n〉ϕ allow procedures to be defined for building complex actions from elementary actions. The language is able to handle knowledge producing actions as well as actions which remove information. Incomplete states are represented by means of epistemic operators and test actions can be used to check whether a fluent is true, false or undefined in a state. We give a non-monotonic solution for the frame problem by making use of persistency assumptions in the context of an abductive characterization. A goal directed proof procedure is defined, which allows reasoning about complex actions and generating conditional plans.
This is a preview of subscription content, log in via an institution to check access.
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
M. Baldoni. Normal Multimodal Logics: Automatic Deduction and Logic Programming Extension. PhD thesis, Dipartimento di Informatica, Università degli Studi di Torino, Italy, 1998. Available at http://www.di.unito.it/~baldoni/.
M. Baldoni. Normal Multimodal Logics with Interaction Axioms. In D. Basin, M. D’Agostino, D. M. Gabbay, S. Matthews, and L. Viganò, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 33–53. Applied Logic Series, Kluwer Academic Publisher, 2000.
M. Baldoni, C. Baroglio, A. Chiarotto, and V. Patti. Programming Goal-driven Web Sites using an Agent Logic Language. In I. V. Ramakrishnan, editor, Proc. of the Third International Symposium on Practical Aspects of Declarative Languages, volume 1990 of LNCS, pages 60–75, Las Vegas, Nevada, USA, 2001. Springer.
M. Baldoni, C. Baroglio, and V. Patti. Structereless, Intention-guided Web Sites: Planning Based Adaptation. In Proc. 1st International Conference on Universal Access in Human-Computer Interaction, a track of HCI International 2001, New Orleans, LA, USA, 2001. Lawrence Erlbaum Associates. To appear.
M. Baldoni, L. Giordano, and A. Martelli. A Tableau Calculus for Multimodal Logics and Some (un)Decidability Results. In H. de Swart, editor, Proc. of TABLEAUX’98, volume 1397 of LNAI, pages 44–59. Springer-Verlag, 1998.
M. Baldoni, L. Giordano, A. Martelli, and V. Patti. An Abductive Proof Procedure for Reasoning about Actions in Modal Logic Programming. In J. Dix et al., editor, Proc. of NMELP’96, volume 1216 of LNAI, pages 132–150, 1997.
M. Baldoni, L. Giordano, A. Martelli, and V. Patti. Modeling agents in a logic action language. In Proc. of Workshop on Practical Reasoning Agents, FAPR2000, 2000. to appear.
C. Baral and T. C. Son. Formalizing Sensing Actions — A transition function based approach. Artificial Intelligence, 125(1-2):19–91, January 2001.
M. Castilho, O. Gasquet, and A. Herzig. Modal tableaux for reasoning about actions and plans. In S. Steel, editor, Proc. ECP’97, LNAI, pages 119–130, 1997.
G. De Giacomo and M. Lenzerini. PDL-based framework for reasoning about actions. In Proc. of AI*IA’ 95, volume 992 of LNAI, pages 103–114, 1995.
G. De Giacomo, Y. Lespérance, and H. J. Levesque. Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus. In Proceedings of IJCAI’97, pages 1221–1226, Nagoya, August 1997.
G. De Giacomo and H. J. Levesque. An Incremental Interpreter for High-Level Programs with Sensing. In Proceedings of the AAAI 1998 Fall Symposium on Cognitive Robotics, Orlando, Florida, USA, October 1998.
G. De Giacomo and R. Rosati. Minimal knowledge approach to reasoning about actions and sensing. In Proc. of NRAC’99, Stockholm, Sweden, August 1999.
S. Demri. The Complexity of Regularity in Grammar Logics. J. of Logic and Computation, 2001. To appear, available at http://www.lsv.ens-cachan.fr/~demri/.
M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abduction Logic Programming. In Proc. of ILPS’ 93, Vancouver, 1993. The MIT Press.
K. Eshghi and R. Kowalski. Abduction compared with Negation by Failure. In Proc. of ICLP’ 89, Lisbon, 1989. The MIT Press.
M. Gelfond and V. Lifschitz. Representing action and change by logic programs. Journal of Logic Programming, 17:301–321, 1993.
L. Giordano, A. Martelli, and C. Schwind. Dealing with concurrent actions in modal action logic. In Proc. ECAI-98, pages 537–541, 1998.
L. Giordano, A. Martelli, and Camilla Schwind. Ramification and causality in a modal action logic. Journal of Logic and Computation, 10(5):625–662, 2000.
D. Harel. Dynamic Logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume II, pages 497–604. D. Reidel, 1984.
H. J. Levesque. What is planning in the presence of sensing? In Proc. of the AAAI-96, pages 1139–1146, 1996.
H. J. Levesque, R. Reiter, Y. Lespérance, F. Lin, and R. B. Scherl. GOLOG: A Logic Programming Language for Dynamic Domains. J. of Logic Prog., 31, 1997.
J. Lobo, G. Mendez, and S. R. Taylor. Adding Knowledge to the Action Description Language A. In Proc. of AAAI’97/IAAI’97, pages 454–459, Menlo Park, 1997.
H. Prendinger and G. Schurz. Reasoning about action and change. a dynamic logic approach. Journal of Logic, Language, and Information, 5(2):209–245, 1996.
R. Scherl and H. J. Levesque. The frame problem and knowledge-producing actions. In Proc. of the AAAI-93, pages 689–695, Washington, DC, 1993.
C. B. Schwind. A logic based framework for action theories. In J. Ginzburg et al., editor, Language, Logic and Computation, pages 275–291. CSLI, 1997.
M. Thielscher. Representing the Knowledge of a Robot. In Proc. of the International Conference on Principles of Knowledge Representation and reasoning, KR’00, pages 109–120. Morgan Kaufmann, 2000.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldoni, M., Giordano, L., Martelli, A., Patti, V. (2001). Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_26
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive