Results 1 to 10 of about 20,953 (186)
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science, 1988 A (finite) Kripke structure is a triple \(M=\), where S is the (finite) set of states, \(R\subseteq S\times S\) is a (total) transition relation and \({\mathcal L}\) is a valuation from states to the set of subsets of atomic formulas of a given (propositional) temporal logic theory \({\mathcal T}\). The chosen logics are \(CTL^*\) [\textit{E.
Browne, M.C. +2 more
openaire +4 more sources
Checking Interval Properties of Computations
, 2015 Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by checking the ...
Molinari, A. +4 more
core +1 more source
Decidability of quantified propositional intuitionistic logic and S4 on trees
, 2002 Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions.
D. Gabbay +9 more
core +1 more source
Logic Programming for Finding Models in the Logics of Knowledge and its Applications: A Case Study
, 2010 The logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations ...
C. BARAL +5 more
core +1 more source
State space c-reductions for concurrent systems in rewriting logic [PDF]
, 2011 We present c-reductions, a state space reduction technique. The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system.
A.F. Donaldson +13 more
core +2 more sources
Intransitive Temporal Multi-agent Logic with Agents’ Multi-valuations. Decidability
Известия Иркутского государственного университета: Серия "Математика"We study intransitive temporal multi-agent logic with agents’ multi-valuations for letters and formulas. In previous wide accepted research the time and knowledge primarily were modeled by Kripke models with structure looking as simply a single time ...
K. V. Grekovich +2 more
doaj +1 more source
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
, 2015 Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases.
Molinari, A., Montanari, A., Peron, A.
core +1 more source
Syntax for free: representing syntax with binding using parametricity [PDF]
, 2009 We show that, in a parametric model of polymorphism, the type ∀ α. ((α → α) → α) → (α → α → α) → α is isomorphic to closed de Bruijn terms. That is, the type of closed higher-order abstract syntax terms is isomorphic to a concrete representation.
B.E. Aydemir +11 more
core +2 more sources
Intuitionistic validity in T-normal Kripke structures
Annals of Pure and Applied Logic, 1993 Given any classical first-order theory \(T\), the author considers the set \({\mathcal H} T\) of all first-order sentences that are valid in every \(T\)- normal Kripke structure. A Kripke structure may be considered as a partially ordered set of classical structures and it is called \(T\)-normal iff each of these classical structures is a classical ...
openaire +1 more source
Context Dependence, MOPs,WHIMs and procedures Recanati and Kaplan on Cognitive Aspects in Semantics [PDF]
, 2015 After presenting Kripke’s criticism to Frege’s ideas on context dependence of thoughts, I present two recent attempts of considering cognitive aspects of context dependent expressions inside a truth conditional pragmatics or semantics: Recanati’s non ...
C Penco +21 more
core +1 more source