611 search results - page 41 / 123 » Index Sets of Computable Structures with Decidable Theories |
SIGACT
2008
13 years 7 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
FCT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
ACL
1989
13 years 9 months ago
1989
This paper presents a computational model ofverb acquisitionwhich uses what we willcallthe principle of structured overeommitment to eliminate the need for negative evidence. The ...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...