A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem (1996)

by Roberto J. Bayardo , Daniel P. Miranker
Venue:In Proceedings of the Thirteenth National Conference on Artificial Intelligence
Citations:77 - 2 self

Active Bibliography

7 Event-Based Decompositions for Reasoning about External Change in Planners – Jim Blythe - 1996
28 Backtracking algorithms for constraint satisfaction problems – Rina Dechter, Daniel Frost - 1999
376 Algorithms for Constraint Satisfaction Problems: A Survey – Vipin Kumar - 1992
1 Backtrack-Bounded Search in Polynomial Space – Roberto Bayardo, Jr., Daniel P. Miranker - 1994
955 Constraint Networks – Rina Dechter - 1992
49 Intelligent Backtracking On Constraint Satisfaction Problems: Experimental And Theoretical Results – Andrew B. Baker - 1995
827 Adaptive Constraint Satisfaction – J. E. Borrett, E. P. K. Tsang, N. R. Walsh - 1996
32 On the space-time trade-off in solving constraint satisfaction problems – Roberto J. Bayardo, Daniel P. Miranker - 1995
3 Representation and Reasoning with Non-Binary Constraints – Kostas Stergiou - 2001