Results 11 to 20 of about 1,522 (259)
Weighted versus Probabilistic Logics [PDF]
, 2009 While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other ...
Gastin, Paul, Bollig, Benedikt
openaire +2 more sources
A unifying survey on weighted logics and weighted automata [PDF]
Soft Computing, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gastin, Paul, Monmege, Benjamin
openaire +3 more sources
Weighted automata and weighted logics with discounting
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, George Rahonis
openaire +3 more sources
Definable transductions and weighted logics for texts [PDF]
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathissen, Christian +1 more
openaire +2 more sources
Expressiveness and Decidability of Weighted Automata and Weighted Logics.
, 2020 Automata theory, one of the main branches of theoretical computer science, established its roots in the middle of the 20th century. One of its most fundamental concepts is that of a finite automaton, a basic yet powerful model of computation. In essence, finite automata provide a method to finitely represent possibly infinite sets of strings.
Paul, Erik
openaire +5 more sources
Typology of axioms for a weighted modal logic
International Journal of Approximate Reasoning, 2017 This paper introduces and studies extensions of modal logics by investigating the soundness of classical modal axioms in a weighted framework. It discusses the notion of relevant weight values, in a specific weighted Kripke semantics and exploits accessibility relation properties.
Legastelois, Bénédicte +2 more
openaire +3 more sources
Logical Characterizations of Weighted Complexity Classes [PDF]
Fagin's seminal result characterizing $\mathsf{NP}$ in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted) models of computations.
Badia G., Droste M., Noguera C., Paul E.
openaire +8 more sources
Fuzzy Logic Method for the Speed Estimation in All-Wheel Drive Electric Racing Vehicles
Communications, 2021 This paper presents a method for the vehicle speed estimation with a Fuzzy Logic based algorithm. The algorithm acquires the measurements of the yaw rate, steering angle, wheel velocities and exploits a set of five Fuzzy Logics dedicated to different ...
Angelo Bonfitto +3 more
doaj +1 more source
Conditional Belief, Knowledge and Probability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 A natural way to represent beliefs and the process of updating beliefs is presented by Bayesian probability theory, where belief of an agent a in P can be interpreted as a considering that P is more probable than not P. This paper attempts to get at the
Jan van Eijck, Kai Li
doaj +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source