Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe

Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented 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.

• Type: Journal
• Year: 2010
• Where: ICCS
• Authors: Jean-François Baget, Jérôme Fortin
• Keywords: Applied Computing, Atomic Negation, CG Rules, Default Cg Rules, ICCS 2010