2722 search results - page 514 / 545 » Automating Language Evolution |
141
click to vote
LPAR
2001
Springer
15 years 6 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
123
click to vote
LPAR
2001
Springer
15 years 6 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
124
click to vote
STOC
1999
ACM
15 years 6 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
121
click to vote
ESSLLI
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
131
click to vote
KR
1998
Springer
15 years 6 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...