3446 search results - page 59 / 690 » A Reasoning Algorithm for pD* |
111
click to vote
SPAA
1995
ACM
15 years 5 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
AUSAI
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
CADE
1992
Springer
15 years 5 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
118
click to vote
ESWS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
127
click to vote
GEOS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...