Abstract
This paper introduces a novel extension to the object-oriented RETE algorithm, designed to create networks whose behaviour can be configured by plugging different modules in. The main feature is the possibility of asserting not just new objects as facts, but also information on how the facts satisfy the different constraints in the network. The underlying reasoning process has been created to process imperfect information, for example fuzzy or probabilistic, but the same framework can easily be adapted to reason with defeasible rules, both boolean and imperfect, by choosing the configuration modules appropriately.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Embedding defeasible logic into logic programming. TPLP 6(6), 703–735 (2006)
Bamber, D., Goodman, I.R., Nguyen, H.T.: Robust reasoning with rules that have exceptions. Ann. Math. Artif. Intell. 45(1-2), 83–171 (2005)
Boley, H.: Object-oriented ruleml: User-level roles, uri-grounded clauses, and order-sorted terms. In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 1–16. Springer, Heidelberg (2003)
Damásio, C.V., Pan, J.Z., Stoilos, G., Straccia, U.: Representing uncertainty in ruleml. Fundam. Inf. 82(3), 265–288 (2008)
Dubois, D., Prade, H.: Possibilistic logic
Forgy, C.: Rete: A fast algorithm for the many patterns/many objects match problem. Artif. Intell. 19(1), 17–37 (1982)
Maher, M.J.: Propositional defeasible logic has linear complexity. In: Logic Programming, pp. 691–711 (2001)
Nute, D.: Defeasible logic. In: INAP, pp. 87–114 (2001)
Paschke, A., Kozlenkov, A., Boley, H.: A homogenous reaction rules language for complex event processing. In: International Workshop on Event Drive Architecture for Complex Event Process (2007)
Pollock, J.L.: Defeasible reasoning with variable degrees of justification. Artificial Intelligence 133(1-2), 233–282 (2001)
Reiter, R.: A logic for default reasoning. AI 13 (April 1980)
Smets, P.: Imperfect Information: Imprecision and Uncertainty, vol. 225, p. 254 (1996)
Sottara, D., Mello, P., Proctor, M.: Adding uncertainty to a rete-OO inference engine. In: Bassiliades, N., Governatori, G., Paschke, A. (eds.) RuleML 2008. LNCS, vol. 5321, pp. 104–118. Springer, Heidelberg (2008)
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
Sottara, D., Mello, P., Proctor, M. (2009). Towards Modelling Defeasible Reasoning with Imperfection in Production Rule Systems. In: Governatori, G., Hall, J., Paschke, A. (eds) Rule Interchange and Applications. RuleML 2009. Lecture Notes in Computer Science, vol 5858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04985-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-04985-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04984-2
Online ISBN: 978-3-642-04985-9
eBook Packages: Computer ScienceComputer Science (R0)