Skip to main content
Log in

A Practical Comparison of Qualitative Inferences with Preferred Ranking Models

  • Technical Contribution
  • Published:
KI - Künstliche Intelligenz Aims and scope Submit manuscript

Abstract

When reasoning qualitatively from a conditional knowledge base, two established approaches are system Z and p-entailment. The latter infers skeptically over all ranking models of the knowledge base, while system Z uses the unique pareto-minimal ranking model for the inference relations. Between these two extremes of using all or just one ranking model, the approach of c-representations generates a subset of all ranking models with certain constraints. Recent work shows that skeptical inference over all c-representations of a knowledge base includes and extends p-entailment. In this paper, we follow the idea of using preferred models of the knowledge base instead of the set of all models as a base for the inference relation. We employ different minimality constraints for c-representations and demonstrate inference relations from sets of preferred c-representations with respect to these constraints. We present a practical tool for automatic c-inference that is based on a high-level, declarative constraint-logic programming approach. Using our implementation, we illustrate that different minimality constraints lead to inference relations that differ mutually as well as from system Z and p-entailment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. http://www.sics.se/isl/sicstuswww/site/index.html.

  2. https://www.fernuni-hagen.de/wbs/research/log4kr/index.html.

References

  1. Adams E (1965) The logic of conditionals. Inquiry 8(1–4):166–197

    Article  Google Scholar 

  2. Beierle C, Eichhorn C, Kern-Isberner G (2016) Skeptical inference based on c-representations and its characterization as a constraint satisfaction problem. In: Gyssens M, Simari GR (eds) Proceedings of 9th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2016, Linz, Austria, March 7–11, 2016. LNCS, vol 9616. Springer, New York, pp 65–82

  3. Beierle C, Hermsen R, Kern-Isberner G (2014) Observations on the minimality of ranking functions for qualitative conditional knowledge bases and their computation. In: Proceedings of the 27th International FLAIRS Conference, FLAIRS-2014. AAAI Press, Menlo Park, CA, pp 480–485

  4. Beierle C, Kern-Isberner G, Södler K (2013) A declarative approach for computing ordinal conditional functions using constraint logic programming. In: 19th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Wien, Austria, revised selected papers. LNAI, vol 7773. Springer, New York, pp 175–192

  5. Benferhat S, Cayrol C, Dubois D, Lang J, Prade H (1993) Inconsistency management and prioritized syntax-based entailment. In: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI’93), vol 1. Morgan Kaufmann Publishers, San Francisco, pp 640–647

  6. Benferhat S, Dubois D, Prade H (1992) Representing default rules in possibilistic logic. In: Proceedings 3rd International Conference on Principles of Knowledge Representation and Reasoning KR’92, pp 673–684

  7. DeFinetti B (1974) Theory of probability, vol 1, 2. John Wiley & Sons, New York

  8. Dubois D, Prade H (2015) Possibility theory and its applications: where do we stand? In: Kacprzyk J, Pedrycz W (eds) Springer handbook of computational intelligence. Springer, Berlin, pp 31–60

    Chapter  Google Scholar 

  9. Goldszmidt M, Pearl J (1991) On the consistency of defeasible databases. Artif Intell 52(2):121–149

    Article  MathSciNet  MATH  Google Scholar 

  10. Goldszmidt M, Pearl J (1996) Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artif Intell 84:57–112

    Article  MathSciNet  Google Scholar 

  11. Halpern J (2005) Reasoning about uncertainty. MIT Press, Cambridge

    MATH  Google Scholar 

  12. Kern-Isberner G (2001) Conditionals in nonmonotonic reasoning and belief revision. LNAI, vol 2087. Springer, New York

  13. Kern-Isberner G (2002) Handling conditionals adequately in uncertain reasoning and belief revision. J Appl Non Class Log 12(2):215–237

    Article  MathSciNet  MATH  Google Scholar 

  14. Kern-Isberner G, Eichhorn C (2014) Structural inference from conditional knowledge bases. In: Unterhuber M, Schurz G (eds) Logic and probability: reasoning in uncertain environments. Studia logica, vol, 102, no 4. Springer Science+Business Media, Dordrecht, pp 751–769

  15. Kraus S, Lehmann DJ, Magidor M (1990) Nonmonotonic reasoning, preferential models and cumulative logics. Artif Intell 44(1–2):167–207

    Article  MathSciNet  MATH  Google Scholar 

  16. Lehmann D (1995) Another perspective on default reasoning. Ann Math Artif Intell 15(1):61–82

    Article  MathSciNet  MATH  Google Scholar 

  17. Lehmann DJ, Magidor M (1992) What does a conditional knowledge base entail? Artif Intell 55(1):1–60

    Article  MathSciNet  MATH  Google Scholar 

  18. Makinson D (1994) General patterns in nonmonotonic reasoning. In: Gabbay DM, Hogger CJ, Robinson JA (eds) Handbook of logic in artificial intelligence and logic programming, vol 3. Oxford University Press, New York, pp 35–110

    Google Scholar 

  19. Carlsson M, Ottosson G, Carlson B (1997) An open-ended finite domain constraint solver. In: Glaser H, Hartel PH, Kuchen H (eds) Programming languages: implementations, logics, and programs, (PLILP’97). LNCS, vol 1292. Springer, New York, pp 191–206

    Chapter  Google Scholar 

  20. Pearl J (1988) Probabilistic reasoning in intelligent systems. Morgan Kaufmann Publishers Inc., San Francisco

    MATH  Google Scholar 

  21. Pearl J (1990) System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Parikh R (ed) Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge (TARK1990). Morgan Kaufmann Publishers Inc, San Francisco, pp 121–135

    Google Scholar 

  22. Spohn W (1988) Ordinal conditional functions: a dynamic theory of epistemic states. In: Harper W, Skyrms B (eds) Causation in decision, belief change and statistics: Proceedings of the Irvine conference on probability and causation. The Western Ontario Series in Philosophy of Science, vol 42. Springer Science+Business Media, Dordrecht, pp 105–134

    Chapter  Google Scholar 

  23. Spohn W (2012) The laws of belief: ranking theory and its philosophical applications. Oxford University Press, Oxford

    Book  Google Scholar 

  24. Thorn PD, Eichhorn C, Kern-Isberner G, Schurz G (2015) Qualitative probabilistic inference with default inheritance for exceptional subclasses. In: Beierle C, Kern-Isberner G, Ragni M, Stolzenburg F (eds) Proceedings of the 5th Workshop on Dynamics of Knowledge and Belief (DKB-2015) and the 4th Workshop KI and Kognition (KIK-2015). CEUR Workshop Proceedings, vol 1444

Download references

Acknowledgements

We are grateful to all our students who have been involved in the implementation of the software systems described here, in particular to Karl Södler, Martin Austen, and Fadil Kallat. We also thank the anonymous reviewers of this article for their detailed and helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christoph Beierle.

Additional information

Christian Eichhorn is supported by DFG-Grant KI1413/5-1 of Prof. Dr. Gabriele Kern-Isberner as part of the priority program “New Frameworks of Rationality” (SPP 1516).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Beierle, C., Eichhorn, C. & Kutsch, S. A Practical Comparison of Qualitative Inferences with Preferred Ranking Models. Künstl Intell 31, 41–52 (2017). https://doi.org/10.1007/s13218-016-0453-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-016-0453-9

Keywords

Navigation