273 search results - page 18 / 55 » A Compositional Semantics for Conditional Term Rewriting Sys... |
ACL
1998
15 years 1 months ago
1998
: The goal of this paper is to provide computable account for some definite descriptions. To this end, we define in terms of inclusion the notion of distinguishing description and ...
101
click to vote
CONCUR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
WIDM
2003
ACM
15 years 4 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
LACL
2005
Springer
15 years 5 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...