Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

DLT
2009

favoriteEmaildiscussreport

134views Theoretical Computer Science» more DLT 2009»

Weighted versus Probabilistic Logics

13 years 2 months ago

Weighted versus Probabilistic Logics

Download www.lsv.ens-cachan.fr

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 quantitative extensions such as probabilistic CTL. We establish expressiveness results on our logics giving translations from weighted and probabilistic CTL into weighted MSO.

Benedikt Bollig, Paul Gastin

Real-time Traffic

DLT 2009 | Logics | Probabilistic Ctl | Pure Boolean Setting | Theoretical Computer Science |

claim paper

Related Content

» Learning Directed Probabilistic Logical Models OrderingSearch Versus StructureSearch

» Absolute versus probabilistic classification in a logical setting

» Additive versus Multiplicative Clause Weighting for SAT

» Weighted Automata and Weighted Logics

» Markov logic networks

» On the Problem of Weighted MaxDLSAT and its Application to Image Labeling

» Toward Markov Logic with Conditional Probabilities

» Probabilistic Logical Information Retrieval for Content Hypertext and Database Querying

» Probabilistic Neural Logic Network Learning Taking Cues from NeuroCognitive Processes

Post Info
More Details (n/a)

Added	17 Feb 2011
Updated	17 Feb 2011
Type	Journal
Year	2009
Where	DLT
Authors	Benedikt Bollig, Paul Gastin

Comments (0)