Skip to Main content Skip to Navigation
Conference papers

Default conceptual graph rules, atomic negation and Tic-Tac-Toe

Jean-François Baget 1, 2 Jérôme Fortin 2
2 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
Contributor : Jean-François Baget <>
Submitted on : Thursday, November 18, 2010 - 11:54:22 AM
Last modification on : Thursday, June 4, 2020 - 3:48:03 AM
Document(s) archivé(s) le : Saturday, February 19, 2011 - 2:59:59 AM


Publisher files allowed on an open archive



Jean-François Baget, Jérôme Fortin. Default conceptual graph rules, atomic negation and Tic-Tac-Toe. ICCS: International Conference on Conceptual Structures, Jul 2010, Kuching, Sarawak, Malaysia. pp.42-55, ⟨10.1007/978-3-642-14197-3_8⟩. ⟨lirmm-00537338⟩



Record views


Files downloads