Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application

Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronomy application, namely the simulation of food processing. Our contribution is many fold: first, the expressivity of this new language corresponds to our modeling purposes. Second, we provide an effective characterization of sound and complete reasonings in this language. Third, we identify a decidable subclass of Reiter’s default logics. Last we identify our language as a superset of SREC− , and provide the lacking semantics for the latter language.

• Type: Conference
• Year: 2009
• Where: ICCS
• Authors: Jean-François Baget, Madalina Croitoru, Jérôme Fortin, Rallou Thomopoulos
• Keywords: Applied Computing, ICCS 2009, Reiter’s Default, Reiter’s Default Rules, Simple Conceptual Graphs