Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Pattinson, Dirk"'
Publikováno v:
G\"ottlinger, M., Schr\"oder, L., & Pattinson, D. CSL 2021, Leibniz International Proceedings in Informatics (LIPIcs) (pp. 26:1-26:22)
Alternating-time temporal logic (ATL) and its extensions, including the alternating-time $\mu$-calculus (AMC), serve the specification of the strategic abilities of coalitions of agents in concurrent game structures. The key ingredient of the logic a
Externí odkaz:
http://arxiv.org/abs/2305.18795
Autor:
Görlitz, Oliver, Hausmann, Daniel, Humml, Merlin, Pattinson, Dirk, Prucker, Simon, Schröder, Lutz
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic and algorith
Externí odkaz:
http://arxiv.org/abs/2305.11015
A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected formula --
Externí odkaz:
http://arxiv.org/abs/2205.00448
Autor:
de Groot, Jim, Pattinson, Dirk
We give Hennessy-Milner classes for intuitionistic, dual-intuitionistic and bi-intuitionistic logic interpreted in intuitionistic Kripke models, and generalise these results to modal (dual- and bi-)intuitionistic logics. Our main technical tools are
Externí odkaz:
http://arxiv.org/abs/2105.01855
Autor:
de Groot, Jim, Pattinson, Dirk
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (July 14, 2022) lmcs:7026
We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we obtain comple
Externí odkaz:
http://arxiv.org/abs/2012.13858
We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does not require a tractable set of tableau rules for the instance log
Externí odkaz:
http://arxiv.org/abs/2009.00971
Autor:
Pattinson, Dirk, Mohammadian, Mina
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 1 (March 2, 2021) lmcs:5833
We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness assertions clas
Externí odkaz:
http://arxiv.org/abs/1910.04948
The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is non-expansive wrt.
Externí odkaz:
http://arxiv.org/abs/1906.00784
In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the distance i
Externí odkaz:
http://arxiv.org/abs/1810.04722
This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a finitely generated carrier for an endofunctor on a locally finitely prese
Externí odkaz:
http://arxiv.org/abs/1802.08070