Search the dblp DataBase
Ullrich Hustadt :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Valentin Goranko , Ullrich Hustadt , Renate A. Schmidt , Dimiter Vakarelov SCAN Is Complete for All Sahlqvist Formulae. [Citation Graph (0, 0)][DBLP ] RelMiCS, 2003, pp:149-162 [Conf ] Renate A. Schmidt , Ullrich Hustadt Mechanised Reasoning and Model Generation for Extended Modal Logics. [Citation Graph (0, 0)][DBLP ] Theory and Applications of Relational Structures as Knowledge Instruments, 2003, pp:38-67 [Conf ] Renate A. Schmidt , Ewa Orlowska , Ullrich Hustadt Two Proof Systems for Peirce Algebras. [Citation Graph (0, 0)][DBLP ] RelMiCS, 2003, pp:238-251 [Conf ] Harald Ganzinger , Ullrich Hustadt , Christoph Meyer , Renate A. Schmidt A Resolution-Based Decision Procedure for Extensions of K4. [Citation Graph (0, 0)][DBLP ] Advances in Modal Logic, 1998, pp:225-246 [Conf ] Lilia Georgieva , Ullrich Hustadt , Renate A. Schmidt A New Clausal Class Decidable by Hyperresolution. [Citation Graph (0, 0)][DBLP ] CADE, 2002, pp:260-274 [Conf ] Ullrich Hustadt , Boris Konev TRP++2.0: A Temporal Resolution Prover. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:274-278 [Conf ] Ullrich Hustadt , Boris Konev , Alexandre Riazanov , Andrei Voronkov TeMP: A Temporal Monodic Prover. [Citation Graph (0, 0)][DBLP ] IJCAR, 2004, pp:326-330 [Conf ] Ullrich Hustadt , Boris Konev , Renate A. Schmidt Deciding Monodic Fragments by Temporal Resolution. [Citation Graph (0, 0)][DBLP ] CADE, 2005, pp:204-218 [Conf ] Ullrich Hustadt , Renate A. Schmidt Maslov's Class K Revisited. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:172-186 [Conf ] Renate A. Schmidt , Ullrich Hustadt A Resolution Decision Procedure for Fluted Logic. [Citation Graph (0, 0)][DBLP ] CADE, 2000, pp:433-448 [Conf ] Renate A. Schmidt , Ullrich Hustadt A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:412-426 [Conf ] Ullrich Hustadt , Boris Motik Description Logics and Disjunctive Datalog The Story so Far. [Citation Graph (0, 0)][DBLP ] Description Logics, 2005, pp:- [Conf ] Ullrich Hustadt , Renate A. Schmidt , Christoph Weidenbach MSPASS: Subsumption Testing with SPASS. [Citation Graph (0, 0)][DBLP ] Description Logics, 1999, pp:- [Conf ] Ullrich Hustadt , Boris Motik , Ulrike Sattler Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution. [Citation Graph (0, 0)][DBLP ] ECAI, 2004, pp:353-357 [Conf ] Ullrich Hustadt , Clare Dixon , Renate A. Schmidt , Michael Fisher , John-Jules Ch. Meyer , Wiebe van der Hoek Verification within the KARO Agent Theory. [Citation Graph (0, 0)][DBLP ] FAABS, 2000, pp:33-47 [Conf ] Ullrich Hustadt , Clare Dixon , Renate A. Schmidt , Michael Fisher Normal Forms and Proofs in Combined Modal and Temporal Logics. [Citation Graph (0, 0)][DBLP ] FroCos, 2000, pp:73-87 [Conf ] Ullrich Hustadt , Renate A. Schmidt Issues of Decidability for Description Logics in the Framework of Resolution. [Citation Graph (0, 0)][DBLP ] FTP (LNCS Selection), 1998, pp:191-205 [Conf ] Ullrich Hustadt , Boris Motik , Ulrike Sattler Data Complexity of Reasoning in Very Expressive Description Logics. [Citation Graph (0, 0)][DBLP ] IJCAI, 2005, pp:466-471 [Conf ] Ullrich Hustadt , Renate A. Schmidt On Evaluating Decision Procedures for Modal Logic. [Citation Graph (0, 0)][DBLP ] IJCAI (1), 1997, pp:202-209 [Conf ] Ullrich Hustadt , Renate A. Schmidt On the Relation of Resolution and Tableaux Proof Systems for Description Logics. [Citation Graph (0, 0)][DBLP ] IJCAI, 1999, pp:110-117 [Conf ] Ullrich Hustadt , Dmitry Tishkovsky , Frank Wolter , Michael Zakharyaschev Automated Reasoning About Metric and Topology. [Citation Graph (0, 0)][DBLP ] JELIA, 2006, pp:490-493 [Conf ] Ullrich Hustadt , Boris Motik , Ulrike Sattler Reducing SHIQ-Description Logic to Disjunctive Datalog Programs. [Citation Graph (0, 0)][DBLP ] KR, 2004, pp:152-162 [Conf ] Ullrich Hustadt , Renate A. Schmidt Scientific Benchmarking with Temporal Logic Decision Procedures. [Citation Graph (0, 0)][DBLP ] KR, 2002, pp:533-546 [Conf ] Ullrich Hustadt Do we need the closed world assumption in knowledge representation? [Citation Graph (0, 0)][DBLP ] KRDB, 1994, pp:- [Conf ] Lilia Georgieva , Ullrich Hustadt , Renate A. Schmidt Computational Space Efficiency and Minimal Model Generation for Guarded Formulae. [Citation Graph (0, 0)][DBLP ] LPAR, 2001, pp:85-99 [Conf ] Ullrich Hustadt , Boris Motik , Ulrike Sattler A Decomposition Rule for Decision Procedures by Resolution-Based Calculi. [Citation Graph (0, 0)][DBLP ] LPAR, 2004, pp:21-35 [Conf ] Ullrich Hustadt , Renate A. Schmidt MSPASS: Modal Reasoning by Translation and First-Order Resolution. [Citation Graph (0, 0)][DBLP ] TABLEAUX, 2000, pp:67-71 [Conf ] Ullrich Hustadt , Renate A. Schmidt Simplification and Backjumping in Modal Tableau. [Citation Graph (0, 0)][DBLP ] TABLEAUX, 1998, pp:187-201 [Conf ] Ullrich Hustadt , Clare Dixon , Renate A. Schmidt , Michael Fisher , John-Jules Ch. Meyer , Wiebe van der Hoek Reasoning about agents in the KARO framework. [Citation Graph (0, 0)][DBLP ] TIME, 2001, pp:206-213 [Conf ] Boris Konev , Anatoli Degtyarev , Clare Dixon , Michael Fisher , Ullrich Hustadt Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. [Citation Graph (0, 0)][DBLP ] TIME, 2003, pp:72-82 [Conf ] Brandon Bennett , Clare Dixon , Michael Fisher , Ullrich Hustadt , Enrico Franconi , Ian Horrocks , Maarten de Rijke Combinations of Modal Logics. [Citation Graph (0, 0)][DBLP ] Artif. Intell. Rev., 2002, v:17, n:1, pp:1-20 [Journal ] Boris Konev , Anatoli Degtyarev , Clare Dixon , Michael Fisher , Ullrich Hustadt Mechanising first-order temporal resolution. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2005, v:199, n:1-2, pp:55-86 [Journal ] Ullrich Hustadt , Hans de Nivelle , Renate A. Schmidt Resolution-Based Methods for Modal Logics. [Citation Graph (0, 0)][DBLP ] Logic Journal of the IGPL, 2000, v:8, n:3, pp:- [Journal ] Ullrich Hustadt , Renate A. Schmidt An empirical analysis of modal theorem provers. [Citation Graph (0, 0)][DBLP ] Journal of Applied Non-Classical Logics, 1999, v:9, n:4, pp:- [Journal ] Ullrich Hustadt , Renate A. Schmidt Using Resolution for Testing Modal Satisfiability and Building Models. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2002, v:28, n:2, pp:205-232 [Journal ] M. Carmen Fernández Gago , Ullrich Hustadt , Clare Dixon , Michael Fisher , Boris Konev First-Order Temporal Verification in Practice. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2005, v:34, n:3, pp:295-321 [Journal ] Ullrich Hustadt Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 2, Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger. [Citation Graph (0, 0)][DBLP ] Journal of Logic, Language and Information, 2001, v:10, n:3, pp:406-410 [Journal ] Lilia Georgieva , Ullrich Hustadt , Renate A. Schmidt Hyperresolution for guarded formulae. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2003, v:36, n:1-2, pp:163-192 [Journal ] Renate A. Schmidt , Dmitry Tishkovsky , Ullrich Hustadt Interactions between Knowledge, Action and Commitment within Agent Dynamic Logic. [Citation Graph (0, 0)][DBLP ] Studia Logica, 2004, v:78, n:3, pp:381-415 [Journal ] Ullrich Hustadt , Boris Motik , Ulrike Sattler Reasoning in Description Logics by a Reduction to Disjunctive Datalog. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2007, v:39, n:3, pp:351-384 [Journal ] Renate A. Schmidt , Ullrich Hustadt The axiomatic translation principle for modal logic. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2007, v:8, n:4, pp:- [Journal ] Fair Derivations in Monodic Temporal Reasoning. [Citation Graph (, )][DBLP ] A Refined Resolution Calculus for CTL. [Citation Graph (, )][DBLP ] Resolution-Based Model Construction for PLTL. [Citation Graph (, )][DBLP ] CTL-RP: A computation tree logic resolution prover. [Citation Graph (, )][DBLP ] Implementing a fair monodic temporal logic prover. [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.153secs