{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:48:17Z","timestamp":1764841697900,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287169"},{"type":"electronic","value":"9783642287176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_11","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T15:13:04Z","timestamp":1331046784000},"page":"107-121","source":"Crossref","is-referenced-by-count":1,"title":["Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0049320","volume-title":"Computer Science Logic","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., Kozen, D., Vardi, M.Y., Wimmers, E.L.: The Complexity of Set Constraints. In: Meinke, K., B\u00f6rger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol.\u00a0832, pp. 1\u201317. Springer, Heidelberg (1994)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1006\/inco.1995.1139","volume":"122","author":"A. Aiken","year":"1995","unstructured":"Aiken, A., Kozen, D., Wimmers, E.L.: Decidability of systems of set constraints with negative constraints. Information and Computation\u00a0122(1), 30\u201344 (1995)","journal-title":"Information and Computation"},{"key":"11_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45653-8_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., K\u00fcsters, R.: Unification in a Description Logic with Transitive Closure of Roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 217\u2013232. Springer, Heidelberg (2001)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jsco.2000.0426","volume":"31","author":"F. Baader","year":"2001","unstructured":"Baader, F., Narendran, P.: Unification of concept terms in description logic. Journal of Symbolic Computation\u00a031, 277\u2013305 (2001)","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Okhotin, A.: On Language Equations with One-sided Concatenation., LTCS-Report LTCS-06-01, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden, A short version has been published in the Proceedings of the 20th International Workshop on Unification, UNIF 2006 (2006), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2022.154"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Okhotin, A.: Solving Language Equations and Disequations Using Looping Tree Automata with Colors, LTCS-Report LTCS-12-01, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden (2012), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2022.185"},{"key":"11_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-45744-5_8","volume-title":"Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Tobies, S.: The Inverse Method Implements the Automata Approach for Modal Satisfiability. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 92\u2013106. Springer, Heidelberg (2001)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Charatonik, W., Pacholski, L.: Negative set constraints with equality. In: Logic in Computer Science, LICS 1994, Paris, France, pp. 128\u2013136 (1994)","DOI":"10.1109\/LICS.1994.316078"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. of the ACM\u00a09, 350\u2013371 (1962)","journal-title":"J. of the ACM"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-70583-3_6","volume-title":"Automata, Languages and Programming","author":"A. Je\u017c","year":"2008","unstructured":"Je\u017c, A., Okhotin, A.: On the Computational Completeness of Equations over Sets of Natural Numbers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 63\u201374. Springer, Heidelberg (2008)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-73208-2_3","volume-title":"Developments in Language Theory","author":"M. Kunc","year":"2007","unstructured":"Kunc, M.: What Do We Know About Language Equations? In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 23\u201327. Springer, Heidelberg (2007)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-14455-4_27","volume-title":"Developments in Language Theory","author":"T. Lehtinen","year":"2010","unstructured":"Lehtinen, T., Okhotin, A.: On Language Equations XXK = XXL and XM = N over a Unary Alphabet. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 291\u2013302. Springer, Heidelberg (2010)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/11549345_61","volume-title":"Mathematical Foundations of Computer Science 2005","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: Strict Language Inequalities and Their Decision Problems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 708\u2013719. Springer, Heidelberg (2005)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/BFb0017466","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"L. Pacholski","year":"1997","unstructured":"Pacholski, L., Podelski, A.: Set Constraints: A Pearl in Research on Constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 549\u2013562. Springer, Heidelberg (1997)"},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0214066","volume":"14","author":"R. Parikh","year":"1985","unstructured":"Parikh, R., Chandra, A., Halpern, J., Meyer, A.: Equations between regular terms and an application to process logic. SIAM Journal on Computing\u00a014(4), 935\u2013942 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR16","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Stef\u00e1nsson, K.: Systems of set constraints with negative constraints are NEXPTIME-complete. In: Logic in Computer Science, LICS 1994, Paris, France, pp. 137\u2013141 (1994)","DOI":"10.1109\/LICS.1994.316077"},{"key":"11_CR18","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. Journal of Computer and System Sciences\u00a032, 183\u2013221 (1986)","journal-title":"Journal of Computer and System Sciences"}],"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-642-28717-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T14:59:22Z","timestamp":1742655562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}