- Issues of Decidability for Description Logics in the Framework of Resolution
- ResolutionBased Decision Procedures for
- Modalities in Knowledge Representation Ullrich Hustadt and Andreas Nonnengart
- Translating PLTL into WS1S: Application Description B. Hirsch \Lambda and U. Hustadt
- Issues of Decidability for Description Logics in the Framework of Resolution
- On the relationship between decidable fragments, nonclassical logics, and description logics
- Redundancy Elimination in Monodic Temporal Michel Ludwig1
- A Comparison of Solvers for Propositional Dynamic Logic Ullrich Hustadt
- Resolution-Based Model Construction for PLTL Michel Ludwig and Ullrich Hustadt
- Verification within the KARO Agent Theory Ullrich Hustadt1
- Deciding monodic fragments by temporal resolution
- TRP++: A temporal resolution prover Ullrich Hustadt and Boris Konev
- Reducing SHIQ-Description Logic to Disjunctive Datalog Programs
- Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
- TRP++ 2.0: A temporal resolution prover Ullrich Hustadt and Boris Konev
- Mechanised Reasoning and Model Generation for Extended Modal Logics
- Computational space efficiency and minimal model generation for guarded formulae
- Verification within the KARO Agent Theory Ullrich Hustadt1
- MSPASS: Modal Reasoning by Translation and First-Order Resolution
- Optimised functional translation and resolution Ullrich Hustadt1
- MAX-PLANCK-INSTITUT On evaluating decision procedures
- Hyperresolution for Guarded Formulae Lilia Georgieva1, Ullrich Hustadt2 and Renate A. Schmidt1
- MSPASS: Subsumption Testing with SPASS \Lambda Ullrich Hustadt 1 and Renate A. Schmidt 1 and Christoph Weidenbach 2
- MAXPLANCKINSTITUT \Omega \Psi
- Computational space eciency and minimal model generation for guarded formulae
- Hyperresolution for Guarded Formulae Lilia Georgieva 1 , Ullrich Hustadt 2 and Renate A. Schmidt 1
- Two Proof Systems for Peirce Algebras Renate A. Schmidt1
- SCAN is complete for all Sahlqvist formulae V. Goranko1
- A Resolution-Based Decision Procedure for Extensions of K4
- Resolution-Based Decision Procedures for
- A New Clausal Class Decidable by Hyperresolution
- Simplification and backjumping in modal tableau Ullrich Hustadt and Renate A. Schmidt
- Simplification and backjumping in modal tableau Ullrich Hustadt and Renate A. Schmidt
- A Resolution Decision Procedure for Fluted Logic
- A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
- Automated Support for the Development of NonClassical Logics
- Scientific Benchmarking with Temporal Logic Decision Procedures Ullrich Hustadt
- January 2003 Computer Science
- Optimised functional translation and resolution Ullrich Hustadt 1 , Renate A. Schmidt 1 , and Christoph Weidenbach 2
- SCAN is complete for all Sahlqvist formulae V. Goranko1
- Formulae which Highlight Di erences between Temporal Logic and Dynamic Logic Provers
- MSPASS: Modal Reasoning by Translation and First-Order Resolution
- TeMP: A Temporal Monodic Prover ? Ullrich Hustadt 1 , Boris Konev 1?? , Alexandre Riazanov 2 , and Andrei Voronkov 2
- TeMP: A Temporal Monodic Prover Ullrich Hustadt1, Boris Konev1 , Alexandre Riazanov2, and Andrei Voronkov2
- Issues of Decidability for Description Logics in the Framework of Resolution
