| http://dbpedia.org/ontology/abstract
|
In computer science, an interchangeability … In computer science, an interchangeability algorithm is a technique used to more efficiently solve constraint satisfaction problems (CSP). A CSP is a mathematical problem in which objects, represented by variables, are subject to constraints on the values of those variables; the goal in a CSP is to assign values to the variables that are consistent with the constraints. If two variables A and B in a CSP may be swapped for each other (that is, A is replaced by B and B is replaced by A) without changing the nature of the problem or its solutions, then A and B are interchangeable variables. Interchangeable variables represent a symmetry of the CSP and by exploiting that symmetry, the search space for solutions to a CSP problem may be reduced. For example, if solutions with A=1 and B=2 have been tried, then by interchange symmetry, solutions with B=1 and A=2 need not be investigated. The concept of interchangeability and the interchangeability algorithm in constraint satisfaction problems was first introduced by Eugene Freuder in 1991. The interchangeability algorithm reduces the search space of backtracking search algorithms, thereby improving the efficiency of NP-complete CSP problems.he efficiency of NP-complete CSP problems.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Interchangeability.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
40487993
|
| http://dbpedia.org/ontology/wikiPageLength
|
6525
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
941933674
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Constraint_satisfaction_problem +
, http://dbpedia.org/resource/Category:Constraint_programming +
, http://dbpedia.org/resource/Graph_coloring_problem +
, http://dbpedia.org/resource/NP-completeness +
, http://dbpedia.org/resource/Artificial_intelligence +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Feasible_region +
, http://dbpedia.org/resource/Backtracking_search +
, http://dbpedia.org/resource/Discrimination_tree +
, http://dbpedia.org/resource/File:Interchangeability.png +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Var +
, http://dbpedia.org/resource/Template:Orphan +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Constraint_programming +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Technique +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Interchangeability_algorithm?oldid=941933674&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Interchangeability.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Interchangeability_algorithm +
|
| owl:sameAs |
https://global.dbpedia.org/id/fNZF +
, http://rdf.freebase.com/ns/m.0102cn68 +
, http://dbpedia.org/resource/Interchangeability_algorithm +
, http://www.wikidata.org/entity/Q17092524 +
|
| rdf:type |
http://dbpedia.org/ontology/TopicalConcept +
|
| rdfs:comment |
In computer science, an interchangeability … In computer science, an interchangeability algorithm is a technique used to more efficiently solve constraint satisfaction problems (CSP). A CSP is a mathematical problem in which objects, represented by variables, are subject to constraints on the values of those variables; the goal in a CSP is to assign values to the variables that are consistent with the constraints. If two variables A and B in a CSP may be swapped for each other (that is, A is replaced by B and B is replaced by A) without changing the nature of the problem or its solutions, then A and B are interchangeable variables. Interchangeable variables represent a symmetry of the CSP and by exploiting that symmetry, the search space for solutions to a CSP problem may be reduced. For example, if solutions with A=1 and B=2 have beple, if solutions with A=1 and B=2 have be
|
| rdfs:label |
Interchangeability algorithm
|
