Sciweavers

4513 search results - page 491 / 903
» Logic programming with satisfiability
Sort
View
MFPS
1993
15 years 10 months ago
Some Quasi-Varieties of Iteration Theories
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
Stephen L. Bloom, Zoltán Ésik
ESOP
2008
Springer
15 years 8 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
CCGRID
2010
IEEE
15 years 7 months ago
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
CDC
2009
IEEE
135views Control Systems» more  CDC 2009»
15 years 7 months ago
On stochastic receding horizon control with bounded control inputs
This paper is concerned with the problem of receding horizon control of discrete-time systems subject to possibly unbounded random noise inputs, while satisfying hard bounds on the...
Peter Hokayem, Debasish Chatterjee, John Lygeros
IJSN
2006
78views more  IJSN 2006»
15 years 6 months ago
An approach to synthesise safe systems
: Detectors are system components that identify whether the system is in a particular state. Detectors can be used to ensure arbitrary safety properties for systems, that is, they ...
Arshad Jhumka, Felix C. Freiling, Christof Fetzer,...