Constraint satisfaction — Algorithms and complexity analysis
- 11 August 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 55 (3) , 171-178
- https://doi.org/10.1016/0020-0190(95)00089-u
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Using Pivot Consistency to Decompose and Solve Functional CSPsJournal of Artificial Intelligence Research, 1995
- A quantitative solution to Constraint Satisfaction Problem (CSP)New Generation Computing, 1994
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problemsArtificial Intelligence, 1994
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Characterising tractable constraintsArtificial Intelligence, 1994
- An exact algorithm for the constraint satisfaction problem: Application to logical inferenceInformation Processing Letters, 1993
- From local to global consistencyArtificial Intelligence, 1992
- An optimal k-consistency algorithmArtificial Intelligence, 1989
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- Synthesizing constraint expressionsCommunications of the ACM, 1978