Abstract
This paper sheds light on the lexicographic inference from stratified belief bases which is known to have desirable properties from theoretical, practical and psychological points of view. However, this inference is expensive from the computational complexity side. Indeed, it amounts to a \(\Delta_2^p\)-complete problem. In order to tackle this hardness, we propose in this work a new compilation of the lexicographic inference using the so-called Boolean cardinality constraints. This compilation enables a polynomial time lexicographic inference and offers the possibility to update the priority relation between the strata without any re-compilation. Moreover, it can be efficiently extended to deal with the lexicographical closure inference which takes an important place in default reasoning. Furthermore, unlike the existing compilation approaches of the lexicographic inference, ours can be efficiently parametrized by any target compilation language. In particular, it enables to take advantage of the well-known prime implicates language which has been quite influential in artificial intelligence and computer science in general.
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
Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108–122. Springer, Heidelberg (2003)
Benferhat, S., Dubois, D., Cayrol, C., Lang, J., Prade, H.: Inconsistency management and prioritized syntaxbased entailment. In: IJCAI 1993, pp. 640–645 (1993)
Benferhat, S., Kaci, S., Le Berre, D., Williams, M.A.: Weakening conflicting information for iterated revision and knowledge integration. In: IJCAI 2001(2001)
Benferhat, S., Bonnefon, J.-F., Neves, R.D.S.: An experimental analysis of possibilistic default reasoning. In: KR 2004, pp. 130–140 (2004)
Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: Proceedings of IJCAI 1989, pp. 1043–1048 (1989)
Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Communications 10, 137–150 (1997)
Cayrol, C., Lagasquie-Schiex, M.C., Schiex, T.: Nonmonotonic reasoning: From complexity to algorithms. Ann. Math. Artif. Intell. 22(3-4), 207–236 (1998)
Coste-Marquis, S., Marquis, P.: On stratified belief base compilation. Annals of Mathematics and Artificial Intelligence 42(4), 399–442 (2004)
Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research 17, 229–264 (2002)
Darwiche, A., Marquis, P.: Compiling propositional weighted bases. Artificial Intelligence 157(1–2), 81–113 (2004)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. Handbook of Logic in Articial Intelligence and Logic Programming 3, 439–513 (1994)
Lagasquie-Schiex, M.C.: Contribution à l’étude des relations d’inférence non-monotone combinant inférence classique et préférences. Phd Thesis (1995)
Lehmann, D.: Belief revision revisited. In: Proceedings of IJCAI 1995, pp. 1534–1539 (1995)
Lehmann, D.J.: Another perspective on default reasoning. Annals of Mathematics and Artificial Intelligence 15(1), 61–82 (1995)
Nebel, B.: Base revision operations and schemes: semantics, representation and complexity. In: Proceedings of ECAI 1994, pp. 341–345 (1994)
Pearl, J.: System Z: A natural ordering of defaults with tractable applications to default reasoning. In: Proceedings of TARK 1990, pp. 121–135 (1990)
Rescher, N., Manor, R.: On inference from inconsistent premises. Theory and Decision 1, 179–217 (1970)
Selman, B., Kautz, H.: Knowledge compilation and theory approximation. Journal of the ACM 43(2), 193–224 (1996)
Sinz, C.: Towards an optimal cnf encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827–831. Springer, Heidelberg (2005)
Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68(2), 63–69 (1998)
Würbel, E., Jeansoulin, R., Papini, O.: Revision: an application in the framework of GIS. In: KR 2000, pp. 505–515 (2000)
Yahi, S., Benferhat, S., Lagrue, S., Sérayet, M., Papini, O.: A lexicographic inference for partially preordered belief bases. In: KR 2008, pp. 507–517 (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
Yahi, S., Benferhat, S. (2009). Compiling the Lexicographic Inference Using Boolean Cardinality Constraints. In: Gao, Y., Japkowicz, N. (eds) Advances in Artificial Intelligence. Canadian AI 2009. Lecture Notes in Computer Science(), vol 5549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01818-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-01818-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01817-6
Online ISBN: 978-3-642-01818-3
eBook Packages: Computer ScienceComputer Science (R0)