{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:49Z","timestamp":1749124069538},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429357"},{"type":"electronic","value":"9783540456353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45635-x_28","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T21:27:34Z","timestamp":1181165254000},"page":"300-314","source":"Crossref","is-referenced-by-count":8,"title":["An Order-Sorted Resolution with Implicitly Negative Sorts"],"prefix":"10.1007","author":[{"given":"Ken","family":"Kaneiwa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Tojo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,13]]},"reference":[{"key":"28_CR1","unstructured":"Baader, F., & Hanschke, P. (1991). A scheme for integrating concrete domains into concept languages. Pages 452\u2013457 of: Twelfth international conference on artificial intelligence."},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/logcom\/9.3.319","volume":"9","author":"F. Baader","year":"1999","unstructured":"Baader, F., & Sattker, U. (1999). Expressive number restrictions in description logics. Journal of logic and computation, 9(3), 319\u2013350.","journal-title":"Journal of logic and computation"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0004-3702(92)90055-3","volume":"55","author":"C. Beierle","year":"1992","unstructured":"Beierle, C., Hedtsuck, U., Pletat, U., Schmitt, P.H., & Siekmann, J. (1992). An order-sorted logic for knowledge representation systems. Artificial intelligence, 55, 149\u2013191.","journal-title":"Artificial intelligence"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00243207","volume":"3","author":"A. G. Cohn","year":"1987","unstructured":"Cohn, A. G. (1987). A more expressive formulation of many sorted logic. Journal of automated reasoning, 3, 113\u2013200.","journal-title":"Journal of automated reasoning"},{"key":"28_CR5","first-page":"89","volume":"3","author":"A. G. Cohn","year":"1989","unstructured":"Cohn, A. G. (1989). Taxonomic reasoning with many sorted logics. Artificial intelligence review, 3, 89\u2013128.","journal-title":"Artificial intelligence review"},{"key":"28_CR6","unstructured":"Donini, F. D., Lenzerini, M., Nardi, D., & Schaerf, A. (1996). Reasoning in description logic. Brewka, G. (ed), Principles of knowledge representation. CSLI Publications, FoLLI."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(91)90009-9","volume":"49","author":"A. M. Frisch","year":"1991","unstructured":"Frisch, Alan M. (1991). The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artificial intelligence, 49, 161\u2013198.","journal-title":"Artificial intelligence"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Gabbay, D., & Hunter, A. (1999). Negation and contradiction. Gabbay, D. M., & Wansing, H. (eds), What is negation? Kluwer Academic Publishers.","DOI":"10.1007\/978-94-015-9309-0_5"},{"key":"28_CR9","unstructured":"Gallier, Jean H. (1986). Logic for computer science. foundations of automatic theorem proving. Harper & Row."},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1093\/logcom\/9.3.385","volume":"9","author":"I. Horrocks","year":"1999","unstructured":"Horrocks, I. (1999). A description logic with transitive and inverse roles and role hierarchies. Journal of logic and computation, 9(3), 385\u2013410.","journal-title":"Journal of logic and computation"},{"key":"28_CR11","unstructured":"Lobo, J., Minker, J., & Rajasekar, A. (1992). Foundations of disjunctive logic programming. The MIT Press."},{"key":"28_CR12","unstructured":"Ota, A. (1980). Hitei no imi (in Japanese). Taishukan."},{"key":"28_CR13","unstructured":"Richards, T. (1989). Clausal form logic. an introduction to the logic of computer reasoning. Addison-Wesley Publishing Company."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Schmidt-Schauss, M. (1989). Computational aspects of an order-sorted logic with term declarations. Springer-Verlag.","DOI":"10.1007\/BFb0024065"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M. Schmidt-Schauss","year":"1991","unstructured":"Schmidt-Schauss, M., & Smolka, G. (1991). Attributive concept descriptions with complements. Artificial intelligence, 48, 1\u201326.","journal-title":"Artificial intelligence"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0743-1066(92)90039-6","volume":"12","author":"G. Smolka","year":"1992","unstructured":"Smolka, G. (1992). Feature-constraint logics for unification grammars. Journal of logic programming, 12, 51\u201387.","journal-title":"Journal of logic programming"},{"issue":"6","key":"28_CR17","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1093\/logcom\/1.6.835","volume":"1","author":"G. Wagner","year":"1991","unstructured":"Wagner, G. (1991). Logic programming with strong negation and inexact predicates. Journal of logic computation, 1(6), 835\u2013859.","journal-title":"Journal of logic computation"},{"key":"28_CR18","unstructured":"Walther, C. (1987). A many-sorted calculus based on resolution and paramodulation. Pitman and Kaufman Publishers."},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0304-3975(97)00051-0","volume":"185","author":"T. Weibel","year":"1997","unstructured":"Weibel, T. (1997). An order-sorted resolution in theory and practice. Theoretical computer science, 185(2), 393\u2013410.","journal-title":"Theoretical computer science"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45635-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:07:38Z","timestamp":1550365658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45635-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429357","9783540456353"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45635-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}