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...
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...
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...
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,...
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...