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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Baget, J. F., & Fortin, J. (2010). Default conceptual graph rules, atomic negation and tic-tac-toe. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6208 LNAI, pp. 42–55). https://doi.org/10.1007/978-3-642-14197-3_8
Mendeley helps you to discover research relevant for your work.