886 search results - page 95 / 178 » Reasoning with contextual graphs |
191
click to vote
TCOS
2010
15 years 4 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
136
click to vote
CSL
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
155
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
199
click to vote
ASP
2005
Springer
15 years 12 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
204
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Building on earlier attempts to characterise robot perception as a form of abduction, this paper presents a logical account of active visual perception in the context of an upper-...