Sciweavers

2062 search results - page 105 / 413
» Derivatives of Logical Formulas
Sort
View
ECAI
2010
Springer
15 years 5 months ago
ProbLog Technology for Inference in a Probabilistic First Order Logic
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
Maurice Bruynooghe, Theofrastos Mantadelis, Angeli...
129
Voted
LMCS
2006
119views more  LMCS 2006»
15 years 3 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 1 months ago
Temporal logic control of discrete-time piecewise affine systems
Abstract-- We consider the problem of controlling a discretetime piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over linear predi...
Boyan Yordanov, Calin Belta
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
15 years 9 months ago
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
Luca de Alfaro, Marco Faella, Thomas A. Henzinger,...
SAT
2004
Springer
90views Hardware» more  SAT 2004»
15 years 9 months ago
Encoding Global Unobservability for Efficient Translation to SAT
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
Miroslav N. Velev