{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:37:16Z","timestamp":1726033036421},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030221010"},{"type":"electronic","value":"9783030221027"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22102-7_4","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T12:21:26Z","timestamp":1561465286000},"page":"90-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Initial Steps Towards a Family of Regular-Like Plan Description Logics"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Borgida","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1613\/jair.516","volume":"9","author":"A Artale","year":"1998","unstructured":"Artale, A., Franconi, E.: A temporal description logic for reasoning about actions and plans. J. Artif. Intell. Res. 9, 463\u2013506 (1998)","journal-title":"J. Artif. Intell. Res."},{"unstructured":"Baader, F.: A formal definition for the expressive power of knowledge representation languages. In: Proceedings of the ECAI, pp. 53\u201358 (1990)","key":"4_CR2"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1093\/logcom\/6.1.33","volume":"6","author":"F Baader","year":"1996","unstructured":"Baader, F.: A formal definition for the expressive power of terminological knowledge representation languages. J. Log. Comput. 6(1), 33\u201354 (1996)","journal-title":"J. Log. Comput."},{"unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI 2005, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, 30 July\u20135 August 2005, pp. 364\u2013369 (2005)","key":"4_CR4"},{"unstructured":"Baader, F., Calvanese, D., McGuinness, D., Patel-Schneider, P., Nardi, D.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)","key":"4_CR5"},{"unstructured":"Baader, F., Liu, H., ul Mehdi, A.: Verifying properties of infinite sequences of description logic actions. In: ECAI, Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 53\u201358. IOS Press (2010)","key":"4_CR6"},{"doi-asserted-by":"crossref","unstructured":"Baader, F., Lutz, C., Milicic, M., Sattler, U., Wolter, F.: Integrating description logics and action formalisms: first results. In: AAAI, pp. 572\u2013577. AAAI Press (2005)","key":"4_CR7","DOI":"10.25368\/2010.145"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.04.022","volume":"489","author":"M Berglund","year":"2013","unstructured":"Berglund, M., Bj\u00f6rklund, H., Bj\u00f6rklund, J.: Shuffled languages\u2013representation and recognition. Theor. Comput. Sci. 489, 1\u201320 (2013)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Borgida, A.: Towards the systematic development of description logic reasoners: CLASP reconstructed. In: Proceedings of the KR 1992, Cambridge, MA, USA, pp. 259\u2013269 (1992)","key":"4_CR9"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/66926.66932","volume":"18","author":"Alexander Borgida","year":"1989","unstructured":"Borgida, A., Brachman, R.J., McGuinness, D.L., Resnick, L.A.: CLASSIC: a structural data model for objects. In: Proceedings of SIGMOD 1989, pp. 58\u201367 (1989)","journal-title":"ACM SIGMOD Record"},{"unstructured":"Brachman, R.J., Levesque, H.J.: The tractability of subsumption in frame-based description languages. In: AAAI, vol. 84, pp. 34\u201337 (1984)","key":"4_CR11"},{"unstructured":"De Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proceedings of the AAAI 1994, pp. 205\u2013212 (1994)","key":"4_CR12"},{"unstructured":"De Giacomo, G., Lenzerini, M.: Tbox and Abox reasoning in expressive description logics. In: Proceedings of the AAAI, pp. 37\u201348. AAAI Press (1996)","key":"4_CR13"},{"unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI 2013, pp. 854\u2013860. IJCAI\/AAAI (2013)","key":"4_CR14"},{"issue":"1\u20132","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00091-7","volume":"84","author":"PT Devanbu","year":"1996","unstructured":"Devanbu, P.T., Litman, D.J.: Taxonomic plan reasoning. Artif. Intell. 84(1\u20132), 1\u201335 (1996)","journal-title":"Artif. Intell."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-10003-2_74","volume-title":"Automata, Languages and Programming","author":"M F\u00fcrer","year":"1980","unstructured":"F\u00fcrer, M.: The complexity of the inequivalence problem for regular expressions with intersection. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 234\u2013245. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_74"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2071368.2071372","volume":"4","author":"W Gelade","year":"2012","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. ACM Trans. Comput. Logic 4(1), 1\u201319 (2012)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"2","key":"4_CR18","first-page":"73","volume":"26","author":"Y Gil","year":"2005","unstructured":"Gil, Y.: Description logics and planning. AI Mag. 26(2), 73\u201384 (2005)","journal-title":"AI Mag."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-02737-6_22","volume-title":"Developments in Language Theory","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Tight bounds on the descriptional complexity of regular expressions. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 276\u2013287. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_22"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-14455-4_3","volume-title":"Developments in Language Theory","author":"M Holzer","year":"2010","unstructured":"Holzer, M., Kutrib, M.: The complexity of regular(-like) expressions. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 16\u201330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14455-4_3"},{"unstructured":"Hunt III, H.B.: The equivalence problem for regular expressions with intersections is not polynomial in tape. Technical report, pp. 73\u2013161, Department of Computer Science, Cornell University, Ithaca, New York (1973)","key":"4_CR21"},{"issue":"1\u20132","key":"4_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(99)00109-7","volume":"250","author":"J J\u0229drzejowicz","year":"2001","unstructured":"J\u0229drzejowicz, J., Szepietowski, A.: Shuffle languages are in P. Theor. Comput. Sci. 250(1\u20132), 31\u201353 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","volume":"40","author":"T Jiang","year":"1991","unstructured":"Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Inf. Process. Lett. 40(1), 25\u201331 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"ND Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68\u201385 (1975)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November 1977, pp. 254\u2013266 (1977)","key":"4_CR25","DOI":"10.1109\/SFCS.1977.16"},{"unstructured":"Liu, H., Lutz, C., Milicic, M., Wolter, F.: DL actions with GCIs: a pragmatic approach. In: CEUR Workshop Proceedings of Description Logics, vol. 189. CEUR-WS.org (2006)","key":"4_CR26"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/11853886_23","volume-title":"Logics in Artificial Intelligence","author":"H Liu","year":"2006","unstructured":"Liu, H., Lutz, C., Mili\u010di\u0107, M., Wolter, F.: Reasoning about actions using description logics with general TBoxes. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 266\u2013279. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11853886_23"},{"doi-asserted-by":"crossref","unstructured":"Lutz, C., Wolter, F., Zakharyaschev, M.: Temporal description logics: a survey. In Proceedings of Temporal Representation and Reasoning, pp. 3\u201314. IEEE (2008)","key":"4_CR28","DOI":"10.1109\/TIME.2008.14"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/inco.1994.1098","volume":"115","author":"AJ Mayer","year":"1994","unstructured":"Mayer, A.J., Stockmeyer, L.J.: The complexity of word problems-this time with interleaving. Inf. Comput. 115(2), 293\u2013311 (1994)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: 13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, 25\u201327 October 1972, pp. 125\u2013129 (1972)","key":"4_CR30","DOI":"10.1109\/SWAT.1972.29"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","volume":"43","author":"B Nebel","year":"1990","unstructured":"Nebel, B.: Terminological reasoning is inherently intractable. Artif. Intell. 43(2), 235\u2013249 (1990)","journal-title":"Artif. Intell."},{"unstructured":"Petersen, H.: Decision problems for generalized regular expressions. In: Descriptional Complexity of Automata, Grammars and Related Structures, Proceedings, DCAGRS 2000, pp. 22\u201329 (2000)","key":"4_CR32"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-45841-7_42","volume-title":"STACS 2002","author":"H Petersen","year":"2002","unstructured":"Petersen, H.: The membership problem for regular expressions with intersection is complete in LOGCFL. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 513\u2013522. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_42"},{"unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: IJCAI, pp. 466\u2013471. Morgan Kaufmann (1991)","key":"4_CR34"},{"unstructured":"Schmiedel, A.: Temporal terminological logic. In: Proceedings of AAAI 1990, pp. 640\u2013645 (1990)","key":"4_CR35"},{"unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1997)","key":"4_CR36"},{"unstructured":"Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (1974)","key":"4_CR37"},{"doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Symposium on Theory of Computing (STOC 1973), pp. 1\u20139 (1973)","key":"4_CR38","DOI":"10.1145\/800125.804029"},{"unstructured":"Weida, R.: Knowledge representation for plan recognition. In: IJCAI 1995 Workshop on the Next Generation of Plan Recognition Systems (1995)","key":"4_CR39"},{"issue":"10","key":"4_CR40","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MC.1983.1654193","volume":"16","author":"WA Woods","year":"1983","unstructured":"Woods, W.A.: What\u2019s important about knowledge representation. IEEE Comput. 16(10), 22\u201326 (1983)","journal-title":"IEEE Comput."}],"container-title":["Lecture Notes in Computer Science","Description Logic, Theory Combination, and All That"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22102-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T20:27:18Z","timestamp":1663792038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22102-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030221010","9783030221027"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22102-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}