Compiling possibilistic knowledge bases

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 337-341

  Benferhat, Salem ^a   Prade, Henri ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING;

LITERALS; POLYNOMIAL-TIME; POSSIBILISTIC; POSSIBILISTIC LOGIC; PRIORITY LEVELS; PROPOSITIONAL FORMULAS; SIMPLE++; UNCERTAINTY;

POLYNOMIAL APPROXIMATION;

EID: 84886031495     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (9)

1. [Benferhat and Prade2005] S. Benferhat and H. Prade. Encoding formulas with partially constrained weights in possibilistic-like many-sorted propositional logic. In Proceedings of 19th International Joint Conference on Artificial Intelligence (IJCAI'05), pages 1281-1286, 2005.
2. [Benferhat et al.1999] Salem Benferhat, Didier Dubois, and Henri Prade. An overview of inconsistency-tolerant inferences in prioritized knowledge bases. In Fuzzy Sets, Logic and Reasoning about Knowledge. D. Dubois, H. Prade, E.P. Klement (Eds.), pages 395-417, 1999.
3. [Darwiche and Marquis2004] A. Darwiche and P. Marquis. Compiling propositional weighted bases. Artif. Intell., 157(1-2):81-113, 2004.
4. [Darwiche2004] A. Darwiche. New advances in compiling cnf into decomposable negation normal form. In Procs. of Europ. Conf. on Art. Intell. (ECAI2004), pages 328-332, 2004.
5. [de Kleer1986] Johan de Kleer. An assumption-based TMS and extending the ATMS. Artificial Intelligence, 28(2):127-162 and 163-196, 1986.
6. [Dubois et al.1994] D. Dubois, J. Lang, and H. Prade. Possibilistic logic. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 3, pages 439-513. Oxford University Press, 1994.
7. [Inoue1991] K. Inoue. onsequence-finding based on ordered linear resolution. In 12th Inter. JOint Conf. on artificial Intelligence (IJCAI'91), Sydney, pages 158-164, 1991.
8. [Lang et al.2003] J. Lang, P. Liberatore, and P. Marquis. Propositional independence - formula-variable independence and forgetting. J. of Art. Intell. Research, 18:391-443, 2003.
9. [Lang2000] Jérôme Lang. Possibilistic logic: complexity and algorithms. In D. M. Gabbay and P. Smets, editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, volume 5: Algorithms for Uncertainty and Defeasible Reasoning, pages 179-220. Kluwer Academic, Dordrecht, 2000.