Sciweavers

971 search results - page 21 / 195
» Approximate Satisfiability and Equivalence
Sort
View
IPL
2000
94views more  IPL 2000»
13 years 9 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
14 years 3 months ago
Behavioral Extensions of Institutions
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
Andrei Popescu, Grigore Rosu
CORR
2011
Springer
135views Education» more  CORR 2011»
13 years 1 months ago
On the Limitations of Provenance for Queries With Difference
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive q...
Yael Amsterdamer, Daniel Deutch, Val Tannen
ISCAS
2003
IEEE
86views Hardware» more  ISCAS 2003»
14 years 3 months ago
PWL approximation of dynamical systems: an example
The piecewise-linear approximation technique developed by Juli´an et al. in the past few years is applied to dynamical systems dependent on given numbers of state variables and p...
Marco Storace, Oscar De Feo
TRS
2008
13 years 9 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa