Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!gatech!ncar!ames!kronos.arc.nasa.gov!polya.arc.nasa.gov!minton
From: minton@polya.arc.nasa.gov (Steve Minton)
Subject: JAIR article on pivot consistency
Message-ID: <1995May3.213643.25692@ptolemy-ethernet.arc.nasa.gov>
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Wed, 3 May 1995 21:36:43 GMT
Lines: 77


Readers of this group may be interested in the following paper
recently published in JAIR. Instructions for obtaining JAIR articles
are given below.

David, P. (1995)
  "Using Pivot Consistency to Decompose and Solve Functional CSPs", 
   Volume 2, pages 447-474.
   PostScript: volume2/david95a.ps (489K)
               compressed, volume2/david95a.ps.Z (220K)
 
  Abstract: Many studies have been carried out in order to increase the
  search efficiency of constraint satisfaction problems; among them,
  some make use of structural properties of the constraint
  network; others take into account semantic properties of the
  constraints, generally assuming that all the constraints possess
  the given property.  In this paper, we propose a new decomposition
  method benefiting from both semantic properties of functional
  constraints (not bijective constraints) and structural
  properties of the network; furthermore, not all the constraints need
  to be functional.  We show that under some conditions, the existence
  of solutions can be guaranteed.  We first characterize a particular
  subset of the variables, which we name a root set.  We then
  introduce pivot consistency, a new local consistency which is a
  weak form of path consistency and can be achieved in O(n^2d^2)
  complexity (instead of O(n^3d^3) for path consistency), and we
  present associated properties; in particular, we show that any
  consistent instantiation of the root set can be linearly extended to a
  solution, which leads to the presentation of the aforementioned new
  method for solving by decomposing functional CSPs.


The PostScript file is available via:
   
 -- comp.ai.jair.papers

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html

 -- Anonymous FTP from either of the two sites below:
      CMU:   p.gp.cs.cmu.edu        directory: /usr/jair/pub/volume2

      Genoa: ftp.mrg.dist.unige.it  directory:  pub/jair/pub/volume2

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND, and the body GET VOLUME2/DAVID95A.PS
    (either upper or lowercase is fine). 
    Note: Your mailer might find this file too large to handle.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, check out our WWW or FTP sites (above)
The PostScript file is available via:
   
 -- comp.ai.jair.papers

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html

 -- Anonymous FTP from either of the two sites below:
      CMU:   p.gp.cs.cmu.edu        directory: /usr/jair/pub/volume2

      Genoa: ftp.mrg.dist.unige.it  directory:  pub/jair/pub/volume2

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND, and the body GET VOLUME2/DAVID95A.PS
    (either upper or lowercase is fine). 
    Note: Your mailer might find this file too large to handle.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, check out our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.
, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.
