{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:10:07Z","timestamp":1725487807447},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662235"},{"type":"electronic","value":"9783540486596"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48659-3_31","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T13:47:14Z","timestamp":1185025634000},"page":"480-493","source":"Crossref","is-referenced-by-count":11,"title":["Tractable and Decidable Fragments of Conceptual Graphs"],"prefix":"10.1007","author":[{"given":"F.","family":"Baader","sequence":"first","affiliation":[]},{"given":"R.","family":"Molitor","sequence":"additional","affiliation":[]},{"given":"S.","family":"Tobies","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"H. Andr\u00e9ka, J. van Benthem, and I. N\u00e9meti. Modal languages and bounded fragments of predicate logic. J. of Philosophical Logic, 27(3):217\u2013274, 1998.","journal-title":"J. of Philosophical Logic"},{"key":"31_CR2","unstructured":"F. Baader, R. Molitor, and S. Tobies. The Guarded Fragment of Conceptual Graphs. LTCS-Report 98\u201310, available at \n                    http:\/\/www-lti.informatik.rwth-aachen.de\/Forschung\/Papers.html\n                    \n                  ."},{"key":"31_CR3","unstructured":"F. Baader, R. Molitor, and S. Tobies. On the Relationship between Descripion Logics and Conceptual Graphs. LTCS-Report 98\u201311, available at \n                    http:\/\/www-lti.informatik.rwth-aachen.de\/Forschung\/Papers.html\n                    \n                  ."},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger, E. Gr\u00e4del, and Y. Gurevich. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997.","DOI":"10.1007\/978-3-642-59207-2"},{"issue":"4","key":"31_CR5","first-page":"365","volume":"6","author":"M. Chein","year":"1992","unstructured":"M. Chein and M. L. Mugnier. Conceptual graphs: fundamental notions. Revue d\u2019Intelligence Artificielle, 6(4):365\u2013406, 1992.","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"31_CR6","unstructured":"M. Chein, M. L. Mugnier, and G. Simonet. Nested graphs: a graph-based knowledge representation model with FOL semantics. In Proc. KR\u201998, 1998."},{"key":"31_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ICCS\u201998","author":"P. Coupey","year":"1998","unstructured":"P. Coupey and C. Faron. Towards correspondences between conceptual graphs and description logics. In Proc. ICCS\u201998, LNCS 1453, 1998."},{"key":"31_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CADE-15","author":"H. Nivelle de","year":"1998","unstructured":"H. de Nivelle. A resolution decision procedure for the guarded fragment. In Proc. CADE-15, LNCS 1421, 1998."},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F. M. Donini","year":"1997","unstructured":"F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and Computation, 134(1):1\u201358, 1997.","journal-title":"Information and Computation"},{"key":"31_CR10","unstructured":"F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In Foundation of Knowledge Representation, CSLI-Publications, 1996."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del. On the restraining power of guards. Journal of Symbolic Logic, 1999. To appear.","DOI":"10.2307\/2586808"},{"key":"31_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ICCS\u201997","author":"G. Kerdiles","year":"1997","unstructured":"G. Kerdiles and E. Salvat. A sound and complete CG proof procedure combining projections with analytic tableaux. In Proc. ICCS\u201997, LNCS 1257, 1997."},{"key":"31_CR13","series-title":"Lect Notes Comput Sci","first-page":"1993","volume-title":"Proc. 7th Workshop on Conceptual Structures, 1992","author":"M. L. Mugnier","year":"1993","unstructured":"M. L. Mugnier and M. Chein. Polynomial algorithms for projection and matching. In Proc. 7th Workshop on Conceptual Structures, 1992, LNCS 754, 1993."},{"key":"31_CR14","unstructured":"John F. Sowa. Conceptual Structures. Addison-Wesley, 1984."},{"key":"31_CR15","series-title":"Technical Report","volume-title":"Dynamic Bits and Pieces","author":"J. Benthem van","year":"1997","unstructured":"J. van Benthem. Dynamic Bits and Pieces. Technical Report LP-1997-01, ILLC, University of Amsterdam, The Netherlands, 1997."},{"key":"31_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ICCS\u201995","author":"M. Wermelinger","year":"1995","unstructured":"M. Wermelinger. Conceptual graphs and first-order logic. In Proc. ICCS\u201995, LNCS 954, 1995."}],"container-title":["Lecture Notes in Computer Science","Conceptual Structures: Standards and Practices"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48659-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T02:32:09Z","timestamp":1550457129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48659-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662235","9783540486596"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48659-3_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}