Ullrich Hustadt
Ullrich Hustadt
Reader, Department of Computer Science, University of Liverpool
Verified email at liverpool.ac.uk
Title
Cited by
Cited by
Year
Reducing SHIQ-Description Logic to Disjunctive Datalog Programs.
U Hustadt, B Motik, U Sattler
KR 4, 152-162, 2004
3482004
Data complexity of reasoning in very expressive description logics
U Hustadt, B Motik, U Sattler
IJCAI 5, 466-471, 2005
2642005
Reasoning in description logics by a reduction to disjunctive datalog
U Hustadt, B Motik, U Sattler
Journal of automated reasoning 39 (3), 351-384, 2007
1942007
Resolution decision procedures
CG Fermüller, A Leitsch, U Hustadt, T Tammet
Handbook of automated reasoning, 1791-1849, 2001
1402001
On evaluating decision procedures for modal logic
U Hustadt, RA Schmidt
Max-Planck-Institut für Informatik, 1997
1151997
Resolution-based methods for modal logics
H De Nivelle, RA Schmidt, U Hustadt
Logic Journal of the IGPL 8 (3), 265-292, 2000
1032000
Issues of decidability for description logics in the framework of resolution
U Hustadt, RA Schmidt
International Workshop on First-Order Theorem Proving, 191-205, 1998
951998
MSPASS: Modal reasoning by translation and first-order resolution
U Hustadt, RA Schmidt
International Conference on Automated Reasoning with Analytic Tableaux and …, 2000
922000
A survey of decidable first-order fragments and description logics
U Hustadt, RA Schmidt, L Georgieva
Journal of Relational Methods in Computer Science 1 (251-276), 3, 2004
812004
TRP++ 2.0: A temporal resolution prover
U Hustadt, B Konev
International Conference on Automated Deduction, 274-278, 2003
802003
Reasoning for description logics around SHIQ in a resolution framework
U Hustadt, B Motik, U Sattler
Technical Report 3-8-04/04, FZI, Karlsruhe, Germany, 2004
782004
Reasoning in description logics with a concrete domain in the framework of resolution
U Hustadt, B Motik, U Sattler
ECAI 16, 353, 2004
662004
An empirical analysis of modal theorem provers
U Hustadt, RA Schmidt
Journal of Applied Non-Classical Logics 9 (4), 479-522, 1999
661999
Do we need the closed world assumption in knowledge representation?
U Hustadt
KRDB 1, 1994
651994
4 Computational modal logic
I Horrocks, U Hustadt, U Sattler, R Schmidt
Studies in Logic and Practical Reasoning 3, 181-245, 2007
622007
Using resolution for testing modal satisfiability and building models
U Hustadt, RA Schmidt
Journal of Automated Reasoning 28 (2), 205-232, 2002
622002
On the relation of resolution and tableaux proof systems for description logics
U Hustadt, RA Schmidt
Automated Reasoning Workshop: Bridging the Gap between Theory and Practice, 1999
541999
A decomposition rule for decision procedures by resolution-based calculi
U Hustadt, B Motik, U Sattler
International Conference on Logic for Programming Artificial Intelligence …, 2005
532005
TeMP: A temporal monodic prover
U Hustadt, B Konev, A Riazanov, A Voronkov
International Joint Conference on Automated Reasoning, 326-330, 2004
532004
A principle for incorporating axioms into the first-order translation of modal formulae
RA Schmidt, U Hustadt
International Conference on Automated Deduction, 412-426, 2003
482003
The system can't perform the operation now. Try again later.
Articles 1–20