Solving Binary CSP Using Computational Systems
Open Access
- 1 January 1996
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 4, 246-265
- https://doi.org/10.1016/s1571-0661(04)00042-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An arc-consistency algorithm optimal in the number of constraint checksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Incremental querying in the concurrent CLP language IFD-Constraint PandoraPublished by Association for Computing Machinery (ACM) ,1996
- On the use of constraints in automated deductionPublished by Springer Nature ,1995
- Arc-consistency and arc-consistency againArtificial Intelligence, 1994
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- Consistency in networks of relationsArtificial Intelligence, 1977
- New Programming Languages for Artificial Intelligence ResearchACM Computing Surveys, 1974
- REF-ARF: A system for solving problems stated as proceduresArtificial Intelligence, 1970
- On Canonical Forms and SimplificationJournal of the ACM, 1970