Forward checking and intelligent backtracking
type: Item
instance of: scholarly article
title: Forward checking and intelligent backtracking
zbMATH Open document ID: 0688.68048
DOI: 10.1016/0020-0190(89)90035-5
author: D. A. Wolfram
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4128394
zbMATH Keywords: intelligent backtracking
zbMATH Keywords: search rearrangement
zbMATH Keywords: computational complexity
zbMATH Keywords: forward checking
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90035-5
OpenAlex ID: W2048954164
cites work: An execution model for exploiting AND-parallelism in logic programs
cites work: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
cites work: Consistency in networks of relations
cites work: Intractable unifiability problems and backtracking
Recommended article: Formal Methods in Computer-Aided Design
Recommended article: Q3759966
Recommended article: Q4375758
Recommended article: Toward the concept of backtracking computation
Recommended article: Q4386920
Recommended article: Efficient intelligent backtracking using linear programming
Recommended article: Q3373594
Recommended article: Intelligent backtracking in \(\text{CLP}(\Re)\)
Recommended article: Q3741017
description: scientific article; zbMATH DE number 4128394