Results 1 to 10 of about 276 (139)
Convolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras [PDF]
Logical Methods in Computer Science, 2021 Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of relational convolution
Brijesh Dongol +2 more
doaj +1 more source
Possibilistic Cost Computation Tree Logic and Related Equivalence, Abstraction Technique
IEEE Access, 2023 Recently, probabilistic Kripke structures have been used to represent uncertain systems; nevertheless, important transition costs were ignored in earlier studies, making it impossible to model some uncertain systems with costs.
Hui Deng, Yuzhe Zhang, Zhilong Huang
doaj +1 more source
Kripke Semantics for Martin-L\"of's Extensional Type Theory [PDF]
Logical Methods in Computer Science, 2011 It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly,
Steve Awodey, Florian Rabe
doaj +1 more source
Towards a Proof Theory of G\"odel Modal Logics [PDF]
Logical Methods in Computer Science, 2011 Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
George Metcalfe, Nicola Olivetti
doaj +1 more source
The expressive power of modal logic with inclusion atoms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Lauri Hella, Johanna Stumpf
doaj +1 more source
Empirical Negation, Co-negation and Contraposition Rule I: Semantical Investigations
Bulletin of the Section of Logic, 2020 We investigate the relationship between M. De's empirical negation in Kripke and Beth Semantics. It turns out empirical negation, as well as co-negation, corresponds to different logics under different semantics.
Satoru Niki
doaj +1 more source
Quantified CTL: Expressiveness and Complexity [PDF]
Logical Methods in Computer Science, 2014 While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to ...
François Laroussinie, Nicolas Markey
doaj +1 more source
Local Search and the Evolution of World Models
Topics in Cognitive Science, EarlyView., 2023 Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source
Logical Methods in Computer Science, 2015 Given a Kripke structure M and CTL formula $\varphi$, where M does not satisfy $\varphi$, the problem of Model Repair is to obtain a new model M' such that M' satisfies $\varphi$.
George Chatzieleftheriou +3 more
doaj +1 more source
On Constructive Connectives and Systems [PDF]
Logical Methods in Computer Science, 2010 Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty.
Arnon Avron, Ori Lahav
doaj +1 more source