{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:23:50Z","timestamp":1648589030659},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf02127747","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T11:34:26Z","timestamp":1126784066000},"page":"175-219","source":"Crossref","is-referenced-by-count":33,"title":["Using automata theory for characterizing the semantics of terminological cycles"],"prefix":"10.1007","volume":"18","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02127747_CR1","doi-asserted-by":"crossref","unstructured":"A.V. Aho and J.D. Ullman, University of data retrieval languages, in:Proceedings of the 6th ACM Symposium on Principles of Programming Languages (1979).","DOI":"10.1145\/567752.567763"},{"key":"BF02127747_CR2","unstructured":"F. Baader, Terminological cycles in KL-ONE-based knowledge representation languages, in:Proceedings of the 8th National Conference of the American Association for Artificial Intelligence, AAAI-90 (Boston, 1990)."},{"key":"BF02127747_CR3","unstructured":"F. Baader, Terminological cycles in KL-ONE-based knowledge representation languages, DFKI Research Report RR-90-01, DFKI Kaiserslautern (1990)."},{"key":"BF02127747_CR4","unstructured":"F. Baader, Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles, in:Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI-91 (Sydney, 1991)."},{"key":"BF02127747_CR5","doi-asserted-by":"crossref","unstructured":"F. Baader and B. Hollunder, KRIS: Knowledge representation and inference system,SIGART Bulletin 2 (1991).","DOI":"10.1145\/122296.122298"},{"key":"BF02127747_CR6","doi-asserted-by":"crossref","unstructured":"R.J. Brachman and J.G. Schmolze, An overview of the KL-ONE knowledge representation system,Cognitive Science 16 (1985).","DOI":"10.1207\/s15516709cog0902_1"},{"key":"BF02127747_CR7","unstructured":"R.J. Brachman, V. Pigman-Gilbert and H.J. Levesque, An essential hybrid reasoning system: Knowledge and symbol level accounts in KRYPTON, in:Proceedings of the 9th International Joint Conference on Artificial Intelligence (Los Angeles, 1985)."},{"key":"BF02127747_CR8","unstructured":"J.R. B\u00fcchi, On a decision method in restricted second order arithmetic, in:Proceedings of the 1960 Congress on Logic, Methodology and Philosophy of Science (Stanford, 1960)."},{"key":"BF02127747_CR9","unstructured":"M. Buchheit, F.M. Donini, W. Nutt and A. Schaerf, Refining the structure of terminological systems: Terminology = Schema + Views, in:Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, AAAI-94 (Seattle, 1994)."},{"key":"BF02127747_CR10","unstructured":"R. Dionne, E. Mays and F.J. Oles, A non-well-founded approach to terminological cycles, in:Proceedings of the 10th National Conference of the American Association for Artificial Intelligence, AAAI-92 (San Jose, 1992)."},{"key":"BF02127747_CR11","unstructured":"R. Dionne, E. Mays and F.J. Oles, The equivalence of model-theoretic and structural subsumption in description logics, in:Proceedings of the 13th International Joint Conference on Artificial Intelligence, IJCAI-93 (Chambery, 1993)."},{"key":"BF02127747_CR12","volume-title":"Automata, Languages and Machines, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg,Automata, Languages and Machines, Vol. A (Academic Press, New York\/London, 1974)."},{"key":"BF02127747_CR13","volume-title":"Logic for Computer Science, Foundations of Automated Theorem Proving","author":"J.H. Gallier","year":"1986","unstructured":"J.H. Gallier,Logic for Computer Science, Foundations of Automated Theorem Proving (Harper&Row, New York, 1986)."},{"key":"BF02127747_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)."},{"key":"BF02127747_CR15","unstructured":"G. Giacomo and M. Lenzerini, Concept language with number restrictions and fixpoints, and its relationship with mu-calculus, in:Proceedings of the 11th European Conference on Artificial Intelligence, ECAI-94 (Amsterdam, 1994)."},{"key":"BF02127747_CR16","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, in:Proceedings of the 26th Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, 1985).","DOI":"10.1109\/SFCS.1985.27"},{"key":"BF02127747_CR17","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic,Annals of Pure and Applied Logic 32 (1986).","DOI":"10.1016\/0168-0072(86)90055-2"},{"key":"BF02127747_CR18","doi-asserted-by":"crossref","volume-title":"Naive Set Theory","author":"P.R. Halmos","year":"1974","unstructured":"P.R. Halmos,Naive Set Theory (Springer-Verlag, New York, 1974).","DOI":"10.1007\/978-1-4757-1645-0"},{"key":"BF02127747_CR19","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, 1979)."},{"key":"BF02127747_CR20","doi-asserted-by":"crossref","unstructured":"N. Immerman, Relational queries computable in polynomial time,Information and Control 68 (1986).","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"BF02127747_CR21","unstructured":"T.S. Kaczmarek, W. Mark and K. Sondheimer, Recent developments in NIKL, in:Proceedings of the 5th National Conference of the American Association for Artificial Intelligence, AAAI-86 (Philadelphia, 1986)."},{"key":"BF02127747_CR22","doi-asserted-by":"crossref","unstructured":"J.-L. Lassez, V.L. Nguyen and E.A. Sonenberg, Fixed point theorems and semantics: A folk tale.Information Processing Letters 14 (1982).","DOI":"10.1016\/0020-0190(82)90065-5"},{"key":"BF02127747_CR23","doi-asserted-by":"crossref","unstructured":"H.L. Levesque and R.J. Brachman, Expressiveness and tractability in knowledge representation and reasoning,Computational Intelligence 3 (1987).","DOI":"10.1111\/j.1467-8640.1987.tb00176.x"},{"key":"BF02127747_CR24","volume-title":"Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd,Logic Programming, Second, Extended Edition (Springer-Verlag, Berlin, 1987).","edition":"Second, Extende"},{"key":"BF02127747_CR25","doi-asserted-by":"crossref","unstructured":"R. McNaughton, Testing and generating infinite sequences by a finite automation,Information and Control 9 (1966).","DOI":"10.1016\/S0019-9958(66)80013-X"},{"key":"BF02127747_CR26","unstructured":"R. MacGregor and R. Bates, The Loom knowledge representation language, Technical Report ISI\/RS-87-188, University of Southern California, Information Science Institute (1987)."},{"key":"BF02127747_CR27","volume-title":"Mathematical Theory of Computation","author":"Z. Manna","year":"1974","unstructured":"Z. Manna,Mathematical Theory of Computation (McGraw-Hill, New York, 1974)."},{"key":"BF02127747_CR28","doi-asserted-by":"crossref","unstructured":"J. Minker and J.M. Nicolas, On recursive axioms in deductive databases,Information Systems 8 (1983).","DOI":"10.1016\/0306-4379(83)90024-8"},{"key":"BF02127747_CR29","unstructured":"B. Nebel, On terminological cycles, KIT Report 58, Technische Universit\u00e4t Berlin (1987)."},{"key":"BF02127747_CR30","series-title":"LNCS","volume-title":"Reasoning and Revision in Hybrid Representation Systems","author":"B. Nebel","year":"1990","unstructured":"B. Nebel,Reasoning and Revision in Hybrid Representation Systems, LNCS, Vol. 422 (Springer-Verlag, Berlin, 1990)."},{"key":"BF02127747_CR31","doi-asserted-by":"crossref","unstructured":"B. Nebel, Terminological reasoning is inherently intractable,Artificial Intelligence 43 (1990).","DOI":"10.1016\/0004-3702(90)90087-G"},{"key":"BF02127747_CR32","volume-title":"Formal Aspects of Semantic Networks","author":"B. Nebel","year":"1991","unstructured":"B. Nebel, Terminological cycles: Semantics and computational properties, in:Formal Aspects of Semantic Networks, ed. J. Sowa (Morgan-Kaufmann, San Mateo, 1991)."},{"key":"BF02127747_CR33","doi-asserted-by":"crossref","unstructured":"P. Patel-Schneider, D.L. McGuinness, R.J. Brachman, L. Alperin Resnick and A. Borgida, The CLASSIC knowledge representation system: Guiding principles and implementation issues,SIGART Bulletin 2 (1991).","DOI":"10.1145\/122296.122313"},{"key":"BF02127747_CR34","doi-asserted-by":"crossref","unstructured":"J.P. Pecuchet, On the complementation of B\u00fcchi automata,Theoretical Computer Science 47 (1986).","DOI":"10.1016\/0304-3975(86)90136-2"},{"key":"BF02127747_CR35","volume-title":"Linear Ordering","author":"J.G. Rosenstein","year":"1982","unstructured":"J.G. Rosenstein,Linear Ordering (Academic Press, New York, 1982)."},{"key":"BF02127747_CR36","unstructured":"K. Schild, A correspondence theory for terminological logics, in:Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI-91 (Sydney, 1991)."},{"key":"BF02127747_CR37","unstructured":"K. Schild, Terminological cycles and the propositional \u03bc-calculus, in:Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, KR-94 (Bonn, 1994)."},{"key":"BF02127747_CR38","volume-title":"Denotational Semantics: A Methodology for Language Development","author":"D.A. Schmidt","year":"1986","unstructured":"D.A. Schmidt,Denotational Semantics: A Methodology for Language Development (Allyn and Bacon, Boston, 1986)."},{"key":"BF02127747_CR39","doi-asserted-by":"crossref","unstructured":"A.P. Sistla, M.Y. Vardi and P. Wolper, The complementation problem for B\u00fcchi automata with applications to temporal logic,Theoretical Computer Science 49 (1987).","DOI":"10.1016\/0304-3975(87)90008-9"},{"key":"BF02127747_CR40","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"W. Thomas","year":"1990","unstructured":"W. Thomas, Automata on infinite objects, in: J. Leeuwen (ed.),Handbook of Theoretical Computer Science, Vol. B (Elsevier Science Publishers, Amsterdam, 1990)."},{"key":"BF02127747_CR41","doi-asserted-by":"crossref","unstructured":"M. Vardi, Complexity of relational query languages, in:Proceedings of the 4th ACM Symposium on the Theory of Computing (1982).","DOI":"10.1145\/800070.802186"},{"key":"BF02127747_CR42","doi-asserted-by":"crossref","unstructured":"L. Vielle, Recursive query processing: The power of logic,Theoretical Computer Science 69 (1989).","DOI":"10.1016\/0304-3975(89)90088-1"},{"key":"BF02127747_CR43","unstructured":"C.S. Wu and L.J. Henschen, Answering linear recursive queries in cyclic databases, in:Proceedings of the International Conference on Fifth Generation Computer Systems (Tokyo, 1988)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02127747.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02127747\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02127747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:02:43Z","timestamp":1586440963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02127747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF02127747"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf02127747","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":["Applied Mathematics","Artificial Intelligence"],"published":{"date-parts":[[1996,9]]}}}