A backtracking algorithm with element order selection is presented, and its efficiency discussed in relation both to standard examples and to examples concerning relation-preserving maps which the algorithm was derived to solve.

While the worst case computational properties of Allen s calculus for qualitative temporal reasoning have been analyzed quite extensively the determination of the empirical e ciency of algorithms for solving the con sistency problem in this calculus has received only little research atten tion In this paper we will demonstrate that using the ORD Horn class in Ladkin and Reinefeld s backtracking...

This thesis aims at exploring the potential of heuristic search algorithms for Abstract Argumentation. Therefore specific backtracking search algorithms are presented, which support the use of heuristics. Thereafter several heuristics are defined which have been implemented as part of this thesis. These will then be experimentally compared among each other and with other approaches to Abstract ...

While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical eeciency of algorithms for solving the consistency problem in this calculus has received only little research attention. In this paper, we will demonstrate that using the ORD-Horn class in Ladkin and Reinefeld's backtrackin...

In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.

I highlight some inefficiencies of Graphplan’s backward search algorithm, and describe how these can be eliminated by adding explanation-based learning and dependency-directed backtracking capabilities to Graphplan. I will then demonstrate the effectiveness of these augmentations by describing results of empirical studies that show dramatic improvements in run-time ( 100x speedups) as well as s...

In this paper we consider the optimal sequencing of vehicles along multiple assembly lines We present a constraint based model of the problem with hard and soft constraints An advantage of a constraint based approach is that the model is declarative and there is a separation between the model and an algorithm for solving the model As a result once the model had been de ned we could experiment w...