نتایج جستجو برای: continuous logic

تعداد نتایج: 407573  

2014
Lei Song Lijun Zhang Jens Chr. Godskesen

In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL). For strong bisimulation, it is well known that it is strictly finer than CSL equivalence. In this paper we propose strong and weak bisimulations for CTMDPs and show...

1997
Manuel Valenzuela J. C. Maxwell

This report describes the fuzzy classiier system and a new payoo distribution scheme that performs true reinforcement learning. The fuzzy classiier system is a crossover between learning classiier systems and fuzzy logic controllers. By the use of fuzzy logic, the fuzzy classiier system allows for variables to take continuous values, and thus, could be applied to the identiication and control o...

2017
Thomas Brihaye Gilles Geeraerts Hsi-Ming Ho Benjamin Monmege

It has been argued that the most suitable semantic model for real-time formalisms is the nonnegative real line (signals), i.e. the continuous semantics, which naturally captures the continuous evolution of system states. Existing tools like Uppaal are, however, based on ω-sequences with timestamps (timed words), i.e. the pointwise semantics. Furthermore, the support for logic formalisms is very...

2016
Steffen Michels Arjen Hommersom Peter J. F. Lucas

Probabilistic logics, especially those based on logic programming (LP), are gaining popularity as modelling and reasoning tools, since they combine the power of logic to represent knowledge with the ability of probability theory to deal with uncertainty. In this paper, we propose a hybrid extension for probabilistic logic programming, which allows for exact inference for a much wider class of c...

1999
I.Karafyllidis S. Mavridis D. Soudris A. Thanailakis

A new method for estimating the glitching contribution to the power dissipation of multilevel combinational logic circuits based on complex-time cellular automata is presented for the first time. To bridge the gap between continuous time, in which the combinational logic circuits operate, and the discrete time, in which cellular automata operate, the concept of complex time is introduced. Both ...

2003
Vincent Danos Josée Desharnais

We develop in this abstract a probabilistic fixpoint logic for Labeled Markov Processes (LMPs). One reason for doing this comes from [2, 3]. There, it was shown that the LMP logic characterizing bisimulation can be used to define in a natural way finite-state approximants of LMPs. An extension of this logic with fixpoints such as the one we propose allows for stronger notions of approximants. S...

2015
AMANDA VIDAL

Modal fuzzy logics is a research topic that has attracted increasing attention in the last years. Several papers have been published treating different aspects, see for instance [6] for a modal expansion of Lukasiewicz logic, [3, 4, 2] for modal expansions of Gödel fuzzy logic, [1] for modal logics over finite residuated lattices, and more recently [7] for a modal expansion of Product fuzzy log...

2005
Rafael Fierro

A hybrid control system is proposed for regulating an unknown nonlinear plant. The interface between the continuous-state plant and the discrete-event supervisor is designed using a fuzzy logic approach. The fuzzy logic interface partitions the continuous-state space into a finite number of regions. In each region, the original unknown nonlinear plant is approximated by a fuzzy logic-based line...

Journal: :J. Symb. Log. 2010
Julien Melleray

We reformulate, in the context of continuous logic, an oscillation theorem proved by G. Hjorth and give a proof of the theorem in that setting which is similar to, but simpler than, Hjorth’s original one. The point of view presented here clarifies the relation between Hjorth’s theorem and first-order logic.

2007
Jennifer M. Davoren Paulo Tabuada

We introduce a notion of bisimulation equivalence between general flow systems, which include discrete, continuous and hybrid systems, and compare it with similar notions in the literature. The interest in the proposed notion is based on our main result, that the temporal logic GFL – an extension to general flows of the well-known computation tree logic CTL – is semantically preserved by this e...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید