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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abécassis, J.: Qualité du blé dur de la semoule et des pâtes alimentaires, 7–11 (1991)
Faron, C., Ganascia, J.: Representation of defaults and exceptions in conceptual graphs formalism. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS 1997. LNCS, vol. 1257, pp. 153–167. Springer, Heidelberg (1997)
Baget, J.F., Mugnier, M.L.: Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints. Jour. of Artificial Intelligence Research 16, 425–465 (2002)
Baget, J.F., Mugnier, M.L.: The sg family: Extensions of simple conceptual graphs. In: Proc of Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, pp. 205–212. Morgan Kaufmann, San Francisco (2001)
Baget, J.F.: Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS, vol. 2746, pp. 229–242. Springer, Heidelberg (2003)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artificial Intelligence 124 (2000)
Salvat, E., Mugnier, M.L.: Sound and complete forward and backward chainingd of graph rules. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS, vol. 1115. Springer, Heidelberg (1996)
Baget, J.F.: Improving the forward chaining algorithm for conceptual graphs rules. In: Proceedings of the Ninth International Conference (KR 2004), Whistler, Canada, pp. 407–414. AAAI, Menlo Park (2004)
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)
Brewka, G., Eiter, T.: Prioritizing default logic: Abridged report. In: Festschrift on the occasion of Prof. Dr. W. Bibel’s 60th birthday, Kluwer, Dordrecht (1999)
Baget, J.F.: A datatype extension for simple conceptual graphs and conceptual graphs rules. In: Proc of ICCS 2007: Conceptual Structures: Knowledge Architectures for Smart Applications. LNCS, vol. 4604, pp. 83–96. Springer, Heidelberg (2007)
Baget, J.F., Leclère, M., Mugnier, M.L., Salvat, E.: Extending decidable cases for rules with existential variables. IJCAI 2009 (submitted, 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baget, JF., Croitoru, M., Fortin, J., Thomopoulos, R. (2009). Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds) Conceptual Structures: Leveraging Semantic Technologies. ICCS 2009. Lecture Notes in Computer Science(), vol 5662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03079-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-03079-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03078-9
Online ISBN: 978-3-642-03079-6
eBook Packages: Computer ScienceComputer Science (R0)