Sciweavers

3670 search results - page 260 / 734
» Linear Recursive Functions
Sort
View
ECAI
1992
Springer
15 years 10 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
ICDT
2010
ACM
194views Database» more  ICDT 2010»
15 years 8 months ago
Bag Equivalence of XPath Queries
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
Sara Cohen, Yaacov Y. Weiss
BIOSYSTEMS
2008
146views more  BIOSYSTEMS 2008»
15 years 6 months ago
The autonomy of biological individuals and artificial models
This paper aims to offer an overview of the meaning of autonomy for biological individuals and artificial models rooted in a specific perspective that pays attention to the histor...
Alvaro Moreno, Arantza Etxeberria, Jon Umerez
CORR
2004
Springer
100views Education» more  CORR 2004»
15 years 6 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
JUCS
2002
90views more  JUCS 2002»
15 years 6 months ago
How Large is the Set of Disjunctive Sequences?
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
Ludwig Staiger