Jump to content

File:Row-convex-path.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 207 × 180 pixels, file size: 6 KB)

Summary

Description How row convex-ness and path consistency ensure satisfiability for binary constraint networks. Each matrix represents the constraint between xi and xk+1. An evaluation a1..ak restrict to a row in each matrix. The composition of these rows is a row-convex matrix. Strong path consistency ensures the existence of a consistent value ak+1 for xk+1
Date 14 February 2006 (original upload date)
Source No machine-readable source provided. Own work assumed (based on copyright claims).
Author No machine-readable author provided. Tizio assumed (based on copyright claims).

Licensing

Public domain I, the copyright holder of this work, release this work into the public domain. This applies worldwide.
In some countries this may not be legally possible; if so:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

14 February 2006

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current17:01, 14 February 2006Thumbnail for version as of 17:01, 14 February 2006207 × 180 (6 KB)TizioWhite background
16:46, 14 February 2006Thumbnail for version as of 16:46, 14 February 2006207 × 171 (6 KB)TizioHow row convex-ness and path consistency ensure satisfiability for binary constraint networks. Each matrix represents the constraint between xi and xk+1. An evaluation a1..ak restrict to a row in each matrix. The composition of these rows is a row-convex

The following page uses this file: