![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Ullrich Hustadt Ullrich Hustadt, Boris Konev : TRP++2.0: A Temporal Resolution Prover. CADE 2003 : 274-278 Renate A. Schmidt , Ullrich Hustadt: A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae. CADE 2003 : 412-426 Boris Konev , Anatoli Degtyarev , Clare Dixon , Michael Fisher , Ullrich Hustadt: Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. TIME 2003 : 72-82 Renate A. Schmidt , Ullrich Hustadt: Mechanised Reasoning and Model Generation for Extended Modal Logics. Theory and Applications of Relational Structures as Knowledge Instruments 2003 : 38-67 Lilia Georgieva , Ullrich Hustadt, Renate A. Schmidt : Hyperresolution for guarded formulae. J. Symb. Comput. 36 (1-2): 163-192 (2003) Lilia Georgieva , Ullrich Hustadt, Renate A. Schmidt : A New Clausal Class Decidable by Hyperresolution. CADE 2002 : 260-274 Ullrich Hustadt, Renate A. Schmidt : Scientific Benchmarking with Temporal Logic Decision Procedures. KR 2002 : 533-546 Brandon Bennett , Clare Dixon , Michael Fisher , Ullrich Hustadt, Enrico Franconi , Ian Horrocks , Maarten de Rijke : Combinations of Modal Logics. Artif. Intell. Rev. 17 (1): 1-20 (2002) Ullrich Hustadt, Renate A. Schmidt : Using Resolution for Testing Modal Satisfiability and Building Models. J. Autom. Reasoning 28 (2): 205-232 (2002) Lilia Georgieva , Ullrich Hustadt, Renate A. Schmidt : Computational Space Efficiency and Minimal Model Generation for Guarded Formulae. LPAR 2001 : 85-99 Ullrich Hustadt, Clare Dixon , Renate A. Schmidt , Michael Fisher , John-Jules Ch. Meyer , Wiebe van der Hoek : Reasoning about agents in the KARO framework. TIME 2001 : 206-213 Christian G. Fermüller , Alexander Leitsch , Ullrich Hustadt, Tanel Tammet : Resolution Decision Procedures. Handbook of Automated Reasoning 2001 : 1791-1849 Ullrich Hustadt: Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 2, Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger. Journal of Logic, Language and Information 10 (3): 406-410 (2001) Renate A. Schmidt , Ullrich Hustadt: A Resolution Decision Procedure for Fluted Logic. CADE 2000 : 433-448 Ullrich Hustadt, Clare Dixon , Renate A. Schmidt , Michael Fisher , John-Jules Ch. Meyer , Wiebe van der Hoek : Verification within the KARO Agent Theory. FAABS 2000 : 33-47 Ullrich Hustadt, Clare Dixon , Renate A. Schmidt , Michael Fisher : Normal Forms and Proofs in Combined Modal and Temporal Logics. FroCos 2000 : 73-87 Ullrich Hustadt, Renate A. Schmidt : MSPASS: Modal Reasoning by Translation and First-Order Resolution. TABLEAUX 2000 : 67-71 Ullrich Hustadt, Hans de Nivelle , Renate A. Schmidt : Resolution-Based Methods for Modal Logics. Logic Journal of the IGPL 8 (3): (2000) Ullrich Hustadt, Renate A. Schmidt : Maslov's Class K Revisited. CADE 1999 : 172-186 Ullrich Hustadt, Renate A. Schmidt , Christoph Weidenbach : MSPASS: Subsumption Testing with SPASS. Description Logics 1999 Ullrich Hustadt, Renate A. Schmidt : On the Relation of Resolution and Tableaux Proof Systems for Description Logics. IJCAI 1999 : 110-117 Ullrich Hustadt, Renate A. Schmidt : An empirical analysis of modal theorem provers. Journal of Applied Non-Classical Logics 9 (4): (1999) Ullrich Hustadt, Renate A. Schmidt : Issues of Decidability for Description Logics in the Framework of Resolution. FTP (LNCS Selection) 1998 : 191-205 Ullrich Hustadt, Renate A. Schmidt : Simplification and Backjumping in Modal Tableau. TABLEAUX 1998 : 187-201 Ullrich Hustadt, Renate A. Schmidt : On Evaluating Decision Procedures for Modal Logic. IJCAI (1) 1997 : 202-209 Ullrich Hustadt: Do we need the closed world assumption in knowledge representation? KRDB 1994 1 [ 19 ] 2 [ 24 ] 3 [ 11 ] [ 12 ] [ 16 ] [ 19 ] [ 24 ] 4 [ 15 ] 5 [ 11 ] [ 12 ] [ 16 ] [ 19 ] [ 24 ] 6 [ 19 ] 7 [ 17 ] [ 21 ] [ 22 ] 8 [ 12 ] [ 16 ] 9 [ 19 ] 10 [ 24 ] [ 26 ] 11 [ 15 ] 12 [ 12 ] [ 16 ] 13 [ 9 ] 14 [ 19 ] 15 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 16 ] [ 17 ] [ 18 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 25 ] 16 [ 15 ] 17 [ 7 ] ![]() ©2004 Association for Computing Machinery |