Abstract
In this paper, we explore the expressivity of default CG rules (a CG-oriented subset of Reiter’s default logics) through two applications. In the first one, we show that default CG rules provide a unifying framework for CG rules as well as polarized CGs (CGs with atomic negation). This framework allows us to study decidable subclasses of a new language mixing CG rules with atomic negation. In the second application, we use default CG rules as a formalism to model a game, an application seldom explored by the CG community. This model puts into light the conciseness provided by defaults, as well as the possibilities they offer to achieve efficient reasonings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baget, J., Croitoru, M., Fortin, J., Thomopoulos, R.: Default conceptual graph rules: preliminary results for an agronomy application. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) Conceptual Structures: Leveraging Semantic Technologies. LNCS (LNAI), vol. 5662, pp. 86–99. Springer, Heidelberg (2009)
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)
Baget, J.F., Leclère, M., Mugnier, M.L., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, pp. 677–682 (2009)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 77–86 (2009)
Sowa, J.F.: Conceptual graphs for a database interface. IBM Journal of Research and Development 20, 336–357 (1976)
Salvat, E., Mugnier, M.L.: Sound and complete forward and backward chaining of graph rules. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS, vol. 1115, pp. 248–262. Springer, Heidelberg (1996)
Kerdiles, G.: Saying It with Pictures: a logical landscape of conceptual graphs. PhD thesis, Univ. Amsterdam (2001)
Tepfenhart, W., Cyre, W.: Proceedings of the 7th International Conference on Conceptual Structures, ICCS 1999, Blacksburg, VA, USA, July 12-15. Springer, Heidelberg (1999)
Baget, J.F.: Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS (LNAI), vol. 2746, pp. 229–242. Springer, Heidelberg (2003)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artificial Intelligence 124 (2000)
Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison Wesley, Reading (1984)
Brewka, G., Eiter, T.: Prioritizing default logic: Abridged report. In: Festschrift on the occasion of Prof.Dr. W. Bibel’s 60th birthday. Kluwer, Dordrecht (1999)
Mugnier, M., Leclere, M.: On querying simple conceptual graphs with negation. Data & Knowledge Engineering 60(3), 468–493 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baget, JF., Fortin, J. (2010). Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe. In: Croitoru, M., Ferré, S., Lukose, D. (eds) Conceptual Structures: From Information to Intelligence. ICCS 2010. Lecture Notes in Computer Science(), vol 6208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14197-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14197-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14196-6
Online ISBN: 978-3-642-14197-3
eBook Packages: Computer ScienceComputer Science (R0)