Prime implicate normal form for ALC concepts

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 412-417

  Bienvenu, Meghyn ^a  

^a UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; POLYNOMIAL APPROXIMATION;

DESCRIPTION LOGICS; DESIRABLE PROPERTIES; KNOWLEDGE COMPILATIONS; MODAL LOGICS; NORMAL FORMS; POLYNOMIAL TIMES; SPATIAL COMPLEXITIES;

DATA DESCRIPTION;

EID: 57749187082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bienvenu, M. 2007a. Prime implicates and prime implicants in modal logic. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07), 397-384. AAAI Press.
2. Bienvenu, M. 2007b. Prime implicates and prime implicants in modal logic: Extended and revised version. Technical Report RR-2007-17-FR, IRIT, Université Paul Sabatier. Available at http://www.irit.fr/̃Meghyn. Bienvenu/papers/BienvenuRR-2007-17.pdf.
3. Bienvenu, M. 2008. Prime implicate normal form for ALC concepts: Long version. Technical Report RR-2008-6-FR, IRIT, Université Paul Sabatier. Available at http://www.irit.fr/̃Meghyn.Bienvenu/papers/ BienvenuRR-2008-6.pdf.
4. Chandra, A., and Markowsky, G. 1978. On the number of prime implicants. Discrete Mathematics 24:7-11.
5. Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. Journal of Artificial Intelligence Research 17:229-264.
6. Donini, F. M.; Hollunder, B.; Lenzerini, M.; Marchetti Spaccamela, A.; Nardi, D.; and Nutt, W. 1992. The complexity of existential qualification in concept languages. Artificial Intelligence 53:309-327.
7. Furbach, U., and Obermaier, C. 2007. Knowledge compilation for description logics. In Proceedings of the 3rd Workshop on Knowledge Engineering and Software Engineering (KESE).
8. Janin, D., and Walukiewicz, I. 1995. Automata for the modal mu-calculus and related results. In Proceedings of the Twentieth International Symposium on the Mathematical Foundations of Computer Science (MFCS'95), volume 969 of Lecture Notes in Computer Science, 552-562. Springer.
9. Lang, J.; Liberatore, P.; and Marquis, P. 2003. Prepositional independence: Formula-variable independence and forgetting. Journal of Artificial Intelligence Research 18:391-443.
10. Murray, N., and Rosenthal, E. 1993. Dissolution: Making paths vanish. Journal of the ACM 40(3):504-535.
11. Schild, K. 1991. A correspondence theory for terminological logics: preliminary report. In Proceedings of the Twelth International Joint Conference on Artificial Intelligence (IJCAI'9I), 466-471. Morgan Kaufmann.
12. ten Cate, B.; Conradie, W.; Marx, M.; and Venema, Y. 2006. Definitorially complete description logics. In Proceedings of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR06), 79-89. AAAI Press.