{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:38Z","timestamp":1725520658211},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_27","type":"book-chapter","created":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T03:03:10Z","timestamp":1226718190000},"page":"377-390","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning Using Knots"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Magdalena","family":"Ortiz","sequence":"additional","affiliation":[]},{"given":"Mantas","family":"\u0160imkus","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic\u00a027(3), 217\u2013274 (1998)","journal-title":"Journal of Philosophical Logic"},{"volume-title":"The Description Logic Handbook: Theory, Implementation and Applications","year":"2003","key":"27_CR2","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013882326814","volume":"69","author":"F. Baader","year":"2001","unstructured":"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica\u00a069(1), 5\u201340 (2001)","journal-title":"Studia Logica"},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-74610-2_7","volume-title":"Logic Programming","author":"S. Baselice","year":"2007","unstructured":"Baselice, S., Bonatti, P.A., Criscuolo, G.: On finitely recursive programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 89\u2013103. Springer, Heidelberg (2007)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of ICLP 2008","author":"P. Bonatti","year":"2008","unstructured":"Bonatti, P., Baselice, S.: Composing normal programs with function symbols. In: Proc. of ICLP 2008. LNCS. Springer, Heidelberg (to appear, 2008)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of ICLP 2008","author":"F. Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP:\u00a0Theory and implementation. In: Proc. of ICLP 2008. LNCS, vol.\u00a05366, Springer, Heidelberg (2008)"},{"key":"27_CR8","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999), pp. 84\u201389 (1999)"},{"key":"27_CR9","unstructured":"Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: An automata-theoretic approach. In: Proc. of the 22nd Nat. Conf. on Artificial Intelligence (AAAI 2007), pp. 391\u2013396 (2007)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11811220_1","volume-title":"Knowledge Science, Engineering and Management","author":"J. Bruijn de","year":"2006","unstructured":"de Bruijn, J., Eiter, T., Polleres, A., Tompits, H.: On representational issues about combinations of classical theories with nonmonotonic rules. In: Lang, J., Lin, F., Wang, J. (eds.) KSEM 2006. LNCS, vol.\u00a04092, pp. 1\u201322. Springer, Heidelberg (2006)"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/976706.976708","volume":"5","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A logic programming approach to knowledge-state planning: Semantics and complexity. ACM Trans. Comput. Log.\u00a05(2), 206\u2013263 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of JELIA 2008","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Gottlob, G., Ortiz, M., \u0160imkus, M.: Query answering in the description logic Horn-\n                    \n                      \n                    \n                    $\\mathcal{SHIQ}$\n                  . In: Proc. of JELIA 2008. LNCS. Springer, Heidelberg (to appear, 2008)"},{"key":"27_CR13","unstructured":"Eiter, T., Lutz, C., Ortiz, M., \u0160imkus, M.: Complexity of Conjunctive Query Answering in Description Logics with Transitive Roles. Technical report (preliminary), INFSYS RR-1843-08-09, TU Wien (2008)"},{"volume-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008","year":"2008","key":"27_CR14","unstructured":"Fox, D., Gomes, C.P. (eds.): Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17. AAAI Press, Menlo Park (2008)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"27_CR16","unstructured":"Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \n                    \n                      \n                    \n                    $\\mathcal{SHIQ}$\n                  . In: Proc. of IJCAI 2007, pp. 399\u2013404 (2007)"},{"key":"27_CR17","unstructured":"Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query entailment for \n                    \n                      \n                    \n                    $\\mathcal{SHOQ}$\n                  . In: Proc. of the 2007 Description Logic Workshop (DL 2007). CEUR Electronic Workshop Proceedings, vol.\u00a0250, pp. 65\u201375 (2007), \n                    \n                      http:\/\/ceur-ws.org\/Vol-250\/"},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E. Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic\u00a03(1), 53\u201369 (1997)","journal-title":"Bulletin of Symbolic Logic"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-32275-7_2","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"U. Hustadt","year":"2005","unstructured":"Hustadt, U., Motik, B., Sattler, U.: A decomposition rule for decision procedures by resolution-based calculi. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol.\u00a03452, pp. 21\u201335. Springer, Heidelberg (2005)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S1471068403001777","volume":"3","author":"V.W. Marek","year":"2003","unstructured":"Marek, V.W., Remmel, J.B.: On the expressibility of stable logic programming. Theory and Practice of Logic Programming\u00a03, 551\u2013567 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0168-0072(92)90069-C","volume":"56","author":"W. Marek","year":"1992","unstructured":"Marek, W., Nerode, A., Remmel, J.: How Complicated is the Set of Stable Models of a Recursive Logic Program? Annals of Pure and Applied Logic\u00a056, 119\u2013135 (1992)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0743-1066(14)80008-3","volume":"21","author":"W. Marek","year":"1994","unstructured":"Marek, W., Nerode, A., Remmel, J.: The Stable Models of a Predicate Logic Program. Journal of Logic Programming\u00a021(3), 129\u2013153 (1994)","journal-title":"Journal of Logic Programming"},{"key":"27_CR23","volume-title":"Nonmonotonic Logics \u2013 Context-Dependent Reasoning","author":"W. Marek","year":"1993","unstructured":"Marek, W., Truszczy\u0144ski, M.: Nonmonotonic Logics \u2013 Context-Dependent Reasoning. Springer, Heidelberg (1993)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11926078_36","volume-title":"The Semantic Web - ISWC 2006","author":"B. Motik","year":"2006","unstructured":"Motik, B., Horrocks, I., Rosati, R., Sattler, U.: Can OWL and logic programming live together happily ever after? In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol.\u00a04273, pp. 501\u2013514. Springer, Heidelberg (2006)"},{"key":"27_CR25","unstructured":"N\u00e9meti, I.: Free algebras and decidability in algebraic logic. DSc. thesis, Mathematical Institute of The Hungarian Academy of Sciences, Budapest (1986)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Ortiz, M., Calvanese, D., Eiter, T.: Data complexity of query answering in expressive description logics via tableaux. J. of Automated Reasoning (June 2008)","DOI":"10.1007\/s10817-008-9102-9"},{"key":"27_CR27","unstructured":"Ortiz, M., \u0160imkus, M., Eiter, T.: Conjunctive query answering in \n                    \n                      \n                    \n                    $\\mathcal{SH}$\n                   using knots. In: Baader, F., Lutz, C., Motik, B. (eds.) Proc. of DL 2008, Dresden, Germany, May 13-16. CEUR Workshop Proceedings, vol.\u00a0353 (2008), \n                    \n                      CEUR-WS.org"},{"key":"27_CR28","unstructured":"Ortiz, M., \u0160imkus, M., Eiter, T.: Worst-case optimal conjunctive query answering for an expressive description logic without inverses. In: Fox and Gomes [14], pp. 504\u2013510"},{"key":"27_CR29","first-page":"115","volume-title":"FOCS","author":"V.R. Pratt","year":"1979","unstructured":"Pratt, V.R.: Models of program logics. In: FOCS, pp. 115\u2013122. IEEE, Los Alamitos (1979)"},{"issue":"1","key":"27_CR30","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/logcom\/exl034","volume":"17","author":"I. Pratt-Hartmann","year":"2007","unstructured":"Pratt-Hartmann, I.: Complexity of the guarded two-variable fragment with counting quantifiers. J. Log. Comput.\u00a017(1), 133\u2013155 (2007)","journal-title":"J. Log. Comput."},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11837787_5","volume-title":"Reasoning Web","author":"R. Rosati","year":"2006","unstructured":"Rosati, R.: Integrating Ontologies and Rules: Semantic and Computational Issues. In: Barahona, P., Bry, F., Franconi, E., Henze, N., Sattler, U. (eds.) Reasoning Web 2006. LNCS, vol.\u00a04126, pp. 128\u2013151. Springer, Heidelberg (2006)"},{"key":"27_CR32","unstructured":"Rudolph, S., Kr\u00f6tzsch, M., Hitzler, P.: Terminological reasoning in \n                    \n                      \n                    \n                    $\\mathcal{SHIQ}$\n                   with ordered binary decision diagrams. In: Fox and Gomes [14], pp. 529\u2013534"},{"key":"27_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/978-3-540-75560-9_37","volume-title":"Proceedings of LPAR 2007","author":"M. \u0160imkus","year":"2007","unstructured":"\u0160imkus, M., Eiter, T.: FDNC: Decidable non-monotonic disjunctive logic programs with function symbols. In: Proceedings of LPAR 2007. LNCS, vol.\u00a04790, pp. 514\u2013530. Springer, Heidelberg (2007); Full paper Tech. Rep. INFSYS RR-1843-08-01, TU Vienna, \n                    \n                      http:\/\/www.kr.tuwien.ac.at\/research\/reports\/rr0801.pdf"},{"key":"27_CR34","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J.\u00a0Comput. Syst. Sci.\u00a032, 183\u2013221 (1986)","journal-title":"J.\u00a0Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T01:54:40Z","timestamp":1551664480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}