Sciweavers

2062 search results - page 21 / 413
» Derivatives of Logical Formulas
Sort
View
ACTA
2004
97views more  ACTA 2004»
13 years 9 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
TPLP
2002
90views more  TPLP 2002»
13 years 9 months ago
Properties of input-consuming derivations
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
CDC
2008
IEEE
146views Control Systems» more  CDC 2008»
14 years 4 months ago
Control formula for nonlinear systems subject to convex input constraints using control Lyapunov functions
— In this paper, we propose a two-step controller design method with control Lyapunov functions (CLFs) for nonlinear systems with convex input constraints. In the first step, we...
Yasuyuki Satoh, Hisakazu Nakamura, Nami Nakamura, ...
AMAI
2008
Springer
13 years 9 months ago
Stable models and difference logic
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
Ilkka Niemelä
SIGSOFT
2000
ACM
14 years 2 months ago
Automating first-order relational logic
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
Daniel Jackson