{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:16:08Z","timestamp":1743221768520,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642294488"},{"type":"electronic","value":"9783642294495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29449-5_2","type":"book-chapter","created":{"date-parts":[[2012,5,26]],"date-time":"2012-05-26T09:08:46Z","timestamp":1338023326000},"page":"18-67","source":"Crossref","is-referenced-by-count":1,"title":["Boolean Formulas of Simple Conceptual Graphs ( $\\mathcal{SGBF}$ )"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carloni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Andr\u00e9ka, H., Nemeti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic\u00a027, 217\u2013274 (1998)","DOI":"10.1023\/A:1004275029985"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Molitor, R., Tobies, S.: The guarded fragment of conceptual graphs. Technical report, RWTH Aachen, LuFg Theoretische Informatik (1998)","DOI":"10.25368\/2022.86"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1613\/jair.918","volume":"16","author":"J.-F. Baget","year":"2002","unstructured":"Baget, J.-F., Mugnier, M.-L.: Extensions of Simple Conceptual Graphs: The Complexity of Rules and Constraints. JAIR\u00a016, 425\u2013465 (2002)","journal-title":"JAIR"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Carloni, O., Lecl\u00e8re, M., Mugnier, M.-L.: Introducing graph-based reasoning into an industrial knowledge management tool. Applied Intelligence (2007)","DOI":"10.1007\/11779568_64"},{"issue":"4","key":"2_CR5","first-page":"365","volume":"6","author":"M. Chein","year":"1992","unstructured":"Chein, M., Mugnier, M.-L.: Conceptual Graphs: Fundamental Notions. Revue d\u2019Intelligence Artificielle\u00a06(4), 365\u2013406 (1992)","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E. Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. Journal of Symbolic Logic\u00a064, 1719\u20131742 (1998)","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1147\/rd.204.0336","volume":"20","author":"J.F. Sowa","year":"1976","unstructured":"Sowa, J.F.: Conceptual Graphs for a Data Base Interface. IBM Journal of Research and Development\u00a020, 336\u2013357 (1976)","journal-title":"IBM Journal of Research and Development"},{"key":"2_CR8","unstructured":"Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley (1984)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.301.0057","volume":"30","author":"J.F. Sowa","year":"1986","unstructured":"Sowa, J.F., Way, E.C.: Implementing a Semantic Interpreter Using Conceptual Graphs. IBM Journal of Research and Development\u00a030, 57\u201369 (1986)","journal-title":"IBM Journal of Research and Development"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-61534-2_16","volume-title":"Conceptual Structures: Knowledge Representations as Interlingua","author":"E. Salvat","year":"1996","unstructured":"Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainingd of Graph Rules. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS, vol.\u00a01115, pp. 248\u2013262. Springer, Heidelberg (1996)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BF01459101","volume":"99","author":"P. Bernays","year":"1928","unstructured":"Bernays, P., Sch\u00f6nfinkel, M.: Zum Entscheidungsproblem der mathematischen Logik. Math. Annalen\u00a099, 342\u2013372 (1928)","journal-title":"Math. Annalen"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F. Ramsey","year":"1930","unstructured":"Ramsey, F.: On a problem of formal logic. Proc. of the London Math. Soc. 2nd Series\u00a030, 264\u2013286 (1930)","journal-title":"Proc. of the London Math. Soc. 2nd Series"},{"key":"2_CR13","unstructured":"Schulz, S.: A comparison of different techniques for grounding near propositional CNF formulae. In: FLAIRS 2002: Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference, pp. 72\u201376. AAAI Press (2002)"},{"key":"2_CR14","unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-style model finding. In: MODEL 2003: Proceedings of the Workshop on Model Computation (2003)"},{"key":"2_CR15","unstructured":"Fuchs, A.: Darwin: A theorem prover for the model evolution calculus. Master\u2019s thesis, University of Koblenz-Landau (2004)"},{"key":"2_CR16","unstructured":"Korovin, K.: Implementing an instantiation-based theorem prover for first-order logic. In: IWIL 2006: Proceedings of the 6th International Workshop on the Implementation of Logics (2006)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/10721959_16","volume-title":"Automated Deduction - CADE-17","author":"P. Baumgartner","year":"2000","unstructured":"Baumgartner, P.: FDPLL: A First-Order Davis Putnam Logeman Loveland Procedure. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 200\u2013219. Springer, Heidelberg (2000)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: LICS 2003: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, p. 55 (2003)","DOI":"10.1109\/LICS.2003.1210045"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1015854101244","volume":"28","author":"J. Hooker","year":"2002","unstructured":"Hooker, J., Rago, G., Chandru, V., Shrivastava, A.: Partial instantiation methods for inference in first order logic. Journal of Automated Reasoning\u00a028(3), 371\u2013396 (2002)","journal-title":"Journal of Automated Reasoning"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Baader, F., Horrocks, I., Sattler, U.: Description Logics. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation (2007)","DOI":"10.1016\/S1574-6526(07)03003-9"},{"key":"2_CR21","unstructured":"Lutz, C., Sattler, U., Tobies, S.: A Suggestion for an n-ary Description Logic. In: Proceedings of the 1999 International Workshop on Description Logics, DL 1999 (1999)"}],"container-title":["Lecture Notes in Computer Science","Graph Structures for Knowledge Representation and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29449-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:19:14Z","timestamp":1743200354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29449-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642294488","9783642294495"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29449-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}