Results 221 to 230 of about 1,522 (259)

Logics of Belief over Weighted Structures

Lecture Notes in Computer Science, 2011
We explore logics of belief over weighted structures under the supposition that everything believed by an agent has a weight in the range of agent's belief. We first define static graded belief logics which are complete with respect to the class of all weighted frames.
Ma Minghui
exaly   +2 more sources

Weighted logics for artificial intelligence – an introductory discussion [PDF]

International Journal of Approximate Reasoning, 2014
International audienceBefore presenting the contents of the special issue, we propose a structured introductory overview of a landscape of the weighted logics (in a general sense) that can be found in the Artificial Intelligence literature, highlighting ...
Didier Dubois, Lluís Godo, Henri Prade   +2 more
exaly   +2 more sources

Weighted automata and weighted MSO logics for average and long-time behaviors

Information and Computation, 2012
Weighted automata model quantitative aspects of systems like memory or power consumption. Recently, Chatterjee, Doyen, and Henzinger introduced a new kind of weighted automata which compute objectives like the average cost or the long-time peak power ...
Ingmar Meinecke
exaly   +2 more sources

Weighted Linear Dynamic Logic

International Journal of Foundations of Computer Science, 2023
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger theorem. Surprisingly, the equivalence does not require any restriction to our weighted LDL.
Manfred Droste, Gustav Grabolle, George Rahonis   +2 more
openaire   +1 more source

Weighted automata and weighted logics on infinite words

Russian Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, George Rahonis
openaire   +2 more sources

Weighted automata and logics meet computational complexity

Information and Computation
Complexity classes such as $\#\mathbf{P}$, $\oplus\mathbf{P}$, $\mathbf{GapP}$, $\mathbf{OptP}$, $\mathbf{NPMV}$, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in terms of a class
Peter Kostolányi
exaly   +2 more sources

Weighted Picture Automata and Weighted Logics

Theory of Computing Systems, 2006
The author introduces a weighted MSO logic for defining series of pictures; here a picture is a finite rectangular array of symbols from a given (finite) alphabet. The main results of the paper show that the picture series over any commutative semiring definable by this logic are the same as the series recognized by weighted two-dimensional on-line ...
openaire   +1 more source

Weighted Register Automata and Weighted Logic on Data Words

Theoretical Computer Science, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parvaneh Babari, Manfred Droste, Vitaly Perevoshchikov   +2 more
openaire   +2 more sources

Weighted Muller Tree Automata and Weighted Logics

J. Autom. Lang. Comb., 2007
Journal of Automata, Languages and Combinatorics, Volume 12, Number 4, 2007, 455 ...
openaire   +1 more source

Weighted Automata and Logics on Graphs

2015
Weighted automata model quantitative features of the behavior of systems and have been investigated for various structures like words, trees, traces, pictures, and nested words. In this paper, we introduce a general model of weighted automata acting on graphs, which form a quantitative version of Thomas’ unweighted model of graph acceptors. We derive a
Manfred Droste, Stefan Dück
openaire   +1 more source