Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
نویسندگان
چکیده
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.
منابع مشابه
Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
In this paper, we explore the expressivity of default CG rules (a CGoriented 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 th...
متن کاملAn Application of Genetic Network Programming Model for Pricing of Basket Default Swaps (BDS)
The credit derivatives market has experienced remarkable growth over the past decade. As such, there is a growing interest in tools for pricing of the most prominent credit derivative, the credit default swap (CDS). In this paper, we propose a heuristic algorithm for pricing of basket default swaps (BDS). For this purpose, genetic network programming (GNP), which is one of the recent evolutiona...
متن کاملDL-SR: a Lite DL with Expressive Rules: Preliminary Results
Simple conceptual graphs can be seen as a very basic description logic, allowing however for answering conjunctive queries. In the first part of this paper, we translate some results obtained for conceptual graph rules of form “if A then B” into an equivalent DL-based formalism. Then we show that, our algorithms can automatically decide in some cases whether a given DL has the FOL-reducibility ...
متن کاملModeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data described with conceptual graphs. The induction engine is based on a non-supervised algorithm named default clustering which uses the concept of stereotype and the new notion of default subsumption, the latter being inspir...
متن کاملRepresenting and Reasoning about Different Viewpoints: An Agronomy Application
Madalina Croitoru, Rallou Thomopoulos. Representing and reasoning about different viewpoints: an agronomy application. ICCS’2009: 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies, Jul 2009, Moscow, Russia. Springer, 17th International Conference on Conceptual Structures, ICCS 2009, Moscow, Russia, July 26-31, 2009, pp.128-140, 2009,...
متن کامل