default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUllrich Hustadt
Person information
- affiliation: University of Liverpool, UK
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c53]Ullrich Hustadt
, Fabio Papacchini, Cláudia Nalon, Clare Dixon:
Model Construction for Modal Clauses. IJCAR (2) 2024: 3-23- 2023
- [c52]Cláudia Nalon, Ullrich Hustadt, Fabio Papacchini, Clare Dixon:
Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic. CADE 2023: 382-400 - 2022
- [j23]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Local is Best: Efficient Reductions to Modal Logic K. J. Autom. Reason. 66(4): 639-666 (2022) - [j22]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Correction to: Local is Best: Efficient Reductions to Modal Logic K. J. Autom. Reason. 66(4): 1099 (2022) - [c51]Cláudia Nalon, Ullrich Hustadt, Fabio Papacchini, Clare Dixon:
Local Reductions for the Modal Cube. IJCAR 2022: 486-505 - 2021
- [c50]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Efficient Local Reductions to Basic Modal Logic. CADE 2021: 76-92 - 2020
- [j21]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
Multi-scale verification of distributed synchronisation. Formal Methods Syst. Des. 55(3): 171-221 (2020) - [j20]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
sf Kn : Architecture, Refinements, Strategies and Experiments. J. Autom. Reason. 64(3): 461-484 (2020) - [j19]Ullrich Hustadt, Ana Ozaki, Clare Dixon:
Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations. J. Autom. Reason. 64(8): 1553-1610 (2020)
2010 – 2019
- 2019
- [j18]Cláudia Nalon, Clare Dixon, Ullrich Hustadt:
Modal Resolution: Proofs, Layers, and Refinements. ACM Trans. Comput. Log. 20(4): 23:1-23:38 (2019) - 2018
- [c49]Ullrich Hustadt, Cláudia Nalon, Clare Dixon:
Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics. PAAR@FLoC 2018: 34-48 - [c48]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators. ICFEM 2018: 160-176 - [i2]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
Multi-Scale Verification of Distributed Synchronisation. CoRR abs/1809.10655 (2018) - 2017
- [c47]Ullrich Hustadt, Ana Ozaki, Clare Dixon:
Theorem Proving for Metric Temporal Logic over the Naturals. CADE 2017: 326-343 - [c46]Paul Gainer, Clare Dixon, Kerstin Dautenhahn, Michael Fisher, Ullrich Hustadt, Joe Saunders, Matt Webster:
CRutoN: Automatic Verification of a Robotic Assistant's Behaviours. FMICS-AVoCS 2017: 119-133 - [c45]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
KSP: A Resolution-based Prover for Multimodal K, Abridged Report. IJCAI 2017: 4919-4923 - [c44]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
Investigating Parametric Influence on Discrete Synchronisation Protocols Using Quantitative Model Checking. QEST 2017: 224-239 - [i1]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators. CoRR abs/1709.04385 (2017) - 2016
- [c43]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
: A Resolution-Based Prover for Multimodal K. IJCAR 2016: 406-415 - [c42]Paul Gainer, Clare Dixon, Ullrich Hustadt:
Probabilistic Model Checking of Ant-Based Positionless Swarming. TAROS 2016: 127-138 - 2015
- [c41]Ullrich Hustadt, Paul Gainer, Clare Dixon, Cláudia Nalon, Lan Zhang:
Ordered Resolution for Coalition Logic. TABLEAUX 2015: 169-184 - [c40]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
A Modal-Layered Resolution Calculus for K. TABLEAUX 2015: 185-200 - 2014
- [j17]Cláudia Nalon, Lan Zhang, Clare Dixon, Ullrich Hustadt:
A resolution-based calculus for Coalition Logic. J. Log. Comput. 24(4): 883-917 (2014) - [j16]Lan Zhang, Ullrich Hustadt, Clare Dixon:
A resolution calculus for the branching-time temporal logic CTL. ACM Trans. Comput. Log. 15(1): 10:1-10:38 (2014) - [c39]Cláudia Nalon, Lan Zhang, Clare Dixon, Ullrich Hustadt:
A Resolution Prover for Coalition Logic. SR 2014: 65-73 - 2013
- [c38]Renate A. Schmidt, Ullrich Hustadt:
First-Order Resolution Methods for Modal Logics. Programming Logics 2013: 345-391 - 2010
- [j15]Michel Ludwig, Ullrich Hustadt:
Implementing a fair monodic temporal logic prover. AI Commun. 23(2-3): 69-96 (2010) - [j14]Lan Zhang, Ullrich Hustadt, Clare Dixon:
CTL-RP: A computation tree logic resolution prover. AI Commun. 23(2-3): 111-136 (2010) - [c37]Ullrich Hustadt, Renate A. Schmidt:
A Comparison of Solvers for Propositional Dynamic Logic. PAAR@IJCAR 2010: 63-73
2000 – 2009
- 2009
- [j13]Silvio Ranise, Ullrich Hustadt:
Preface. Ann. Math. Artif. Intell. 55(1-2): 1-2 (2009) - [c36]Lan Zhang, Ullrich Hustadt, Clare Dixon:
A Refined Resolution Calculus for CTL. CADE 2009: 245-260 - [c35]Michel Ludwig, Ullrich Hustadt:
Fair Derivations in Monodic Temporal Reasoning. CADE 2009: 261-276 - [c34]Michel Ludwig, Ullrich Hustadt:
Redundancy Elimination in Monodic Temporal Reasoning. FTP 2009 - [c33]Michel Ludwig, Ullrich Hustadt:
Resolution-Based Model Construction for PLTL. TIME 2009: 73-80 - 2008
- [j12]Ullrich Hustadt, Boris Motik, Ulrike Sattler:
Deciding expressive description logics in the framework of resolution. Inf. Comput. 206(5): 579-601 (2008) - 2007
- [j11]Ullrich Hustadt, Boris Motik, Ulrike Sattler:
Reasoning in Description Logics by a Reduction to Disjunctive Datalog. J. Autom. Reason. 39(3): 351-384 (2007) - [j10]Renate A. Schmidt, Ullrich Hustadt:
The axiomatic translation principle for modal logic. ACM Trans. Comput. Log. 8(4): 19 (2007) - [p3]Ian Horrocks, Ullrich Hustadt, Ulrike Sattler, Renate A. Schmidt:
Computational modal logic. Handbook of Modal Logic 2007: 181-245 - 2006
- [c32]Ullrich Hustadt, Dmitry Tishkovsky, Frank Wolter, Michael Zakharyaschev:
Automated Reasoning About Metric and Topology. JELIA 2006: 490-493 - 2005
- [j9]Boris Konev, Anatoli Degtyarev, Clare Dixon, Michael Fisher, Ullrich Hustadt:
Mechanising first-order temporal resolution. Inf. Comput. 199(1-2): 55-86 (2005) - [j8]M. Carmen Fernández Gago, Ullrich Hustadt, Clare Dixon, Michael Fisher, Boris Konev:
First-Order Temporal Verification in Practice. J. Autom. Reason. 34(3): 295-321 (2005) - [c31]Ullrich Hustadt, Boris Konev, Renate A. Schmidt:
Deciding Monodic Fragments by Temporal Resolution. CADE 2005: 204-218 - [c30]Ullrich Hustadt, Boris Motik:
Description Logics and Disjunctive Datalog - The Story so Far. Description Logics 2005 - [c29]Ullrich Hustadt, Boris Motik, Ulrike Sattler:
Data Complexity of Reasoning in Very Expressive Description Logics. IJCAI 2005: 466-471 - 2004
- [j7]Renate A. Schmidt, Dmitry Tishkovsky, Ullrich Hustadt:
Interactions between Knowledge, Action and Commitment within Agent Dynamic Logic. Stud Logica 78(3): 381-415 (2004) - [c28]Ullrich Hustadt, Boris Konev, Alexandre Riazanov, Andrei Voronkov:
TeMP: A Temporal Monodic Prover. IJCAR 2004: 326-330 - [c27]Ullrich Hustadt, Boris Motik, Ulrike Sattler:
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution. ECAI 2004: 353-357 - [c26]Ullrich Hustadt, Boris Motik, Ulrike Sattler:
Reducing SHIQ-Description Logic to Disjunctive Datalog Programs. KR 2004: 152-162 - [c25]Ullrich Hustadt, Boris Motik, Ulrike Sattler:
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi. LPAR 2004: 21-35 - 2003
- [j6]Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt:
Hyperresolution for guarded formulae. J. Symb. Comput. 36(1-2): 163-192 (2003) - [c24]Valentin Goranko, Ullrich Hustadt, Renate A. Schmidt, Dimiter Vakarelov:
SCAN Is Complete for All Sahlqvist Formulae. RelMiCS 2003: 149-162 - [c23]Renate A. Schmidt, Ewa Orlowska, Ullrich Hustadt:
Two Proof Systems for Peirce Algebras. RelMiCS 2003: 238-251 - [c22]Ullrich Hustadt, Boris Konev:
TRP++2.0: A Temporal Resolution Prover. CADE 2003: 274-278 - [c21]Renate A. Schmidt, Ullrich Hustadt:
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae. CADE 2003: 412-426 - [c20]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 - [p2]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 - 2002
- [j5]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) - [j4]Ullrich Hustadt, Renate A. Schmidt:
Using Resolution for Testing Modal Satisfiability and Building Models. J. Autom. Reason. 28(2): 205-232 (2002) - [c19]Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt:
A New Clausal Class Decidable by Hyperresolution. CADE 2002: 260-274 - [c18]Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt:
On the relationship between decidable fragments, non-classical logics, and description logics. Description Logics 2002 - [c17]Ullrich Hustadt, Renate A. Schmidt:
Scientific Benchmarking with Temporal Logic Decision Procedures. KR 2002: 533-546 - 2001
- [j3]Ullrich Hustadt:
Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 2, Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger. J. Log. Lang. Inf. 10(3): 406-410 (2001) - [c16]Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt:
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae. LPAR 2001: 85-99 - [c15]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 - [p1]Christian G. Fermüller, Alexander Leitsch, Ullrich Hustadt, Tanel Tammet:
Resolution Decision Procedures. Handbook of Automated Reasoning 2001: 1791-1849 - 2000
- [j2]Ullrich Hustadt, Hans de Nivelle, Renate A. Schmidt:
Resolution-Based Methods for Modal Logics. Log. J. IGPL 8(3): 265-292 (2000) - [c14]Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt:
Hyperresolution for Guarded Formulae. ARW 2000 - [c13]Ullrich Hustadt:
Practical Proof Methods for Combined Modal and Temporal Logics. ARW 2000 - [c12]Renate A. Schmidt, Ullrich Hustadt:
A Resolution Decision Procedure for Fluted Logic. CADE 2000: 433-448 - [c11]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 - [c10]Ullrich Hustadt, Clare Dixon, Renate A. Schmidt, Michael Fisher:
Normal Forms and Proofs in Combined Modal and Temporal Logics. FroCoS 2000: 73-87 - [c9]Ullrich Hustadt, Renate A. Schmidt:
MSPASS: Modal Reasoning by Translation and First-Order Resolution. TABLEAUX 2000: 67-71
1990 – 1999
- 1999
- [b1]Ullrich Hustadt:
Resolution based decision procedures for subclasses of first-order logic. Saarland University, Saarbrücken, Germany, 1999, pp. 1-180 - [j1]Ullrich Hustadt, Renate A. Schmidt:
An empirical analysis of modal theorem provers. J. Appl. Non Class. Logics 9(4): 479-522 (1999) - [c8]Ullrich Hustadt, Renate A. Schmidt:
Maslov's Class K Revisited. CADE 1999: 172-186 - [c7]Ullrich Hustadt, Renate A. Schmidt, Christoph Weidenbach:
MSPASS: Subsumption Testing with SPASS. Description Logics 1999 - [c6]Ullrich Hustadt, Renate A. Schmidt:
On the Relation of Resolution and Tableaux Proof Systems for Description Logics. IJCAI 1999: 110-117 - 1998
- [c5]Harald Ganzinger, Ullrich Hustadt, Christoph Meyer, Renate A. Schmidt:
A Resolution-Based Decision Procedure for Extensions of K4. Advances in Modal Logic 1998: 225-246 - [c4]Ullrich Hustadt, Renate A. Schmidt:
Issues of Decidability for Description Logics in the Framework of Resolution. FTP (LNCS Selection) 1998: 191-205 - [c3]Ullrich Hustadt, Renate A. Schmidt:
Simplification and Backjumping in Modal Tableau. TABLEAUX 1998: 187-201 - 1997
- [c2]Ullrich Hustadt, Renate A. Schmidt:
On Evaluating Decision Procedures for Modal Logic. IJCAI (1) 1997: 202-209 - 1994
- [c1]Ullrich Hustadt:
Do we need the closed world assumption in knowledge representation? KRDB 1994
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
