This HTML5 document contains 51 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n10http://dbpedia.org/resource/File:
n12http://www.ics.uci.edu/~dechter/books/
foafhttp://xmlns.com/foaf/0.1/
n19https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n15http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://www.springerlink.com/(rqc54x55rqwetq55eco03ymp)/app/home/contribution.asp%3Freferrer=parent&backto=issue,5,61;journal,1765,3346;linkingpublicationresults,1:
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n18https://www.springer.com/sgw/cda/frontpage/

Statements

Subject Item
dbr:Hybrid_algorithm_(constraint_satisfaction)
dbo:wikiPageWikiLink
dbr:Constraint_satisfaction_dual_problem
Subject Item
dbr:Decomposition_method_(constraint_satisfaction)
dbo:wikiPageWikiLink
dbr:Constraint_satisfaction_dual_problem
Subject Item
dbr:Constraint_satisfaction_dual_problem
rdfs:label
Constraint satisfaction dual problem
rdfs:comment
The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such problems. The join graphs and join trees of a constraint satisfaction problem are graphs representing its dual problem or a problem obtained from the dual problem removing some redundant constraints.
foaf:depiction
n15:Csp-dual-graph-1.svg n15:Csp-dual-graph-2.svg n15:Csp-dual-2.svg n15:Csp-dual-3.svg n15:Csp-dual-1.svg
dcterms:subject
dbc:Constraint_programming
dbo:wikiPageID
4081635
dbo:wikiPageRevisionID
1000084380
dbo:wikiPageWikiLink
dbr:Constraint_satisfaction_problem dbr:Join-tree_clustering dbr:Graph_(graph_theory) dbc:Constraint_programming n10:Csp-dual-graph-2.svg n10:Csp-dual-1.svg n10:Csp-dual-2.svg n10:Csp-dual-3.svg n10:Csp-dual-graph-1.svg dbr:Algorithm dbr:Chordal_graph dbr:Max-cardinality_ordering dbr:Maximal_clique dbr:Decomposition_method_(constraint_satisfaction) dbr:Spanning_tree_(mathematics) dbr:Hidden_transformation dbr:Binary_constraint
dbo:wikiPageExternalLink
n11:105633,1 n12:index.html n18:0,11855,5-0-22-1519914-0,00.html%3Freferer=www.springer.de%2Fcgi-bin%2Fsearch_book.pl%3Fisbn%3D0-387-94883-X
owl:sameAs
freebase:m.0bh2lx n19:4iRfJ wikidata:Q5164380
dbp:wikiPageUsesTemplate
dbt:Dead_link dbt:Cite_conference dbt:ISBN dbt:Cite_book dbt:Cbignore
dbo:thumbnail
n15:Csp-dual-1.svg?width=300
dbp:bot
medic
dbp:date
July 2020
dbo:abstract
The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such problems. The join graphs and join trees of a constraint satisfaction problem are graphs representing its dual problem or a problem obtained from the dual problem removing some redundant constraints.
prov:wasDerivedFrom
wikipedia-en:Constraint_satisfaction_dual_problem?oldid=1000084380&ns=0
dbo:wikiPageLength
8817
foaf:isPrimaryTopicOf
wikipedia-en:Constraint_satisfaction_dual_problem
Subject Item
dbr:Hidden_transformation
dbo:wikiPageWikiLink
dbr:Constraint_satisfaction_dual_problem
Subject Item
dbr:Join_graph
dbo:wikiPageWikiLink
dbr:Constraint_satisfaction_dual_problem
dbo:wikiPageRedirects
dbr:Constraint_satisfaction_dual_problem
Subject Item
wikipedia-en:Constraint_satisfaction_dual_problem
foaf:primaryTopic
dbr:Constraint_satisfaction_dual_problem