A quantitative solution to Constraint Satisfaction Problem (CSP)
- 1 December 1994
- journal article
- research article
- Published by Springer Nature in New Generation Computing
- Vol. 13 (1) , 99-115
- https://doi.org/10.1007/bf03038310
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Global optimization for satisfiability (SAT) problemIEEE Transactions on Knowledge and Data Engineering, 1994
- Local search for satisfiability (SAT) problemIEEE Transactions on Systems, Man, and Cybernetics, 1993
- A novel discrete relaxation architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Efficient local search for very large-scale satisfiability problemsACM SIGART Bulletin, 1992
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Backtrack programming techniquesCommunications of the ACM, 1975
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960