1449 search results - page 109 / 290 » Finiteness results for sigmoidal |
186
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
159
click to vote
AAAI
2004
15 years 7 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
122
click to vote
FLAIRS
2004
15 years 7 months ago
2004
We extend the basic axiomatization of interval convex relations by Allen and Hayes with unbounded intervals. Unbounded intervals include since intervals with a finite beginning po...
164
click to vote
EACL
2003
ACL Anthology
15 years 7 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
153
click to vote
ACL
1998
15 years 7 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...