| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Problem Solving, Control Methods, And Search (I.2.8) > Backtracking (I.2.8...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 23
Reviews about "Backtracking (I.2.8...)":
|
Date Reviewed |
| |
Formula caching in DPLL
Beame P., Impagliazzo R., Pitassi T., Segerlind N. ACM Transactions on Computation Theory (TOCT) 1(3): 1-33, 2010. Type: Article
The DPLL algorithm is a satisfiability-based algorithm. The authors consider in this paper the extension of the DPLL approach to satisfiability checking, by adding memoization, which means saving previously solved subproblems for later use (also...
|
Nov 30 2010 |
| |
Universal traversal sequences with backtracking
Koucky M. Journal of Computer and System Sciences 65(4): 717-726, 2002. Type: Article
This paper introduces the concept of exploration sequences (in guided walks through graphs), a modified version of traversal sequences, which share many of the same properties, but also exhibit some new ones like the ability to backtrack. The...
|
Oct 10 2003 |
| |
Backtracking algorithms for disjunctions of temporal constraints
Stergiou K., Koubarakis M. Artificial Intelligence 120(1): 81-117, 2000. Type: Article
Temporal constraints are important for a variety of problems in temporal reasoning, scheduling, and planning. Dechter, Meiri, and Pearl originally studied simple temporal constraint. The authors extend the framework of simple temporal constraints ...
|
Aug 1 2000 |
| |
Generating Hamiltonian circuits without backtracking from errors
Shufelt J., Berliner H. Theoretical Computer Science 132(1-2): 347-375, 1994. Type: Article
The knight’s tour problem is as follows: starting with a knight on a square of a chessboard, find a sequence of legal moves that will cause the knight to visit each square exactly once, finally returning to the initial square. Such a...
|
Apr 1 1996 |
| |
Analysis of Or-parallel execution models
Gupta G., Jayaraman B. ACM Transactions on Programming Languages and Systems 15(4): 659-680, 1993. Type: Article
The intrinsic parallelism present in logic programs, and more generally in nondeterministic programs, has over the years spurred the design and implementation of a wealth of execution models. Even if one limits oneself to OR parallelism, more...
|
Mar 1 1994 |
| |
A general framework for reason maintenance
McDermott D. Artificial Intelligence 50(3): 289-329, 1991. Type: Article
Reasoning maintenance systems (RMSs) are not inference engines but systems designed to store and relate information about beliefs. McDermott tries to bring out a general structure for RMSs. Thoroughly comparing his solution to some of the most...
|
Nov 1 1992 |
| |
Constraint relaxation may be perfect
Montanari U., Rossi F. (ed) Artificial Intelligence 48(2): 143-170, 1991. Type: Article
Many AI tasks can be formulated as constraint-satisfaction problems (CSPs), which involve the assignment of values to variables subject to a set of constraints. Constraint specification is an appropriate way to express declarative knowledge in...
|
Aug 1 1992 |
| |
Temporal constraint networks
Dechter R. (ed), Meiri I., Pearl J. Artificial Intelligence 49(1-3): 61-95, 1991. Type: Article
Suppose we have n events that took place in different moments of time X1,…, Xn and we have only approximate knowledge about these moments. This knowledge can be of several types. Sometimes we know...
|
Jul 1 1992 |
| |
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Dechter R. (ed) Artificial Intelligence 41(3): 273-312, 1990. Type: Article
Backtracking search is an important method for solving constraint problems. Dechter examines three different techniques to speed up this search: backjumping, learning, and cutset decomposition. She briefly describes these techniques and compares...
|
Oct 1 1990 |
| |
Why Prolog? Justifying logic programming for practical applications
Lazarev G., Prentice-Hall, Inc., Upper Saddle River, NJ, 1989.Type: Book (9789780139590405)
This outstanding new Prolog textbook is intended mainly for data-processing professionals who are already proficient in conventional computer languages like Pascal. As such. the book naturally begins with a first chapter overviewing the known...
|
Dec 1 1989 |
| |
|
|
| |
|
|
