A comparison of structural CSP decomposition methods
Artificial Intelligence
Sound and Complete Forward and backward Chainingd of Graph Rules
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
Representation of Defaults and Exceptions in Conceptual Graphs Formalism
ICCS '97 Proceedings of the Fifth International Conference on Conceptual Structures: Fulfilling Peirce's Dream
A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
The SG family: extensions of simple conceptual graphs
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Default conceptual graph rules, atomic negation and Tic-Tac-Toe
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Supporting argumentation systems by graph representation and computation
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Hi-index | 0.00 |
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.