Actions Over a Constructive Semantics for Description Logics

• Autorzy: Bozzato L. , Ferrari M. , Villa P.
• Języki publikacji: EN

Abstrakty

EN

Following the approaches given in recent works about action languages over description logics, we propose an action formalism based on a constructive information terms semantics for ALC. We discuss how a notion of state can be naturally encoded by this semantics. We address the problems of determining executability of an action, building the state obtained by an action application and checking its consistency: we present an algorithm to solve the latter two problems.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 96, nr 3
• Strony: 253--269
• Opis fizyczny: Bibliogr. 18 poz.

Twórcy

autor

Bozzato L.

autor

Ferrari M.

autor

Villa P.

• Dipartimento di Informatica e Comunicazione, Universita degli Studi dell'Insubria, Via Mazzini 5, 21100, Varese, Italy

Bibliografia

• [1] Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., Patel-Schneider, P. F., Eds.: The Description Logic Handbook: Theory, Implementation, and Applications, Cambridge University Press, 2003, ISBN 0-521-78176-0.
• [2] Baader, F., Milicic, M., Lutz, C., Sattler, U., Wolter, F.: Integrating Description Logics and Action Formalisms: First Results, Proceedings of the 2005 International Workshop on Description Logics (DL2005) (I. Horrocks, U. Sattler, F. Wolter, Eds.), 147, CEUR-WS.org, 2005.
• [3] Bozzato, L., Ferrari, M., Fiorentini, C., Fiorino, G.: A constructive semantics for ALC., in: Calvanese et al. [5], 219-226.
• [4] Bozzato, L., Ferrari, M., Villa, P.: Actions over a Constructive Semantics for ALC, Proceedings of the 21st International Workshop on Description Logics (DL2008) (F. Baader, C. Lutz, B. Motik, Eds.), 353, CEUR-WS.org, 2008.
• [5] Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Tessaris, S., Turhan, A., Eds.: Proceedings of the 20th International Workshop on Description Logics (DL2007), vol. 250 of CEUR Workshop Proceedings, CEUR-WS.org, 2007.
• [6] Calvanese, D., Giacomo, G. D., Lenzerini, M., Rosati, R.: Actions and Programs over Description Logic Ontologies, in: Calvanese et al. [5], 29-40.
• [7] Drescher, C., Thielscher,M.: Integrating Action Calculi and Description Logics, KI (J. Hertzberg, M. Beetz, R. Englert, Eds.), 4667, Springer-Verlag, 2007.
• [8] Ferrari, M., Fiorentini, C., Momigliano, A., Ornaghi, M.: Snapshot generation in a constructive objectoriented modeling language, Logic Based Program Synthesis and Transformation, LOPSTR 2007, Selected Papers (A. King, Ed.), 4915, Springer-Verlag, 2008.
• [9] Fiorentini, C., Ornaghi, M.: Answer Set Semantics vs. Information Term Semantics, ASP2007: Answer Set Programming, Advances in Theory and Implementation, http://cooml.dsi.unimi.it/papers/asp.pdf, 2007.
• [10] Kaneiwa, K.: Negations in Description Logic - Contraries, Contradictories, and Subcontraries, Proceedings of the 13th International Conference on Conceptual Structures (ICCS '05), Kassel University Press, 2005.
• [11] Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers, Artif. Intell., 157(1-2), 2004, 115-137, ISSN 0004-3702.
• [12] Miliˇci´c, M.: Planning in Action Formalisms based on DLs: First Results., in: Calvanese et al. [5], 112-122.
• [13] Nelson, D.: Constructible Falsity, Journal of Symbolic Logic, 14(1), 1949, 16-26.
• [14] Niemelä, I., Simons, P.: Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP, LPNMR, 1997.
• [15] Ornaghi,M., Benini,M., Ferrari,M., Fiorentini, C.,Momigliano, A.: A ConstructiveModeling Language for Object Oriented Information Systems, Constructive Logic for Automated Software Engineering, 153, 2006.
• [16] Schmidt-Schauß, M., Smolka, G.: Attributive Concept Descriptions with Complements, Artificial Intelligence, 48(1), 1991, 1-26.
• [17] Thielscher, M.: FLUX: A logic programming method for reasoning agents, Theory and Practice of Logic Programming, 5(4-5), 2005, 533-565.
• [18] Troelstra, A. S.: From Constructivism to Computer Science., TCS, 211(1-2), 1999, 233-252.