(Enter summary)
Abstract: A central service of a constraint programming system is search. In almost all constraint
programming systems search is based on trailing, which is well understood
and known to be efficient. This paper compares trailing to copying. Copying offers
more expressiveness as required by parallel and concurrent systems. However, little
is known how trailing compares to copying as it comes to implementation effort,
runtime efficiency, and memory requirements. This paper discusses these issues. (Update)
Cited by: More
Compositional Abstractions for Search Factories - Tack, Le Botlan
(Correct)
Under consideration for publication in Theory and Practice.. - Tom Schrijvers And
(Correct)
Pascal Van Hentenryck and Laurent Michel - Department Of Computer
(Correct)
Similar documents (at the sentence level):
41.1%: Programming Constraint Services - Schulte (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Comparing Trailing and Copying for Constraint Programming - Schulte (1999)
(Correct)
0.2: Research in Constraint-Based Layout, Visualization, CAD, and.. - Hower, Graf (1995)
(Correct)
0.1: Design of a Finite Domain Constraint Programming Library for ML - Henz, Smolka (1999)
(Correct)
Similar documents based on text: More All
0.3: Parallel Search Made Simple - Schulte (2000)
(Correct)
0.2: Oz Explorer: A Visual Constraint Programming Tool - Schulte (1996)
(Correct)
0.2: Finite Domain Constraint Programming in Oz - A Tutorial - Schulte, Smolka, Würtz (1998)
(Correct)
Related documents from co-citation: More All
10: Oz explorer: A visual constraint programming tool
- Schulte - 1997
10: The Oz programming model
- Smolka - 1995
10: Programming constraint inference engines
- Schulte - 1997
BibTeX entry: (Update)
Christian Schulte. Comparing trailing and copying for constraint programming. In Proceedings of the International Conference on Logic Programming, 1999. to appear. http://citeseer.ist.psu.edu/schulte99comparing.html More
@inproceedings{ schulte99comparing,
author = "Christian Schulte",
title = "Comparing Trailing and Copying for Constraint Programming",
booktitle = "International Conference on Logic Programming",
pages = "275-289",
year = "1999",
url = "citeseer.ist.psu.edu/schulte99comparing.html" }
Citations (may not include all citations):
395
An abstract Prolog instruction set (context) - Warren - 1983
125
Warren's Abstract Machine: A Tutorial Reconstruction (context) - At-Kaci - 1991
85
Compiling constraints in clp (context) - Codognet, Diaz - 1996
55
Oz Explorer: A visual constraint programming tool
- Schulte - 1997
51
Programming constraint inference engines
- Schulte - 1997
31
The Mozart programming system (context) - Consortium - 1999
14
and evaluation of the constraint language cc (context) - Van Hentenryck, Saraswat et al. - 1998
11
Extending a concurrent constraint language by propagators (context) - Muller, Wurtz - 1997
8
Screamer: A portable efficient implementation of nondetermin..
- Siskind, McAllester - 1993
4
Special Issue: Ten Years of Logic Programming (context) - Jaffar, Maher et al. - 1994
2
Overview of the CHIP Compiler System (context) - Aggoun, Beldiceanu - 1993
1
European Computer Industry Research Centre (context) - Aggoun, Chan et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999)
(Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura
(Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999)
(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