Default conceptual graph rules, atomic negation and Tic-Tac-Toe - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

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

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.
Fichier principal
Vignette du fichier
tictactoe.pdf (530.12 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-00537338 , version 1 (18-11-2010)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More