Richard J. Wallace, Eugene C. Freuder  Home/Search
Context Related
| unh.edu/pub/csp/Pa...overrjwecf.ps.gz 4c.ucc.ie/web/uplo...95overrjwecf.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: unh.edu/~rjw/rjwpap (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Constraint satisfaction problems (CSPs) involve finding an assignment of values to variables that satisfy a set of constraints between these variables. In many important applications the problems may be overconstrained, so that no complete solution is possible. In these cases, partial solutions may still be useful if a sufficient number of the most important constraints are satisfied. An example of such partial constraint satisfaction is the maximal constraint satisfaction problem ... (Update)
Context of citations to this paper: More
...Our approach differs in the way how diversification is done. Other approaches using Tabu Search for SAT or CSP we are aware of, are [3, 8, 19]. In [8] positive results for the application of Tabu Search to SAT are reported. It was shown that Tabu Search in combination with...
...and the modeler is interested in understanding the cause of this inconsistency. This is also referred to as an over constrained system [FW95] in the literature. A constraint violation could occur due to an incorrectly stated constraint, or an inconsistent value assigned to an...
Cited by: More
Ants can solve Constraint Satisfaction Problems - Solnon (2001) (Correct)
Extracting Buildings from Aerial Images using.. - Fischer, Kolbe.. (1998) (Correct)
Semantics and Applications of Constrained Objects - Jayaraman, Tambay (2001) (Correct)
Similar documents (at the sentence level):
14.9%: Anytime Algorithms for Constraint Satisfaction and SAT problems - Richard Wallace (1995) (Correct)
14.9%: Analysis of Heuristic Methods for Partial Constraint Satisfaction .. - Wallace (1996) (Correct)
Active bibliography (related documents): More All
0.1: Enhancements of Branch and Bound Methods for the Maximal.. - Wallace (1996) (Correct)
0.1: Enhancing Maximum Satisfiability Algorithms with Pure Literal.. - Wallace (1996) (Correct)
0.1: An Original Constraint Based Approach for Solving Over .. - Régin, Petit.. (2000) (Correct)
Similar documents based on text: More All
0.4: Local Failure vs. Bayesian Methods for Finding Stable.. - Wallace, Freuder (Correct)
0.2: Analysis And Synthesis Of Overconstrained Mechanisms - Mavroidis, Roth (1994) (Correct)
Related documents from co-citation: More All
7: Partial Constraint Satisfaction - Freuder, Wallace - 1992
5: Minimizing conflicts: a heuristic repair method for constraint satisfaction and .. - Minton, Johnston et al. - 1992
5: A New Method for Solving Hard Satisfiability Problems - Selman, Levesque et al. - 1992
BibTeX entry: (Update)
Wallace, R. J. & Freuder, E. C. (1995), Heuristic methods for over-constrained constraint satisfaction problems, in `Proceedings of the CP 1995 Workshop on OverConstrained Systems'. http://citeseer.ist.psu.edu/wallace95heuristic.html More
@inproceedings{ wallace95heuristic,
author = "Rick Wallace and Eugene Freuder",
title = "Heuristic Methods for Over-Constrained Constraint Satisfaction Problems",
booktitle = "{OCS}'95: Workshop on Over-Constrained Systems at {CP}'95",
month = "18",
address = "Cassis, Marseilles",
editor = "Michael Jampel and Eugene Freduer and Michael Maher",
year = "1995",
url = "citeseer.ist.psu.edu/wallace95heuristic.html" }
Citations (may not include all citations):416 A new method for solving hard satisfiability problems - Selman, Levesque et al. - 1992 DBLP
320 Hard and easy distributions of sat problems - Mitchell, Selman et al. - 1992
311 Partial constraint satisfaction - Freuder, Wallace - 1992
210 Minimizing conflicts: a heuristic repair method for constrai.. - Minton, Johnston et al. - 1992 DBLP
74 An empirical study of greedy local search for satisfiability.. - Selman, Kautz - 1993 DBLP
50 IEEE Transactions on Pattern Analysis and Machine Intelligen.. (context) - Shapiro, Haralick et al. - 1981
43 Tabu search: a tutorial (context) - Glover - 1990
10 Directed arc consistency preprocessing as a strategy for max.. - Wallace - 1995
2 Comparing constraint satisfaction and davis-putnam algorithm.. (context) - Wallace, Freuder - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unh.edu/~rjw/rjwpap.html): More
Generalizing Inconsistency Learning for Constraint Satisfaction - Freuder, Wallace (1995) (Correct)
Stable Solutions for Dynamic Constraint Satisfaction Problems - Wallace, Freuder (1998) (Correct)
Enhancements of Branch and Bound Methods for the Maximal.. - Wallace (1996) (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