Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application

  • Authors:
  • Jean-François Baget;Madalina Croitoru;Jérôme Fortin;Rallou Thomopoulos

  • Affiliations:
  • INRIA Sophia Antipolis, Sophia Antipolis, France 06902 and LIRMM (CNRS & Universitééé Montpellier II), Montpellier Cedex 5, France F---34392;LIRMM (CNRS & Universitééé Montpellier II), Montpellier Cedex 5, France F---34392;LIRMM (CNRS & Universitééé Montpellier II), Montpellier Cedex 5, France F---34392;INRA, UMR1208, Montpellier Cedex 1, France F---34060 and LIRMM (CNRS & Universitééé Montpellier II), Montpellier Cedex 5, France F---34392

  • Venue:
  • ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 $\mathcal{SREC}^-$, and provide the lacking semantics for the latter language.