Title

Intelligent Backtracking In Clp(R)

Authors

Authors

J. J. Burg; S. D. Lang;C. E. Hughes

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Ann. Math. Artif. Intell.

Keywords

Computer Science, Artificial Intelligence; Mathematics, Applied

Abstract

CLP(R) is a constraint logic programming language in which constraints can be expressed in the domain of real numbers. Computation in this specialized domain gives access to information useful in intelligent backtracking. In this paper, we present an efficient constraint satisfaction algorithm for linear constraints in the real number domain and show that our algorithm directly generates minimal sets of conflicting constraints when failures occur. We demonstrate how information gleaned during constraint satisfaction can be integrated with unification failure analysis. The resulting intelligent backtracking method works in the context of a two-sorted domain, where variables can be bound to either structured terms or real number expressions. We discuss the implementation of backtracking and show examples where the benefit of pruning the search tree outweighs the overhead of failure analysis.

Journal Title

Annals of Mathematics and Artificial Intelligence

Volume

17

Issue/Number

3-4

Publication Date

1-1-1996

Document Type

Article; Proceedings Paper

Language

English

First Page

189

Last Page

211

WOS Identifier

WOS:A1996VV96100002

ISSN

1012-2443

Share

COinS