4966 search results - page 101 / 994 » its 2010 |
144
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
159
click to vote
AAAI
2010
15 years 6 months ago
2010
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
158
click to vote
AAAI
2010
15 years 6 months ago
2010
An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots ...
130
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
efined abstract representation of a semantic path that respects the ontological classes of a particular semantic network. A discrete "walker" utilizes the grammar to dete...
138
click to vote
EJC
2010
15 years 6 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...