Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application

摘要

In this paper, we extend Simple Conceptual Graphs with Re-iter'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.