4940 search results - page 273 / 988 » On the Complexity of Universal Programs |
195
click to vote
RR
2010
Springer
15 years 5 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
188
click to vote
ICCS
2005
Springer
16 years 3 days ago
2005
Springer
In this paper we describe our recent use of genetic programming methods to automatically discover CA rule sets that produce self-replication of arbitrary given structures. Our init...
163
click to vote
LPNMR
1997
Springer
15 years 10 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
288
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
156
click to vote
ECTEL
2007
Springer
16 years 23 days ago
2007
Springer
Most Higher Education institutions are now embracing e-learning to some extent. Some have instigated institution-wide e-learning initiatives, whilst others are engaging in the use ...