Sciweavers

25 search results - page 3 / 5
» A Model Complete Theory of Valued D-Fields
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
12 years 12 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
EUSFLAT
2009
134views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
Flow Line Systems with Possibilistic Data: a System with Waiting Time in Line Uncertain
This paper proposes to analyze two flow line systems in which we include possibilistic data -the priority-discipline is possibilistic instead of probabilistic- and measure the perf...
David de la Fuente, María José Pardo
LICS
2006
IEEE
15 years 3 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
77
Voted
FATES
2004
Springer
15 years 1 months ago
Test Generation Based on Symbolic Specifications
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse
CONTEXT
2005
Springer
15 years 3 months ago
'I' as a Pure Indexical and Metonymy as Language Reduction
Most direct reference theorists believe that ‘I’ is a pure indexical. This means that when ‘I’ is uttered, it contributes with the speaker to what is said. But, from some c...
Esther Romero, Belén Soria