Expressiveness Revisited
暂无分享,去创建一个
[1] Hector J. Levesque,et al. The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.
[2] Editors , 1986, Brain Research Bulletin.
[3] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[4] Igor Walukiewicz,et al. On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.
[5] M. de Rijke,et al. Expressiveness of First-Order Description Logics , 1997 .
[6] Alexander Borgida,et al. On the Relative Expressiveness of Description Logics and Predicate Logics , 1996, Artif. Intell..
[7] Klaus Schild,et al. A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.
[8] Franz Baader,et al. A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages , 1996, J. Log. Comput..
[9] Jörg Flum,et al. Mathematical logic , 1985, Undergraduate texts in mathematics.
[10] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[11] Gert Smolka,et al. Attributive Concept Descriptions with Complements , 1991, Artif. Intell..
[12] A. N. Prior,et al. Equational logic , 1968, Notre Dame J. Formal Log..
[13] Maurizio Lenzerini,et al. Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.
[14] N. Immerman,et al. Definability with Bounded Number of Bound Variables , 1989, Inf. Comput..
[15] Dov M. Gabbay,et al. EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .
[16] Maarten de Rijke,et al. Counting Objects , 1995, J. Log. Comput..
[17] Ronald J. Brachman,et al. An overview of the KL-ONE Knowledge Representation System , 1985 .
[18] Maarten de Rijke,et al. Classifying Description Logics , 1997, Description Logics.
[19] Bernhard Nebel,et al. Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.