Results 21 to 30 of about 16,014 (243)
Possibilistic Cost Computation Tree Logic and Related Equivalence, Abstraction Technique
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 fuzzy logics [PDF]
Soft Computing (2016)
Safari, Parvin, Salehi, Saeed
openaire +3 more sources
An automaton approach to Kripke semantics
We study the satis ability problem over axiomatic extensions of modal logic K, with an automata-theoretic point of view. We exhibit optimal subclasses of alternating tree automata, thus providing a new framework for the satis ability problem with frame constraints. Additionally, we clarify the correspondence between runs of automata and branches of the
Gaspard Douady
openalex +3 more sources
Empirical Negation, Co-negation and Contraposition Rule I: Semantical Investigations
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]
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
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
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]
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
Forensic Dynamic Lukasiewicz Logic [PDF]
A forensic dynamic $n$-valued Lukasiewicz logic $FDL_n$ is introduced on the base of $n$-valued Lukasiewicz logic $L_n$ and corresponding to it forensic dynamic $MV_n$-algebra ($FDL_n$-algebra), $1 < n < \omega$, which are algebraic counterparts of ...
Antonio Di Nola, Revaz Grigolia
doaj +1 more source

