Sciweavers

9730 search results - page 59 / 1946
» Relating models of backtracking
Sort
View
CP
2005
Springer
15 years 3 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
ICLP
1999
Springer
15 years 2 months ago
A Linear Tabling Mechanism
Delaying-based tabling mechanisms, such as the one adopted in XSB, are nonlinear in the sense that the computation state of delayed calls has to be preserved. In this paper, we pr...
Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai ...
CONCUR
2008
Springer
14 years 11 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
14 years 9 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
CONTEXT
2007
Springer
15 years 4 months ago
On Relating Heterogeneous Elements from Different Ontologies
Chiara Ghidini, Luciano Serafini, Sergio Tessaris