Peter B. Ladkin Kestrel Institute 1801 Page Mill Road Palo Alto, Ca...  Home/Search
Context Related
| iastate.edu/maddux/papers/obcn.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iastate.edu/maddux/apage (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of interest, and edges labelled with binary relations between the values, which constrain the choice of solutions to those which satisfy the relations (e.g. [Mac77]). We formulate networks and algorithms in a ... (Update)
Context of citations to this paper: More
...0 . 0 is consistent and any model of 0 is also a model of . Proof. Any path consistent set of PA constraints is consistent [29, 30] (if it does not contain the empty relation) Hence is consistent. Moreover, as shown in [45] x = y belongs to a path consistent set S of...
...2 . is consistent and any model of is also a model of . Proof. Any path consistent set of PA constraints is consistent [41,42] (if it does not contain the empty relation) Hence is consistent. Moreover, as shown in [61] x = y belongs to a path consistent set S of PA...
Cited by: More
Relation Algebras and Their Application in Qualitative Spatial.. - Düntsch (2003) (Correct)
Combining Qualitative and Quantitative Constraints in Temporal.. - Meiri (1995) (Correct)
Relation Algebras for Reasoning about Time and Space - Maddux (1993) (Correct)
Similar documents based on text: More All
0.6: The Algebra of Binary Constraint Networks - Peter Ladkin Kestrel (1988) (Correct)
0.5: On Binary Constraint Problems - Ladkin, Maddux (1994) (Correct)
0.2: Some Algebras And Algorithms For Reasoning About Time And Space - Maddux (1990) (Correct)
Related documents from co-citation: More All
34: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
24: Maintaining knowledge about temporal intervals (context) - Allen - 1983
15: Temporal Constraint networks (context) - DECHTER, MEIRI et al. - 1991
BibTeX entry: (Update)
Ladkin, P. B., & Maddux, R. D. (1988). On binary constraint networks. Technical report, Kestrel Institute, Palo Alto, Calif. http://citeseer.ist.psu.edu/ladkin88binary.html More
@techreport{ ladkin89binary,
author = "P. B. Ladkin and R. D. Maddux",
title = "{On binary constraint networks}",
address = "Palo Alto, CA, USA",
year = "1989",
url = "citeseer.ist.psu.edu/ladkin88binary.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.iastate.edu/maddux/apage.html): More
Finite, Integral, And Finite-Dimensional Relation Algebras: A.. - Maddux (Correct)
The Origin Of Relation Algebras In The Development And.. - Maddux (1991) (Correct)
Representations for Small Relation Algebras - Andréka, Maddux (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC