×

Progression of decomposed local-effect action theories. (English) Zbl 1367.68292


MSC:

68T27 Logic in artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Eyal Amir. 2000. (De)composition of situation calculus theories. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI’00), Henry A. Kautz and Bruce W. Porter (Eds.). AAAI Press/MIT Press, 456–463.
[2] Eyal Amir. 2002. Projection in decomposed situation calculus. In Proceedings of the Eighth International Conference on Principles and Knowledge Representation and Reasoning (KR’02), Dieter Fensel, Fausto Giunchiglia, Deborah L. McGuinness, and Mary-Anne Williams (Eds.). Morgan Kaufmann, 315–326.
[3] Eyal Amir and Sheila A. McIlraith. 2005. Partition-based logical reasoning for first-order and propositional theories. Artif. Intell. 162, 1–2 (2005), 49–88. DOI:http://dx.doi.org/10.1016/j.artint.2004.11.004 · Zbl 1132.68672 · doi:10.1016/j.artint.2004.11.004
[4] Stephen A. Cook and Yongmei Liu. 2003. A complete axiomatization for blocks world. J. Log. Comput. 13, 4 (2003), 581–594. · Zbl 1046.68101 · doi:10.1093/logcom/13.4.581
[5] William Craig. 1957. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symb. Log. 22, 3 (1957), 269–285. · Zbl 0079.24502 · doi:10.2307/2963594
[6] William Craig. 2008. The road to two theorems of logic. Synthese 164, 3 (2008), 333–339. · Zbl 1171.03017 · doi:10.1007/s11229-008-9353-3
[7] Giuseppe De Giacomo, Yves Lespérance, and Fabio Patrizi. 2012. Bounded situation calculus action theories and decidable verification. In Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR’12), Gerhard Brewka, Thomas Eiter, and Sheila A. McIlraith (Eds.). AAAI Press.
[8] Giuseppe De Giacomo and Toni Mancini. 2004. Scaling up reasoning about actions using relational database technology. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence (AAAI’04), Deborah L. McGuinness and George Ferguson (Eds.). AAAI Press/MIT Press, 245–256.
[9] Pavel Emelyanov and Denis Ponomaryov. 2015. Algorithmic issues of AND-decomposition of boolean formulas. Program. Comput. Softw. 41, 3 (2015), 162–169. · Zbl 1339.94099 · doi:10.1134/S0361768815030032
[10] Yu. L. Ershov. 1980. Decision Problems and Constructive Models. (in Russian). Nauka, Moscow. 416 pages. · Zbl 0495.03009
[11] Harvey Friedman. 1976. The complexity of explicit definitions. Adv. Math. 20 (1976), 18–29. · Zbl 0355.02010 · doi:10.1016/0001-8708(76)90167-5
[12] Silvio Ghilardi, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. 2006. Conservative extensions in modal logics. In Proceedings of AiML-6. College Publications, 187–207. · Zbl 1148.03014
[13] Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov, and Ulrike Sattler. 2008. Modular reuse of ontologies: Theory and practice. J. Artif. Int. Res. 31, 1 (Feb. 2008), 273–318. · Zbl 1183.68479
[14] C. Cordell Green. 1969. Application of theorem proving to problem solving. In Proceedings of the 1st International Joint Conference on Artificial Intelligence (IJCAI’69), Donald E. Walker and Lewis M. Norton (Eds.). William Kaufmann, 219–240.
[15] Michael Grüninger, Torsten Hahmann, Ali Hashemi, Darren Ong, and Atalay Özgövde. 2012. Modular first-order ontologies via repositories. Appl. Ontol. 7, 2 (2012), 169–209.
[16] Yilan Gu and Mikhail Soutchanski. 2010. A description logic based situation calculus. Ann. Math. Artif. Intell. 58, 1–2 (2010), 3–83. · Zbl 1205.68405
[17] Boris Konev, Carsten Lutz, Denis Ponomaryov, and Frank Wolter. 2010. Decomposing description logic ontologies. In Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR’10), Fangzhen Lin, Ulrike Sattler, and Miroslaw Truszczynski (Eds.). AAAI Press.
[18] Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolter. 2009. Formal properties of modularisation. In Modular Ontologies, Heiner Stuckenschmidt, Christine Parent, and Stefano Spaccapietra (Eds.). Lecture Notes in Computer Science, Vol. 5445. Springer, 25–66. · Zbl 1242.68315 · doi:10.1007/978-3-642-01907-4_3
[19] Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolter. 2013. Model-theoretic inseparability and modularity of description logic ontologies. Artif. Intell. 203 (2013), 66–103. DOI:http://dx.doi.org/10.1016/j.artint.2013.07.004 · Zbl 1329.68248 · doi:10.1016/j.artint.2013.07.004
[20] George Kourousias and David Makinson. 2007. Parallel interpolation, splitting, and relevance in belief change. J. Symb. Log. 72, 3 (2007), 994–1002. · Zbl 1124.03004 · doi:10.2178/jsl/1191333851
[21] Gerhard Lakemeyer and Hector J. Levesque. 2002. Evaluation-based reasoning with disjunctive information in first-order knowledge bases. In Proc. of KR-02. 73–81.
[22] Hector Levesque and Gerhard Lakemeyer. 2007. Cognitive robotics (chapter 24). In Handbook of Knowledge Representation, Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter (Eds.). Elsevier, 869–886.
[23] Fangzhen Lin. 2001. On strongest necessary and weakest sufficient conditions. Artif. Intell. 128, 1–2 (2001), 143–159. · Zbl 0971.68127
[24] Fangzhen Lin. 2004. Discovering state invariants. In Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR’04), Didier Dubois, Christopher A. Welty, and Mary-Anne Williams (Eds.). AAAI Press, 536–544.
[25] Fangzhen Lin and Ray Reiter. 1994. Forget It! In Proceedings of the AAAI Fall Symposium on Relevance. 154–159.
[26] Fangzhen Lin and Raymond Reiter. 1997. How to progress a database. Artif. Intell. 92 (1997), 131–167. · Zbl 1017.68510 · doi:10.1016/S0004-3702(96)00044-6
[27] Yongmei Liu and Gerhard Lakemeyer. 2009. On first-order definability and computability of progression for local-effect actions and beyond. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI’09), Craig Boutilier (Ed.). 860–866. · Zbl 1341.68216
[28] Yongmei Liu and Hector J. Levesque. 2005. Tractable reasoning with incomplete first-order knowledge in dynamic systems with context-dependent actions. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI’05), Leslie Pack Kaelbling and Alessandro Saffiotti (Eds.). Professional Book Center, 522–527.
[29] Carsten Lutz, Dirk Walther, and Frank Wolter. 2007a. Conservative extensions in expressive description logics. In Proc. of IJCAI-2007. AAAI Press, 453–459.
[30] Carsten Lutz, Dirk Walther, and Frank Wolter. 2007b. Conservative extensions in expressive description logics. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI’07), Manuela M. Veloso (Ed.). 453–458.
[31] Carsten Lutz and Frank Wolter. 2009. Mathematical logic for life science ontologies. In Proceedings of the 16th International Workshop on Logic, Language, Information and Computation (WoLLIC’09) (Lecture Notes in Computer Science), Hiroakira Ono, Makoto Kanazawa, and Ruy J. G. B. de Queiroz (Eds.), Vol. 5514. Springer, 37–47. · Zbl 1246.68211 · doi:10.1007/978-3-642-02261-6_4
[32] Carsten Lutz and Frank Wolter. 2010. Deciding inseparability and conservative extensions in the description logic EL. J. Symb. Comput. 45, 2 (2010), 194–228. · Zbl 1187.68572 · doi:10.1016/j.jsc.2008.10.007
[33] John McCarthy. 1963. Situations, Actions and Causal Laws. Memo 2. Stanford University, Department of Computer Science. Reprinted in: “Semantic Information Processing” (M. Minsky, Ed.), MIT Press, Cambridge, MA, 1968, pages 410–417.
[34] John McCarthy and Patrick Hayes. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence, B. Meltzer and D. Michie (Eds.). Vol. 4. Edinburgh University Press, Reprinted in “Formalization of Common Sense: Papers by John McCarthy” (V. Lifschitz, Ed.), Ablex, Norwood, NJ, 1990, 463–502. · Zbl 0226.68044
[35] Andrey Morozov and Denis Ponomaryov. 2010. On decidability of the decomposability problem for finite theories. Siberian Math. J. 51, 4 (2010), 667–674. · Zbl 1226.03022 · doi:10.1007/s11202-010-0068-6
[36] Daniele Mundici. 1982. Complexity of Craig’s interpolation. Fund. Informat. 5 (1982), 261–278. · Zbl 0507.03025
[37] Fiora Pirri and Ray Reiter. 1999. Some contributions to the metatheory of the situation calculus. J. ACM 46, 3 (1999), 325–364. · Zbl 1065.68627 · doi:10.1145/316542.316545
[38] Denis Ponomaryov. 2008. On decomposibility in logical calculi. Bull. Novosibirsk Comput. Center 28 (2008), 111–120. · Zbl 1249.03044
[39] Denis Ponomaryov. 2014. The algorithmic complexity of decomposability in fragments of first-order logic. Manuscript. Abstract to appear in the Bulletin of Symbolic Logic. http://persons.iis.nsk.su/files/persons/pages/sigdecomp.pdf.
[40] Denis Ponomaryov and Mikhail Soutchanski. 2013. Progression of decomposed situation calculus theories. In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI’13), Marie desJardins and Michael L. Littman (Eds.). AAAI Press. · Zbl 1367.68292
[41] Denis Ponomaryov and Dmitry Vlasov. 2013. Concept definability and interpolation in enriched models of EL-TBoxes. In Description Logics (CEUR Workshop Proceedings), Thomas Eiter, Birte Glimm, Yevgeny Kazakov, and Markus Krötzsch (Eds.), Vol. 1014. CEUR-WS.org, 898–916.
[42] Raymond Reiter. 1993. Proving properties of states in the situation calculus. Artif. Intell. 64, 2 (1993), 337–351. DOI:http://dx.doi.org/10.1016/0004-3702(93)90109-O · Zbl 0788.68139 · doi:10.1016/0004-3702(93)90109-O
[43] Raymond Reiter. 2001. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press. · Zbl 1018.03022
[44] Balder ten Cate, Enrico Franconi, and Inanç Seylan. 2013. Beth definability in expressive description logics. J. Artif. Intell. Res. 48 (2013), 347–414. DOI:http://dx.doi.org/10.1613/jair.4057 · Zbl 1442.68223
[45] Stavros Vassos and Hector J. Levesque. 2008. On the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI’08), Dieter Fox and Carla P. Gomes (Eds.). AAAI Press, 1004–1009.
[46] Stavros Vassos and Fabio Patrizi. 2013. A classification of first-order progressable action theories in situation calculus. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI’13), Francesca Rossi (Ed.). IJCAI/AAAI. · Zbl 1432.68450
[47] Chiara Del Vescovo, Bijan Parsia, Ulrike Sattler, and Thomas Schneider. 2011. The modular structure of an ontology: Atomic decomposition. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI’11), Toby Walsh (Ed.). IJCAI/AAAI, 2232–2237.
[48] Wael Yehia, Hongkai Liu, Marcel Lippmann, Franz Baader, and Mikhail Soutchanski. 2012. Experimental results on solving the projection problem in action formalisms based on description logics. In Description Logics (CEUR Workshop Proceedings), Yevgeny Kazakov, Domenico Lembo, and Frank Wolter (Eds.), Vol. 846. CEUR-WS.org.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.