Abstract
Conditionals of the form “If A, then usually B” are often used to define nonmonotonic inference relations. Many ways have been proposed to inductively complete a knowledge base consisting of a finite set of conditionals to a complete inference relation. Implementations of these semantics are usually used to answer specific queries on demand. However, for some applications it is necessary or advantageous to compute the closure of the inference relation induced by a knowledge base. In this paper, we propose an approach to computing complete inference relations using implementations of inference systems for single queries. Our approach exploits special characteristics of conditionals and inference properties like Right Weakening in order to reduce the amount of costly query answering to a minimum.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beierle, C., Eichhorn, C., Kern-Isberner, G., Kutsch, S.: Skeptical, weakly skeptical, and credulous inference based on preferred ranking functions. In: Kaminka, G.A. (eds.) Proceedings 22nd European Conference on Artificial Intelligence, ECAI-2016. Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 1149–1157. IOS Press (2016)
Beierle, C., Eichhorn, C., Kern-Isberner, G., Kutsch, S.: Properties of skeptical C-inference for conditional knowledge bases and its realization as a constraint satisfaction problem. Annal. Math. Artif. Intell. 83(3–4), 247–275 (2018)
Beierle, C., Eichhorn, C., Kutsch, S.: A practical comparison of qualitative inferences with preferred ranking models. KI - Künstliche Intelligenz 31(1), 41–52 (2017)
Beierle, C., Kutsch, S., Sauerwald, K.: Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations. Annal. Math. Artif. Intell. (2019, to appear)
Beierle, C., Kutsch, S.: Computation and comparison of nonmonotonic skeptical inference relations induced by sets of ranking models for the realization of intelligent agents. Appl. Intell. 49(1), 28–43 (2019). https://doi.org/10.1007/s10489-018-1203-5
Beierle, C., Kutsch, S.: Systematic generation of conditional knowledge bases up to renaming and equivalence. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 279–286. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_18
Beierle, C., Kutsch, S., Sauerwald, K.: Compilation of conditional knowledge bases for computing C-inference relations. In: Ferrarotti, F., Woltran, S. (eds.) FoIKS 2018. LNCS, vol. 10833, pp. 34–54. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-90050-6_3
Benferhat, S., Dubois, D., Prade, H.: Possibilistic and standard probabilistic semantics of conditional knowledge bases. J. Logic Comput. 9(6), 873–895 (1999)
Dubois, D., Prade, H.: Conditional objects as nonmonotonic consequence relationships. IEEE Trans. Syst. Man Cybern. 24(12), 1724–1740 (1994). Special Issue on Conditional Event Algebra
de Finetti, B.: La prévision, ses lois logiques et ses sources subjectives. Ann. Inst. H. Poincaré 7(1), 1–68 (1937). English translation. Kyburg, H., Smokler, H.E. (eds.) Studies in Subjective Probability, pp. 93–158. Wiley, New York (1974)
Ganzinger, H.: Saturation-based theorem proving (abstract). In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 1–3. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61440-0_113
Goldszmidt, M., Pearl, J.: Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artif. Intell. 84(1–2), 57–112 (1996)
Kern-Isberner, G.: Conditionals in Nonmonotonic Reasoning and Belief Revision. LNCS (LNAI), vol. 2087. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44600-1
Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55, 1–60 (1992)
Lewis, D.: Counterfactuals. Harvard University Press, Cambridge (1973)
Pearl, J.: System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning About Knowledge (TARK 1990), pp. 121–135. Morgan Kaufmann Publ. Inc., San Francisco, CA, USA (1990)
Spohn, W.: Ordinal conditional functions: a dynamic theory of epistemic states. In: Harper, W., Skyrms, B. (eds.) Causation in Decision, Belief Change, and Statistics, II, pp. 105–134. Kluwer Academic Publishers, Dordrecht (1988)
Spohn, W.: The Laws of Belief: Ranking Theory and Its Philosophical Applications. Oxford University Press, Oxford (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kutsch, S., Beierle, C. (2019). Computation of Closures of Nonmonotonic Inference Relations Induced by Conditional Knowledge Bases. In: Kern-Isberner, G., Ognjanović, Z. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2019. Lecture Notes in Computer Science(), vol 11726. Springer, Cham. https://doi.org/10.1007/978-3-030-29765-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-29765-7_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29764-0
Online ISBN: 978-3-030-29765-7
eBook Packages: Computer ScienceComputer Science (R0)