|
[1]
|
C. Cirstea, C. Kupke, and D. Pattinson.
EXPTIME tableaux for the coalgebraic μ-calculus.
Logical Methods in Computer Science, 7(3), 2011.
[ bib |
.pdf ]
|
|
[2]
|
C. Kupke and D. Pattinson.
Coalgebraic semantics of modal logics: an overview.
Theoretical Computer Science, 412(38):5070-5094, 2011.
Special issue CMCS 2010.
[ bib |
.pdf ]
|
|
[3]
|
D. Pattinson and L. Schröder.
Generic modal cut elimination applied to conditional logics.
Logical Methods in Computer Science, 7(1), 2011.
25 pages.
[ bib |
.pdf ]
|
|
[4]
|
L. Schröder and D. Pattinson.
Modular algorithms for heterogeneous modal logics via multi-sorted
coalgebra.
Mathematical Structures in Computer Science, 21, 2011.
[ bib |
.pdf ]
|
|
[5]
|
R. Myers and D. Pattinson.
Hybrid logic with the difference modality for generalisations of
graphs.
J. Applied Logic, 8(4):441-458, 2010.
[ bib |
.pdf ]
|
|
[6]
|
D. Pattinson and L. Schröder.
Cut elimination in coalgebraic logics.
Information and Computation, 208:1447-1468, 2010.
[ bib |
.pdf ]
|
|
[7]
|
P. Hancock, D. Pattinson, and N. Ghani.
Representations of stream processors using nested fixed points.
Logical Methods in Computer Science, 5(3), 2009.
[ bib |
.pdf ]
|
|
[8]
|
C. Cirstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema.
Modal logics are coalgebraic.
The Computer Journal, 54(1):31-41, 2009.
[ bib |
.pdf ]
|
|
[9]
|
L. Schröder and D. Pattinson.
Rank-1 logics are coalgebraic.
Journal of Logic and Computation, 20(5):1113-1147, 2010.
[ bib |
.pdf ]
|
|
[10]
|
L. Schröder and D. Pattinson.
PSPACE bounds for rank-1 modal logics.
ACM Transactions on Computational Logics, 10(2), 2009.
[ bib |
.pdf ]
|
|
[11]
|
A. Edalat and D. Pattinson.
Denotational semantics of hybrid automata.
Journal of Logic and Algebraic Programming, 73:3-21, 2007.
[ bib |
.pdf ]
|
|
[12]
|
C. Cirstea and D. Pattinson.
Modular proof systems for coalgebraic logics.
Theoretical Computer Science, 388:83-108, 2007.
[ bib |
.pdf ]
|
|
[13]
|
A. Edalat and D. Pattinson.
A domain-theoretic account of Picard's theorem.
LMS Journal of Computation and Mathematics, 10:83-118, 2007.
[ bib |
.pdf ]
|
|
[14]
|
A. Kurz and D. Pattinson.
Coalgebraic modal logic of finite rank.
Mathematical Structures in Computer Science, 15(3):453-473,
2005.
[ bib |
.pdf ]
|
|
[15]
|
D. Pattinson and M. Wirsing.
A seperation of concerns approach to mobile components.
Theoretical Computer Science, 331(2-3):457-483, 2005.
[ bib |
.pdf ]
|
|
[16]
|
D. Pattinson.
Expressive logics for coalgebras via terminal sequence induction.
Notre Dame Journal of Formal Logic, 45(1):19-33, 2004.
[ bib |
.pdf ]
|
|
[17]
|
D. Pattinson.
Coalgebraic modal logic: Soundness, completeness and decidability of
local consequence.
Theoretical Computer Science, 309(1-3):177-193, 2003.
[ bib |
.pdf ]
|
|
[1]
|
D. Pattinson and L. Santocanale.
How to cover without lifting relations, 2011.
TbiLLC 2011.
[ bib |
.pdf ]
|
|
[2]
|
L. Schröder and D. Pattinson.
Description logics and fuzzy probability.
In T. Walsh, editor, Proc. IJCAI 2011, pages 1075-1080. AAAI
Press, 2011.
[ bib |
.pdf ]
|
|
[3]
|
F. Abou-Saleh and D. Pattinson.
Towards effects in mathematical operational semantics.
In J. Ouaknine, editor, Proc. MFPS XXVII, Electr. Notes in
Theoret. Comp. Sci., 2011.
[ bib |
.pdf ]
|
|
[4]
|
B. Lellmann and D. Pattinson.
Cut elimination for shallow modal logics.
In K. Brünnler and G. Metcalfe, editors, Proc. Tableaux
2011, volume 6793 of Lecture Notes in Artificial Intelligence, pages
211-225, 2011.
[ bib |
.pdf ]
|
|
[5]
|
F. Dahlqvist and D. Pattinson.
On the fusion of coalgebraic logics.
In A. Corradini and B. Klin, editors, Proc. CALCO 2011, volume
6859 of Lecture Notes in Comp. Sci., pages 161-175, 2011.
[ bib |
.pdf ]
|
|
[6]
|
C. Kupke and D. Pattinson.
On modal logics of linear inequalities.
In V. Goranko and V. Shehtman, editors, Proc. AiML 2010.
College Publications, 2010.
[ bib |
.pdf ]
|
|
[7]
|
L. Schröder, D. Pattinson, and D. Hausmann.
Optimal tableaux for conditional logics with cautious monotonicity.
In H. Coelho, R. Studer, and M. Wooldridge, editors, Proc. ECAI
2010, volume 215 of Frontiers in Artificial Intelligence and
Applications, pages 707-712. IOS Press, 2010.
[ bib |
.pdf ]
|
|
[8]
|
R. Goré, C. Kupke, D. Pattinson, and L. Schröder.
Global caching for coalgebraic description logics.
In J. Giesl and R. Haehnle, editors, Proc. IJCAR 2010, number
6173 in Lecture Notes in Comp. Sci., pages 46-60, 2010.
[ bib |
.pdf ]
|
|
[9]
|
R. Goré, C. Kupke, and D. Pattinson.
Optimal tableau algorithms for coalgebraic logics.
In R. Majumdar and J. Esparza, editors, Proc. TACAS 2010,
Lecture Notes in Comp. Sci., 2010.
[ bib |
.pdf ]
|
|
[10]
|
L. Schröder and D. Pattinson.
Coalgebraic correspondence theory.
In L. Ong, editor, Proc. FoSSaCS 2010, Lecture Notes in Comp.
Sci., 2010.
[ bib |
.pdf ]
|
|
[11]
|
L. Schröder and D. Pattinson.
Named models in coalgebraic hybrid logic.
In J.-Y. Marion and T. Schwentick, editors, Proc. STACS 2010,
Leibniz International Proceedings in Informatics, 2010.
[ bib |
.pdf ]
|
|
[12]
|
C. Cîrstea, C. Kupke, and D. Pattinson.
EXPTIME tableaux for the coalgebraic μ-calculus.
In E. Grädel and R. Kahle, editors, Proc. CSL 2009, number
5771 in Lecture Notes in Comp. Sci., pages 179-193, 2009.
[ bib |
.pdf ]
|
|
[13]
|
D. Pattinson and L. Schröder.
Generic modal cut elimination applied to conditional logics.
In M. Giese and A. Waaler, editors, Proc. Tableaux 2009, volume
5607 of Lect. Notes in Artificial Intelligence. Springer, 2009.
[ bib |
.pdf ]
|
|
[14]
|
N. Ghani, P. Hancock, and D. Pattinson.
Continuous functions of final coalgebras.
Electr. Notes in Theoret. Comput. Sci., 249:3-18, 2009.
Proc. MFPS 2009.
[ bib |
.pdf ]
|
|
[15]
|
L. Schröder, D. Pattinson, and C. Kupke.
Nominals for everyone.
In C. Boutilier, editor, Proc. IJCAI 2009, pages 917-922,
2009.
online proceedings.
[ bib |
.pdf ]
|
|
[16]
|
L. Schröder and D. Pattinson.
Strong completeness of coalgebraic modal logics.
In S. Albers and J.-Y. Marion, editors, Proc. STACS 2009,
volume 09001 of Dagstuhl Seminar Proceedings, pages 673-684. Schloss
Dagstuhl, 2009.
[ bib |
.pdf ]
|
|
[17]
|
R. Myers, D. Pattinson, and L. Schröder.
Coalgebraic hybrid logic.
In L. de Alfaro, editor, Proc. FOSSACS 2009, volume 5504 of
Lecture Notes in Computer Science, pages 137-151. Springer, 2009.
[ bib |
.pdf ]
|
|
[18]
|
C. Cîrstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema.
Modal logics are coalgebraic.
In S. Abramsky and V. Sassone, editors, BCS Visions in Computer
Science, Electronic Workshops in Computing, 2008.
[ bib |
.pdf ]
|
|
[19]
|
L. Schröder and D. Pattinson.
Shallow models for non-iterative modal logics.
In A. Dengel, K. Berns, T. Breuel, F. Bomarius, and
T. Roth-Berghofer, editors, Proc. KI 2008, volume 5243 of Lecture
Notes in Computer Science, pages 324-331. Springer, 2008.
[ bib |
.pdf ]
|
|
[20]
|
L. Schröder and D. Pattinson.
How many toes do I have? parthood and number restrictions in
description logics.
In Proc. Knowledge Representation 2008. AAAI Press, 2008.
[ bib |
.pdf ]
|
|
[21]
|
D. Pattinson and L. Schröder.
Eliminability of cut in coalgebraic logics.
Electr. Notes in Theoret. Comp. Sci., 203(5):221-241, 2008.
[ bib |
.pdf ]
|
|
[22]
|
D. Pattinson and L. Schröder.
Beyond rank 1: Algebraic semantics and finite models for coalgebraic
logics.
In R. Amadio, editor, Proc. FoSSaCS 2008, number 4962 in LNCS,
pages 66-80, 2008.
[ bib |
.pdf ]
|
|
[23]
|
G. Calin, R. Myers, D. Pattinson, and L. Schröder.
ColoSS: The coalgebraic logic satisfiability solver.
Electr. Notes Theor. Comput. Sci., 231:41-54, 2009.
Proc. Methods for Modalities 5 (2007).
[ bib |
.pdf ]
|
|
[24]
|
L. Schröder and D. Pattinson.
Modular algorithms for heterogeneous modal logics.
In L. Arge, C. Cachin, T. Jurdzinski, and A. Tarlecki, editors,
Proc 34th International Colloquium on Automata, Languages and Programming
(ICALP 2007), number 4596 in Lecture Notes in Comp. Sci., pages 459-471,
2007.
[ bib |
.pdf ]
|
|
[25]
|
L. Schröder and D. Pattinson.
Rank-1 logics are coalgebraic.
In W. Thomas and T. Weil, editors, Proc. 24th Annual Symposium
on Theoretical Aspects of Computer Science (STACS 2007), number 4393 in
Lecture Notes in Comp. Sci., pages 573-585, 2007.
[ bib |
.pdf ]
|
|
[26]
|
L. Schröder and D. Pattinson.
PSPACE bounds for rank-1 modal logics.
In Proc. 21st IEEE Symposium on Logic in Computer Science (LICS
2006), pages 231-242, 2006.
[ bib |
.pdf ]
|
|
[27]
|
A. Edalat and D. Pattinson.
Denotational semantics of hybrid automata.
In L. Aceto and A. Ingofsdottir, editors, Proc. FoSSaCS 2006,
volume 3921 of Lecture Notes in Comp. Sci., pages 231-245, 2006.
[ bib |
.pdf ]
|
|
[28]
|
N. Ghani, P. Hancock, and D. Pattinson.
Continuous functions on final coalgebras.
In J. Power, editor, Proc. CMCS 2006, Electr. Notes in Theoret.
Comp. Sci., 2006.
[ bib |
.pdf ]
|
|
[29]
|
D. Pattinson.
Domain theoretic formulation of linear boundary value problems.
In B. Loewe, editor, Proc. CiE 2005, number 3526 in Lecture
Notes in Comp. Sci., pages 385-395, 2005.
[ bib |
.pdf ]
|
|
[30]
|
A. Edalat and D. Pattinson.
Inverse and implicit functions in domain theory.
In P. Panangaden, editor, Proc. 20th IEEE Symposium on Logic in
Computer Science (LICS 2005), pages 417-426, 2005.
[ bib |
.pdf ]
|
|
[31]
|
C. Kupke, A. Kurz, and D. Pattinson.
Ultrafilter extensions for coalgebras.
In J. Fiadeiro and J. Rutten, editors, Proc. CALCO 2005, volume
3629 of Lecture Notes in Comp. Sci., pages 263-277, 2005.
[ bib |
.pdf ]
|
|
[32]
|
A. Edalat and D. Pattinson.
Domain theoretic solutions of initial value problems for unbounded
vector fields.
In M. Escardó, editor, Proc. MFPS XXI, volume 155 of
Electr. Notes in Theoret. Comp. Sci., pages 565-581, 2005.
[ bib |
.pdf ]
|
|
[33]
|
D. Pattinson and B. Reus.
A complete temporal and spatial logic for distributed systems.
In B. Gramlich, editor, Frontiers of Combining Systems, volume
3717 of Lecture Notes in Artificial Intelligence, pages 122-137, 2005.
[ bib |
.pdf ]
|
|
[34]
|
A. Edalat, A. Lieutier, and D. Pattinson.
A computational model for multi-variable differential calculus.
In V. Sassone, editor, Proc. FoSSaCS 2005, volume 3441 of
Lecture Notes in Comp. Sci., pages 505-519, 2005.
[ bib |
.pdf ]
|
|
[35]
|
C. Cirstea and D. Pattinson.
Modular construction of modal logics.
In P. Gardner and N. Yoshida, editors, Proc. CONCUR 2004,
volume 3170 of Lecture Notes in Comp. Sci., pages 258-275, 2004.
[ bib |
.pdf ]
|
|
[36]
|
A. Edalat and D. Pattinson.
A domain theoretic account of Euler's method for solving initial
value problems.
In J. Dongarra, K. Madsen, and J. Wasniewski, editors, Proc.
PARA 2004, volume 3732 of Lecture Notes in Comp. Sci., pages 112-121,
2006.
[ bib |
.pdf ]
|
|
[37]
|
A. Edalat and D. Pattinson.
A domain theoretic account of Picard's theorem.
In Proc. ICALP 2004, volume 3142 of Lecture Notes in Comp.
Sci., pages 494-505, 2004.
[ bib |
.pdf ]
|
|
[38]
|
C. Kupke, A. Kurz, and D. Pattinson.
Algebraic semantics for coalgebraic logics.
In J. Adàamek and S. Milius, editors, Coalgebraic Methods
in Computer Science (CMCS 2004), volume 106 of Electr. Notes in
Theoret. Comp. Sci., pages 219-241, 2004.
[ bib |
.pdf ]
|
|
[39]
|
A. Edalat and D. Pattinson.
Initial value problems in domain theory.
In Proc. International Conference on Computability and
Complexity in Analysis (CCA 2003), pages 211-227, 2003.
[ bib |
.pdf ]
|
|
[40]
|
D. Pattinson and M. Wirsing.
Making components move: A separation of concerns approach.
In F. de Boer, M. Bonsangue, S. Graf, and W.-P. de Roever, editors,
First International Symposium on Formal Methods for Components and
Objects (FMCO 2002), volume 2852 of Lecture Notes in Computer Science,
pages 487-507, 2002.
[ bib |
.pdf ]
|
|
[41]
|
D. Pattinson.
Computable functions on final coalgebras.
In H.-P. Gumm, editor, Coalgebraic Methods in Computer Science
(CMCS 2003), volume 82 of Electr. Notes in Theoret. Comp. Sci., pages
1-20, 2003.
[ bib |
.pdf ]
|
|
[42]
|
D. Pattinson.
Translating logics for coalgebras.
In M. Wirsing, D. Pattinson, and R. Hennicker, editors, Recent
Trends in Algebraic Developement Techniques, volume 2755 of Lecture
Notes in Comp. Sci., pages 397-412, 2002.
[ bib |
.pdf ]
|
|
[43]
|
A. Kurz and D. Pattinson.
Definability, canonical models, compactness for finitary coalgebraic
modal logic.
In L. Moss, editor, Coalgebraic Methods in Computer Science
(CMCS 2002), volume 65.1 of Electr. Notes in Theoret. Comp. Sci.,
pages 1-21, 2002.
[ bib |
.pdf ]
|
|
[44]
|
D. Pattinson.
Semantical Principles in the Modal Logic of Coalgebras.
In H. Reichel and A. Ferreira, editors, Proc. 18th Symposium on
Theoretical Aspects of Computer Science (STACS 2001), volume 2010 of
Lecture Notes in Comp. Sci., pages 514-526, 2001.
[ bib |
.pdf ]
|
|
[45]
|
D. Pattinson.
Modal languages for coalgebras in a topological setting.
In U. Montanari, editor, Coalgebraic Methods in Computer Science
(CMCS 2001), volume 44.1 of Electr. Notes in Theoret. Comp. Sci.,
pages 1-14, 2001.
[ bib |
.pdf ]
|
|
[46]
|
D. Pattinson.
Modal logic for rewriting theories.
In K. Futatsugi, editor, The 3rd International Workshop on
Rewriting Logic and its Applications, volume 36 of Electr. Notes in
Theoret. Comp. Sci., 2001.
[ bib |
.pdf ]
|
|
[47]
|
D. Pattinson.
Towards coalgebraic specification of rewrite theories.
In M. V. Cengarle, editor, Requirements, Design, Correct
Construction and Verification, volume 11 of Fast Reihe
Softwaretechnik, 2000.
9 pages.
[ bib |
.pdf ]
|
|
[48]
|
A. Kurz and D. Pattinson.
Notes on coalgebras, co-fibrations and concurrency.
In H. Reichel, editor, Coalgebraic Methods in Computer Science
(CMCS 2000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.
34 pages.
[ bib |
.pdf ]
|