86 search results - page 7 / 18 » Definability in Substructure Orderings, II: Finite Ordered S... |
ICLP
1994
Springer
13 years 11 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
IEICET
2008
13 years 7 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
CCCG
2010
13 years 9 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Choquet integral w.r.t. a capacity can be seen in the finite case as a parsimonious linear interpolator between vertices of [0, 1]n. We take this basic fact as a starting poin...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...