Abstract
This paper presents first results toward the extension of possibilistic logic when the total order on formulas is replaced by a partial preorder. Few works have dealt with this matter in the past but they include some by Halpern, and Benferhat et al. Here we focus on semantic aspects, namely the construction of a partial order on interpretations from a partial order on formulas and conversely. It requires the capability of inducing a partial order on subsets of a set from a partial order on its elements. The difficult point lies in the fact that equivalent definitions in the totally ordered case are no longer equivalent in the partially ordered one. We give arguments for selecting one approach extending comparative possibility and its preadditive refinement, pursuing some previous works by Halpern. It comes close to non-monotonic inference relations in the style of Kraus Lehmann and Magidor. We define an intuitively appealing notion of closure of a partially ordered belief base from a semantic standpoint, and show its limitations in terms of expressiveness, due to the fact that a partial ordering on subsets of a set cannot be expressed by means of a single partial order on the sets of elements. We also discuss several existing languages and syntactic inference techniques devised for reasoning from partially ordered belief bases in the light of this difficulty. The long term purpose is to find a proof method adapted to partially ordered formulas, liable of capturing a suitable notion of semantic closure.
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
Preview
Unable to display preview. Download preview PDF.
References
Rescher, N.: Plausible Reasoning. Van Gorcum, Amsterdam (1976)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D., Hogger, C., Robinson, J., Nute, D. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press (1994)
Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Bajcsy, R. (ed.) Proc. of the 13th IJCAI, pp. 640–645. Morgan-Kaufmann, Chambéry (1993)
Dubois, D., Prade, H.: Epistemic entrenchment and possibilistic logic. Artificial Intelligence 50, 223–239 (1991)
Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Logique possibiliste et fusion d’informations. Technique et Science Informatique 22, 1035–1064 (2003)
Dubois, D., Prade, H., Schockaert, S.: Régles et métarègles en théorie des possibilités. Revue d’Intelligence Artificielle 26, 773–793 (2012)
Benferhat, S., Prade, H.: Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 1281–1286. Professional Book Center (2005)
Halpern, J.Y.: Defining relative likelihood in partially-ordered preferential structures. Journal of Artificial intelligence Research 7, 1–24 (1997)
Lewis, D.: Counterfactuals and comparative possibility. Journal of Philosophical Logic 2, 418–446 (1973)
Dubois, D.: Belief structures, possibility theory and decomposable confidence measures on finite sets. Computers and Artificial Intelligence (Bratislava) 5, 403–416 (1986)
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)
Fishburn, P.: Interval Orderings. Wiley, New-York (1987)
Benferhat, S., Dubois, D., Prade, H.: Towards a possibilistic logic handling of preferences. Appl. Intell. 14, 303–317 (2001)
Kaci, S., van der Torre, L.: Reasoning with various kinds of preferences: Logic, non-monotonicity and algorithms. Annals of Operations Research 163, 89–114 (2008)
Kaci, S.: Working With Preferences: Less Is More. Springer (2012)
Fishburn, P.C.: The axioms of subjective probability. Statistical Science 1, 335–358 (1986)
Dubois, D., Fargier, H., Prade, H.: Possibilistic likelihood relations. In: Proceedings of 7th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU 1998), Paris, Editions EDK, pp. 1196–1202 (1998)
Friedman, N., Halpern, J.Y.: Plausibility measures: A user’s guide. In: Proc. of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, Montreal, Quebec, August 18-20, pp. 175–184 (1995)
Dubois, D., Prade, H.: Numerical representations of acceptance. In: Proc. of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, Montreal, Quebec, August 18-20, pp. 149–156 (1995)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44, 167–207 (1990)
Dubois, D., Fargier, H., Prade, H.: Ordinal and probabilistic representations of acceptance. J. Artif. Intell. Res. (JAIR) 22, 23–56 (2004)
Benferhat, S., Lagrue, S., Papini, O.: Reasoning with partially ordered information in a possibilistic logic framework. Fuzzy Sets and Systems 144, 25–41 (2004)
Cayrol, C., Royer, V., Saurel, C.: Management of preferences in assumption-based reasoning. In: Bouchon-Meunier, B., Valverde, L., Yager, R.R. (eds.) IPMU 1992. LNCS, vol. 682, pp. 13–22. Springer, Heidelberg (1993)
Geffner, H.: Default reasoning: Causal and Conditional Theories. MIT Press (1992)
Yahi, S., Benferhat, S., Lagrue, S., Sérayet, M., Papini, O.: A lexicographic inference for partially preordered belief bases. In: Brewka, G., Lang, J. (eds.) KR, pp. 507–517. AAAI Press (2008)
Pearl, J.: System Z: A natural ordering of defaults with tractable applications to default reasoning. In: Vardi, M. (ed.) Proc. of the 3rd Conference of Theoretical Aspects of Reasoning about Knowledge, pp. 121–135. Morgan-Kaufmann (1990)
Hájek, P.: The Metamathematics of Fuzzy Logics. Kluwer Academic (1998)
Benferhat, S., Yahi, S.: Etude comparative des relations d’inférence à partir de bases de croyance partiellement ordonnées. Revue d’Intelligence Artificielle 26, 39–61 (2012)
Dubois, D., Prade, H., Touazi, F.: Conditional preference nets and possibilistic logic. In: van der Gaag, L.C. (ed.) ECSQARU 2013. LNCS (LNAI), vol. 7958, pp. 181–193. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cayrol, C., Dubois, D., Touazi, F. (2014). On the Semantics of Partially Ordered Bases. In: Beierle, C., Meghini, C. (eds) Foundations of Information and Knowledge Systems. FoIKS 2014. Lecture Notes in Computer Science, vol 8367. Springer, Cham. https://doi.org/10.1007/978-3-319-04939-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-04939-7_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04938-0
Online ISBN: 978-3-319-04939-7
eBook Packages: Computer ScienceComputer Science (R0)