Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDirk Pattinson
Person information
- affiliation: Australian National University, Canberra, Australia
- affiliation: Imperial College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c83]Oliver Görlitz, Daniel Hausmann
, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description). CADE 2023: 234-247- [c82]Dirk Pattinson, Nicola Olivetti, Cláudia Nalon:
Resolution Calculi for Non-normal Modal Logics. TABLEAUX 2023: 322-341 - [i19]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics. CoRR abs/2305.11015 (2023) - [i18]Merlin Humml, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus With Disjunctive Explicit Strategies. CoRR abs/2305.18795 (2023) - 2022
- [j27]Jim de Groot, Dirk Pattinson:
Hennessy-Milner properties via topological compactness. Inf. Comput. 287: 104757 (2022) - [j26]Jim de Groot, Dirk Pattinson:
Modal meet-implication logic. Log. Methods Comput. Sci. 18(3) (2022) - [j25]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. ACM Trans. Comput. Log. 23(2): 11:1-11:34 (2022) - [e3]Jasmin Blanchette, Laura Kovács, Dirk Pattinson:
Automated Reasoning - 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8-10, 2022, Proceedings. Lecture Notes in Computer Science 13385, Springer 2022, ISBN 978-3-031-10768-9 [contents] - [i17]Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
Uniform Interpolation in Coalgebraic Modal Logic. CoRR abs/2205.00448 (2022) - 2021
- [j24]Dirk Pattinson, Mina Mohammadian:
Constructive Domains with Classical Witnesses. Log. Methods Comput. Sci. 17(1) (2021) - [c81]Merlin Göttlinger, Lutz Schröder, Dirk Pattinson:
The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies. CSL 2021: 26:1-26:22 - [c80]Jim de Groot, Tadeusz Litak, Dirk Pattinson:
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. LICS 2021: 1-15 - [i16]Jim de Groot, Tadeusz Litak, Dirk Pattinson:
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. CoRR abs/2105.01873 (2021) - 2020
- [j23]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A new foundation for finitary corecursion and iterative algebras. Inf. Comput. 271: 104456 (2020) - [c79]Jim de Groot, Dirk Pattinson:
Modal Intuitionistic Logics as Dialgebraic Logics. LICS 2020: 355-369 - [c78]Abbas Edalat, Amin Farjudian, Mina Mohammadian, Dirk Pattinson:
Domain Theoretic Second-Order Euler's Method for Solving Initial Value Problems. MFPS 2020: 105-128 - [i15]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. CoRR abs/2009.00971 (2020) - [i14]Jim de Groot, Dirk Pattinson:
Modal meet-implication logic. CoRR abs/2012.13858 (2020)
2010 – 2019
- 2019
- [j22]Dirk Pattinson, Peter Schuster, Ana Sokolova:
Preface for the special issue of Proof, Structure, and Computation 2014. J. Log. Comput. 29(4): 417-418 (2019) - [c77]Milad K. Ghale, Dirk Pattinson, Michael Norrish:
Modular synthesis of verified verifiers of computation with STV algorithms. FormaliSE@ICSE 2019: 85-94 - [c76]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. IJCAI 2019: 1900-1906 - [c75]Thomas Haines, Dirk Pattinson, Mukesh Tiwari:
Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme. VSTTE 2019: 36-53 - [c74]Jim de Groot, Dirk Pattinson:
Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic. WoLLIC 2019: 161-176 - [i13]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. CoRR abs/1906.00784 (2019) - [i12]Dirk Pattinson, Mina Mohammadian:
Constructive Domains with Classical Witnesses. CoRR abs/1910.04948 (2019) - 2018
- [j21]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of Coalgebraic Predicate Logic. Log. Methods Comput. Sci. 14(1) (2018) - [c73]Cláudia Nalon, Dirk Pattinson:
A Resolution-Based Calculus for Preferential Logics. IJCAR 2018: 498-515 - [c72]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Fuzzy Modal Logic. LICS 2018: 909-918 - [c71]Milad K. Ghale, Rajeev Goré, Dirk Pattinson, Mukesh Tiwari:
Modular Formalisation and Verification of STV Algorithms. E-Vote-ID 2018: 51-66 - [c70]Milad K. Ghale, Dirk Pattinson, Ramana Kumar, Michael Norrish:
Verified Certificate Checking for Counting Votes. VSTTE 2018: 69-87 - [i11]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Fuzzy Modal Logic. CoRR abs/1802.00478 (2018) - [i10]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion and Iterative Algebras. CoRR abs/1802.08070 (2018) - [i9]Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König:
A van Benthem Theorem for Quantitative Probabilistic Modal Logic. CoRR abs/1810.04722 (2018) - 2017
- [j20]Lutz Schröder, Dirk Pattinson, Tadeusz Litak:
A Van Benthem/Rosen theorem for coalgebraic predicate logic. J. Log. Comput. 27(3): 749-773 (2017) - [c69]Florrie Verity, Dirk Pattinson:
Formally verified invariants of vote counting schemes. ACSW 2017: 31:1-31:10 - [c68]Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
Uniform Interpolation in Coalgebraic Modal Logic. CALCO 2017: 21:1-21:16 - [c67]Dirk Pattinson, Mukesh Tiwari:
Schulze Voting as Evidence Carrying Computation. ITP 2017: 410-426 - [c66]Lyria Bennett Moses, Rajeev Goré, Ron Levy, Dirk Pattinson, Mukesh Tiwari:
No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes. E-VOTE-ID 2017: 66-83 - [c65]Milad K. Ghale, Rajeev Goré, Dirk Pattinson:
A Formally Verified Single Transferable Voting Scheme with Fractional Values. E-VOTE-ID 2017: 163-182 - [i8]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Model Theory and Proof Theory of CPL. CoRR abs/1701.03773 (2017) - 2016
- [c64]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. FoSSaCS 2016: 107-125 - [c63]Dirk Pattinson, Lutz Schröder:
Program Equivalence is Coinductive. LICS 2016: 337-346 - [i7]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion. CoRR abs/1601.01532 (2016) - 2015
- [j19]Dirk Pattinson, Lutz Schröder:
From the Editors. J. Comput. Syst. Sci. 81(5): 797-798 (2015) - [c62]Dirk Pattinson, Carsten Schürmann:
Vote Counting as Mathematical Proof. Australasian Conference on Artificial Intelligence 2015: 464-475 - [c61]Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder:
Simplified Coalgebraic Trace Equivalence. Software, Services, and Systems 2015: 75-90 - [c60]Stefan Milius, Dirk Pattinson, Lutz Schröder:
Generic Trace Semantics and Graded Monads. CALCO 2015: 253-269 - [c59]Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Reasoning with Global Assumptions in Arithmetic Modal Logics. FCT 2015: 367-380 - [c58]Dirk Pattinson, Lutz Schröder:
Sound and Complete Equational Reasoning over Comodels. MFPS 2015: 315-331 - 2014
- [c57]Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, Thorsten Wißmann:
Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). IJCAR 2014: 396-402 - [c56]Sergey Goncharov, Dirk Pattinson:
Coalgebraic Weak Bisimulation from Recursive Equations over Monads. ICALP (2) 2014: 196-207 - [i6]Sergey Goncharov, Dirk Pattinson:
Coalgebraic Weak Bisimulation from Recursive Equations over Monads. CoRR abs/1404.1215 (2014) - [i5]Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder:
Simplified Coalgebraic Trace Equivalence. CoRR abs/1410.2463 (2014) - 2013
- [j18]Abbas Edalat, André Lieutier, Dirk Pattinson:
A computational model for multi-variable differential calculus. Inf. Comput. 224: 23-45 (2013) - [c55]Faris Abou-Saleh, Dirk Pattinson:
Comodels and Effects in Mathematical Operational Semantics. FoSSaCS 2013: 129-144 - [c54]Fredrik Dahlqvist, Dirk Pattinson:
Some Sahlqvist Completeness Results for Coalgebraic Logics. FoSSaCS 2013: 193-208 - [c53]Björn Lellmann, Dirk Pattinson:
Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic. ICLA 2013: 148-160 - [c52]Agnieszka Kulacka, Dirk Pattinson, Lutz Schröder:
Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC. IJCAI 2013: 962-968 - [c51]Dirk Pattinson:
The Logic of Exact Covers: Completeness and Uniform Interpolation. LICS 2013: 418-427 - [c50]Björn Lellmann, Dirk Pattinson:
Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5. TABLEAUX 2013: 219-233 - 2012
- [c49]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder:
Coalgebraic Predicate Logic. ICALP (2) 2012: 299-311 - [c48]Björn Lellmann, Dirk Pattinson:
Sequent Systems for Lewis' Conditional Logics. JELIA 2012: 320-332 - [c47]William Snell, Dirk Pattinson, Florian Widmann:
Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description). LPAR 2012: 383-390 - [e2]Dirk Pattinson, Lutz Schröder:
Coalgebraic Methods in Computer Science - 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 - April 1, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7399, Springer 2012, ISBN 978-3-642-32783-4 [contents] - 2011
- [j17]Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema:
Modal Logics are Coalgebraic. Comput. J. 54(1): 31-41 (2011) - [j16]Dirk Pattinson, Lutz Schröder:
Generic Modal Cut Elimination Applied to Conditional Logics. Log. Methods Comput. Sci. 7(1) (2011) - [j15]Corina Cîrstea, Clemens Kupke, Dirk Pattinson:
EXPTIME Tableaux for the Coalgebraic mu-Calculus. Log. Methods Comput. Sci. 7(3) (2011) - [j14]Lutz Schröder, Dirk Pattinson:
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. Comput. Sci. 21(2): 235-266 (2011) - [j13]Clemens Kupke, Dirk Pattinson:
Coalgebraic semantics of modal logics: An overview. Theor. Comput. Sci. 412(38): 5070-5094 (2011) - [c46]Fredrik Dahlqvist, Dirk Pattinson:
On the Fusion of Coalgebraic Logics. CALCO 2011: 161-175 - [c45]Lutz Schröder, Dirk Pattinson:
Description Logics and Fuzzy Probability. IJCAI 2011: 1075-1081 - [c44]Björn Lellmann, Dirk Pattinson:
Cut Elimination for Shallow Modal Logics. TABLEAUX 2011: 211-225 - [c43]Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano:
Coalgebraic Predicate Logic: Equipollence Results and Proof Theory. TbiLLC 2011: 257-276 - [c42]Faris Abou-Saleh, Dirk Pattinson:
Towards Effects in Mathematical Operational Semantics. MFPS 2011: 81-104 - 2010
- [j12]Dirk Pattinson, Lutz Schröder:
Cut elimination in coalgebraic logics. Inf. Comput. 208(12): 1447-1468 (2010) - [j11]Robert S. R. Myers, Dirk Pattinson:
Hybrid logic with the difference modality for generalisations of graphs. J. Appl. Log. 8(4): 441-458 (2010) - [j10]Lutz Schröder, Dirk Pattinson:
Rank-1 Modal Logics are Coalgebraic. J. Log. Comput. 20(5): 1113-1147 (2010) - [c41]Clemens Kupke, Dirk Pattinson:
On Modal Logics of Linear Inequalities. Advances in Modal Logic 2010: 235-255 - [c40]Rajeev Goré, Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Global Caching for Coalgebraic Description Logics. IJCAR 2010: 46-60 - [c39]Lutz Schröder, Dirk Pattinson, Daniel Hausmann:
Optimal Tableaux for Conditional Logics with Cautious Monotonicity. ECAI 2010: 707-712 - [c38]Lutz Schröder, Dirk Pattinson:
Coalgebraic Correspondence Theory. FoSSaCS 2010: 328-342 - [c37]Lutz Schröder, Dirk Pattinson:
Named Models in Coalgebraic Hybrid Logic. STACS 2010: 645-656 - [c36]Rajeev Goré, Clemens Kupke, Dirk Pattinson:
Optimal Tableau Algorithms for Coalgebraic Logics. TACAS 2010: 114-128 - [i4]Lutz Schröder, Dirk Pattinson:
Named Models in Coalgebraic Hybrid Logic. CoRR abs/1001.0735 (2010)
2000 – 2009
- 2009
- [j9]Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Representations of Stream Processors Using Nested Fixed Points. Log. Methods Comput. Sci. 5(3) (2009) - [j8]Lutz Schröder, Dirk Pattinson:
PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log. 10(2): 13:1-13:33 (2009) - [c35]Corina Cîrstea, Clemens Kupke, Dirk Pattinson:
EXPTIME Tableaux for the Coalgebraic µ-Calculus. CSL 2009: 179-193 - [c34]Robert S. R. Myers, Dirk Pattinson, Lutz Schröder:
Coalgebraic Hybrid Logic. FoSSaCS 2009: 137-151 - [c33]Lutz Schröder, Dirk Pattinson, Clemens Kupke:
Nominals for Everyone. IJCAI 2009: 917-922 - [c32]Lutz Schröder, Dirk Pattinson:
Strong Completeness of Coalgebraic Modal Logics. STACS 2009: 673-684 - [c31]Dirk Pattinson, Lutz Schröder:
Generic Modal Cut Elimination Applied to Conditional Logics. TABLEAUX 2009: 280-294 - [c30]Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Continuous Functions on Final Coalgebras. MFPS 2009: 3-18 - [i3]Lutz Schröder, Dirk Pattinson:
Strong Completeness of Coalgebraic Modal Logics. CoRR abs/0902.2072 (2009) - 2008
- [j7]Josef Berger, Dirk Pattinson, Peter Schuster, Júlia Zappe:
Editorial: Math. Log. Quart. 1/2008. Math. Log. Q. 54(1): 4 (2008) - [c29]Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema:
Modal Logics are Coalgebraic. BCS Int. Acad. Conf. 2008: 128-140 - [c28]Dirk Pattinson, Lutz Schröder:
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. FoSSaCS 2008: 66-80 - [c27]Lutz Schröder, Dirk Pattinson:
Shallow Models for Non-iterative Modal Logics. KI 2008: 324-331 - [c26]Lutz Schröder, Dirk Pattinson:
How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. KR 2008: 307-317 - [c25]Dirk Pattinson, Lutz Schröder:
Admissibility of Cut in Coalgebraic Logics. CMCS 2008: 221-241 - [i2]Lutz Schröder, Dirk Pattinson:
The craft of model making: PSPACE bounds for non-iterative modal logics. CoRR abs/0802.0116 (2008) - 2007
- [j6]Abbas Edalat, Dirk Pattinson:
Denotational semantics of hybrid automata. J. Log. Algebraic Methods Program. 73(1-2): 3-21 (2007) - [j5]Corina Cîrstea, Dirk Pattinson:
Modular construction of complete coalgebraic logics. Theor. Comput. Sci. 388(1-3): 83-108 (2007) - [c24]Lutz Schröder, Dirk Pattinson:
Modular Algorithms for Heterogeneous Modal Logics. ICALP 2007: 459-471 - [c23]Lutz Schröder, Dirk Pattinson:
Rank-1 Modal Logics Are Coalgebraic. STACS 2007: 573-585 - [c22]Georgel Calin, Robert S. R. Myers, Dirk Pattinson, Lutz Schröder:
CoLoSS: The Coalgebraic Logic Satisfiability Solver. M4M 2007: 41-54 - [i1]Lutz Schröder, Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics. CoRR abs/0706.4044 (2007) - 2006
- [c21]Abbas Edalat, Dirk Pattinson:
Denotational Semantics of Hybrid Automata. FoSSaCS 2006: 231-245 - [c20]Lutz Schröder, Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics. LICS 2006: 231-242 - [c19]Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Continuous Functions on Final Coalgebras. CMCS 2006: 141-155 - 2005
- [j4]Alexander Kurz, Dirk Pattinson:
Coalgebraic modal logic of finite rank. Math. Struct. Comput. Sci. 15(3): 453-473 (2005) - [j3]Dirk Pattinson, Martin Wirsing:
A coordination approach to mobile components. Theor. Comput. Sci. 331(2-3): 457-483 (2005) - [c18]Clemens Kupke, Alexander Kurz, Dirk Pattinson:
Ultrafilter Extensions for Coalgebras. CALCO 2005: 263-277 - [c17]Dirk Pattinson:
Domain-Theoretic Formulation of Linear Boundary Value Problems. CiE 2005: 385-395 - [c16]Abbas Edalat, André Lieutier, Dirk Pattinson:
A Computational Model for Multi-variable Differential Calculus. FoSSaCS 2005: 505-519 - [c15]Dirk Pattinson, Bernhard Reus:
A Complete Temporal and Spatial Logic for Distributed Systems. FroCoS 2005: 122-137 - [c14]Abbas Edalat, Dirk Pattinson:
Inverse and Implicit Functions in Domain Theory. LICS 2005: 417-426 - [c13]Abbas Edalat, Dirk Pattinson:
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields. MFPS 2005: 565-581 - 2004
- [j2]Dirk Pattinson:
Expressive Logics for Coalgebras via Terminal Sequence Induction. Notre Dame J. Formal Log. 45(1): 19-33 (2004) - [c12]Corina Cîrstea, Dirk Pattinson:
Modular Construction of Modal Logics. CONCUR 2004: 258-275 - [c11]Abbas Edalat, Dirk Pattinson:
A Domain Theoretic Account of Picard's Theorem. ICALP 2004: 494-505 - [c10]Abbas Edalat, Dirk Pattinson:
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems. PARA 2004: 112-121 - [c9]Clemens Kupke, Alexander Kurz, Dirk Pattinson:
Algebraic Semantics for Coalgebraic Logics. CMCS 2004: 219-241 - 2003
- [j1]Dirk Pattinson:
Coalgebraic modal logic: soundness, completeness and decidability of local consequence. Theor. Comput. Sci. 309(1-3): 177-193 (2003) - [c8]Dirk Pattinson:
Computable Functions on Final Coalgebras. CMCS 2003: 237-256 - [e1]Martin Wirsing, Dirk Pattinson, Rolf Hennicker:
Recent Trends in Algebraic Development Techniques, 16th International Workshop, WADT 2002, Frauenchiemsee, Germany, September 24-27, 2002, Revised Selected Papers. Lecture Notes in Computer Science 2755, Springer 2003, ISBN 3-540-20537-3 [contents] - 2002
- [c7]Dirk Pattinson, Martin Wirsing:
Making Components Move: A Separation of Concerns Approach. FMCO 2002: 487-507 - [c6]