On the Expressiveness of Levesque's Normal Form
暂无分享,去创建一个
[1] Diego Calvanese,et al. Data Complexity of Query Answering in Description Logics , 2006, Description Logics.
[2] Gerhard Lakemeyer. Evaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases , 2002, KR.
[3] Bart Selman,et al. Knowledge compilation and theory approximation , 1996, JACM.
[4] Pierre Marquis,et al. A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..
[5] Gerhard Lakemeyer,et al. A Logic of Limited Belief for Reasoning with Disjunctive Information , 2004, KR.
[6] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[7] Ravi B. Boppana,et al. The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[8] George Markowsky,et al. On the number of prime implicants , 1978, Discret. Math..
[9] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.
[10] Hector J. Levesque. A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases , 1998, KR.