Connection calculi benefit from a goal-oriented proof search, but are in general not proof confluent. A substantial amount of backtracking is required, which significantly affects the time complexity of the proof search. This paper presents a simple strategy for effectively restricting backtracking in connection calculi. In combination with a few basic techniques it provides the basis for a ref...

Pathological dependency cycles occur in state-space planners when control structures cannot efficiently determine a maximal matching for a bipartite operator/binding graph. Without proper search control, the planner will require many computationally expensive backtracks to arrive at a solution. We present a method for improving planning efficiency in the midst of pathological dependency cycles ...

We introduce a quasi-Newton method with block updates called Block BFGS. We show that this method, performed with inexact Armijo-Wolfe line searches, converges globally and superlinearly under the same convexity assumptions as BFGS. We also show that Block BFGS is globally convergent to a stationary point when applied to non-convex functions with bounded Hessian, and discuss other modifications...

Efficient utilization of time and effort is essential in Personnel scheduling problems to evenly balance the workload among the people and attempt to satisfy the personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a different value for it. So here the mo...

In this work, the dynamics of the primary and the Johari-Goldstein (JG) processes are studied with dielectric spectroscopy. We found the relaxations at glass transition temperature in polyphenylglycidylether and diglycidyl ether of bisphenol-A to be strongly correlated over a wide temperature T and pressure P range. Analysing the temperature and pressure behaviour of the and (JG) -processes...

Real-life dynamic problems may lead to inconsistent constraints systems for which a solution must be found even if constraints have to be relaxed. In this paper, we propose a best-first search to handle such problems. Classical backtracking search algorithms are extended in two ways: identification of good backtrack points as in Intelligent Backtracking techniques and maximum use of independant...

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classi ed as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-a...