Coalgebraic Hybrid Logic
暂无分享,去创建一个
[1] Ian Horrocks,et al. FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.
[2] Dirk Pattinson,et al. CoLoSS: The Coalgebraic Logic Satisfiability Solver , 2009, M4M.
[3] Helmut Schwichtenberg,et al. Basic proof theory , 1996, Cambridge tracts in theoretical computer science.
[4] Miroslava Tzakova,et al. Tableau Calculi for Hybrid Logics , 1999, TABLEAUX.
[5] Volker Haarslev,et al. Extended Query Facilities for Racer and an Application to Software-Engineering Problems , 2004, Description Logics.
[6] Jerry Seligman. Internalization: The Case of Hybrid Logics , 2001, J. Log. Comput..
[7] Torben Braüner,et al. Tableau-based Decision Procedures for Hybrid Logic , 2006, J. Log. Comput..
[8] Torben Bra. Natural Deduction for First-Order Hybrid Logic , 2005 .
[9] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[10] Yarden Katz,et al. Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..
[11] Ronald Fagin,et al. Reasoning about knowledge and probability , 1988, JACM.
[12] Stéphane Demri,et al. Presburger Modal Logic Is PSPACE-Complete , 2006, IJCAR.
[13] Patrick Blackburn,et al. Termination for Hybrid Tableaus , 2007, J. Log. Comput..
[14] Dirk Pattinson,et al. CoLoSS : The Coalgebraic Logic Satisfiability Solver ( System Description ) , 2008 .
[15] M. de Rijke,et al. Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.
[16] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[17] Maarten Marx,et al. Tableaux for Quantified Hybrid Logic , 2002, TABLEAUX.
[18] Balder ten Cate,et al. Hybrid logics , 2007, Handbook of Modal Logic.
[19] Dirk Pattinson,et al. Admissibility of Cut in Coalgebraic Logics , 2008, CMCS.
[20] Dirk Pattinson,et al. PSPACE Bounds for Rank-1 Modal Logics , 2006, LICS.
[21] Marc Pauly,et al. A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..
[22] Maarten Marx,et al. A Road-Map on Complexity for Hybrid Logics , 1999, CSL.
[23] Dirk Pattinson,et al. Shallow Models for Non-iterative Modal Logics , 2008, KI.
[24] Frank Bomarius,et al. KI 2008: Advances in Artificial Intelligence, 31st Annual German Conference on AI, KI 2008, Kaiserslautern, Germany, September 23-26, 2008. Proceedings , 2008, KI.
[25] Christos H. Papadimitriou,et al. On the complexity of integer programming , 1981, JACM.
[26] Balder ten Cate,et al. Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators , 2006, J. Log. Comput..
[27] B. T. Cate,et al. Model theory for extended modal languages , 2005 .
[28] Frank Wolter,et al. Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.
[29] Richard Spencer-Smith,et al. Modal Logic , 2007 .
[30] Dirk Pattinson,et al. Cut elimination in coalgebraic logics , 2010, Inf. Comput..
[31] Lutz Schröder. A Finite Model Construction for Coalgebraic Modal Logic , 2006, FoSSaCS.
[32] Larry Wos,et al. What Is Automated Reasoning? , 1987, J. Autom. Reason..
[33] Kit Fine,et al. In so many possible worlds , 1972, Notre Dame J. Formal Log..
[34] Timothy J. Long,et al. Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..
[35] E. Mares. Relevant Logic: A Philosophical Interpretation , 2004 .
[36] Diego Calvanese,et al. The Description Logic Handbook , 2007 .
[37] Albert Visser,et al. Finality regained: A coalgebraic study of Scott-sets and multisets , 1999, Arch. Math. Log..
[38] Roy Dyckhoff. Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.
[39] Aviad Heifetz,et al. Probability Logic for Type Spaces , 2001, Games Econ. Behav..
[40] Dirk Pattinson,et al. Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..