Sciweavers

3044 search results - page 92 / 609
» Linear logical approximations
Sort
View
SYNASC
2007
IEEE
138views Algorithms» more  SYNASC 2007»
14 years 3 months ago
Some Applications of Weakly Picard Operators
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
Ioan A. Rus
FSTTCS
2004
Springer
14 years 2 months ago
Who is Pointing When to Whom?
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
Dino Distefano, Joost-Pieter Katoen, Arend Rensink
JIRS
2006
87views more  JIRS 2006»
13 years 9 months ago
A Comparison of Fuzzy and CPWL Approximations in the Continuous-time Nonlinear Model-predictive Control of Time-delayed Wiener-t
This paper deals with a novel method of continuous-time model-predictive control for nonlinear time-delayed systems. The problems relating to time delays are solved by incorporatin...
Simon Oblak, Igor Skrjanc
LCC
1994
213views Algorithms» more  LCC 1994»
14 years 1 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...
JELIA
1998
Springer
14 years 1 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche