Computational complexity of multi-way, dataflow constraint problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1997, Pages 358-363

  Trombettoni, Gilles ^a   Neveu, Bertrand ^a  

^a UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROBLEMS; DATAFLOW; INTERACTIVE APPLICATIONS; LOCAL PROPAGATION; NP-HARD; SPECIFIC PROBLEMS;

ARTIFICIAL INTELLIGENCE;

COMPUTATIONAL COMPLEXITY;

EID: 70450172485     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Bjorn FVeeman-Benson, John Maloney, and Alan Borning. An incremental constraint solver. Communications of the ACM, 33(l):54-63, January 1990.
2. nd International Symposium on Artificial Intelligence and Mathematics, January 1992.
3. Roger Hoover. Incremental Graph Evaluation. PhD thesis, Cornell University, Ithaca, 1987.
4. John Maloney. Using Constraints for User Interface Construction. PhD thesis, Department of Computer Science and Engineering, University of Washington, Seattle, 1991. Published as Technical Report 91-08-12.
5. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
6. Michael Sannella. Constraint Satisfaction and Debugging for Interactive User Interfaces. PhD thesis, Department of Computer Science and Engineering, University of Washington, Seattle, 1994.
7. Ivan Sutherland. Sketchpad: A Man-Machine Graphical Communication System. PhD thesis, Department of Electrical Engineering, MIT, 1963.
8. Gilles Trombettoni and Bertrand Neveu. Computational complexity of multiway, dataflow constraint problems. Technical Report 97-86, CERMICS, January 1997.
9. Bradley Vander Zanden. An incremental algorithm for satisfying hierarchies of multiway, dataflow constraints. ACM Transactions on Programming Languages and Systems, 18(l):30-72, January 1996.