2082 search results - page 66 / 417 » Change Paths in Reasoning! |
ESSLLI
2009
Springer
13 years 5 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
AAAI
2007
13 years 10 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
EOR
2006
13 years 7 months ago
2006
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible ...