Optimising Propositional Modal Satisfiability for Description Logic Subsumption
暂无分享,去创建一个
[1] Ullrich Hustadt,et al. On Evaluating Decision Procedures for Modal Logics , 1997 .
[2] Francesco M. Donini,et al. Exptime Tableaux for ALC , 2000, Description Logics.
[3] Jon W. Freeman. Hard Random 3-SAT Problems and the Davis-Putnam Procedure , 1996, Artif. Intell..
[4] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[5] Klaus Schild,et al. A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.
[6] A. B. Baker. Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results , 1995 .
[7] Franz Baader,et al. KRIS: Knowledge Representation and Inference System , 1991, SGAR.
[8] Peter F. Patel-Schneider,et al. System Description: DLP , 2000, CADE.
[9] Sergio Tessaris,et al. Implementing and Testing Expressive Description Logics: a Preliminary Report , 1995 .
[10] P.J.F. Lucas. Knowledge representation and inference in rule-based systems , 1986 .
[11] Peter Balsiger,et al. Comparison of Theorem Provers for Modal Logics - Introduction and Summary , 1998, TABLEAUX.
[12] Ullrich Hustadt,et al. On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.
[13] Ulrike Sattler,et al. A Concept Language Extended with Different Kinds of Transitive Roles , 1996, KI.
[14] Ian Horrocks,et al. Optimising Tableaux Decision Procedures For Description Logics , 1997 .
[15] Fausto Giunchiglia,et al. A SAT-based Decision Procedure for ALC , 1996, KR.
[16] Bernhard Nebel,et al. An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.