The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction
Published 30 December 2002Open access
Damien Dubois, Hélène Fargier, Henri Prade
Citations125
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The authors propose a unified treatment of prioritized and flexible constraints, both being represented by possibility distributions, andArc- and path-consistency-based methods for constraint satisfaction problems are extended to this possibility theory framework.
Abstract
ks Pages de la publication : 1131-1136,Vol.II.
Keywords
Computer ScienceDecision Sciences
Fuzzy Sets and SystemsFuzzy sets as a basis for a theory of possibility
7,964 Citations1978Lotfi A. Zadeh
Fuzzy Sets and SystemsFuzzy sets as a basis for a theory of possibility
7,280 Citations1999Lotfi A. Zadeh
The theory of possibility described in this paper is related to the theory of fuzzy sets by defining the concept of a possibility distribution as a fuzzy restriction which acts as an elastic constraint on the values that may be assigned to a variable.
Management ScienceDecision-Making in a Fuzzy Environment
6,763 Citations1970Richard Bellman, L. A. Zadeh
Artificial IntelligenceConsistency in networks of relations
2,430 Citations1977Alan K. Mackworth
The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.
Information SciencesNetworks of constraints: Fundamental properties and applications to picture processing
1,248 Citations1974Ugo Montanari
Constraints are treated algebraically, and the solution of a system of linear equations in this algebra provides an approximation of the minimal network, and this solution is proved exact in special cases, e.g., for tree-like and series-parallel networks and for classes of relations for which a distributive property holds.
Elsevier eBooksCALCULUS OF FUZZY RESTRICTIONS
585 Citations1975Lotfi A. Zadeh
The calculus of fuzzy restrictions is concerned with translation of propositions of various types into relational assignment equations, and the study of transformations of fuzzy Restrictions which are induced by linguistic modifiers, truth-functional modifiers, compositions, projections and other operations.
IEEE Transactions on Knowledge and Data EngineeringAutomated reasoning using possibilistic logic: semantics, belief revision, and variable certainty weights
161 Citations1994Didier Dubois, Jérôme Lang +1 more
An approach to automated deduction under uncertainty, based on possibilistic logic, is described, in which deduction from a partially inconsistent knowledge base can be managed in this approach and captures a form of nonmonotonicity.
Artificial IntelligenceMaking compromises among antagonist constraints in a planner
142 Citations1985Yannick Descotte, Jean‐Claude Latombe
A planner which operates by iteratively constraining a loosely constrained initial plan built from the model of the part to be machined, which makes use of a selective backtracking procedure which reasons about the weights attached to the applied constraints for deciding which compromise is ‘best’.
Uncertainty in Artificial IntelligencePossibilistic Constraint Satisfaction Problems or “How to handle soft constraints?”
131 Citations1992Thomas Schiex
This paper formalizes the notion of possibilistic constraint satisfaction problems that allows the modeling of uncertainly satisfied constraints and uses a possibility distribution over labelings to represent respective possibilities of each labeling.
The MIT Press eBooksPartial constraint satisfaction
108 Citations1994Eugene C. Freuder, Richard J. Wallace
KU ScholarWorks (The University of Kansas)Local Computation in Hypertrees
57 Citations1991Glenn Shafer, Prakash P. Shenoy
This is an unpublished monograph that was widely distributed (and cited) and was first written in August 1988 and subseqently revised in August 1989.
Partial constraint satisfaction
52 Citations1994Eugene C. Freuder, Richard J. Wallace
Lecture notes in computer scienceInference in possibilistic hypergraphs
41 Citations2005Didier Dubois, Henri Prade
This paper points out that the same analysis applies to approximate reasoning based on possibility theory, and discusses the usefulness of the idempotence property for combining possibility distributions, a property not satisfied in probabilistic reasoning.
Fuzzy semantics and fuzzy constraint networks
32 Citations2003John W. Bowen, K. Robert Lai +1 more
Khayyam, a fuzzy constrained-based programming language which implements much of Zadeh's PRUF formalism, is introduced, and the expressive power of constraint-based languages is illustrated.
International Journal of Approximate ReasoningFuzzy reasoning in a multidimensional space of hypotheses
19 Citations1990Rudolf Kruse, Erhard Schwecke
The generalized modus ponens and modus tollens are formalized and a set-theoretic concept of evidence is introduced and the mathematical model allows presentation of a propagation algorithm that is based on message-exchanging node and link processors performing local computations.
Lecture notes in computer scienceExtending constraint satisfaction problem solving in structural design
19 Citations2005Qi Guan, Gerhard Friedrich
This article addresses the problem of constraint satisfaction in structural design and presents a theory of fuzzy constraint satisfaction (FCSP), which is able to reason about the degree a constraint is satisfied, thus avoiding a static partition into hard and soft constraints.
Dynamic constraint propagation with continuous variables
12 Citations1992Boi Faltings, D. Haroud +1 more
An algorithm for dynamic constraint satisfaction with continous variables, which provides defaults and preferences as a means to specify heuristics for controlling this ordering and has been implemented as a central element in an intelligent CAD system.
HAL (Le Centre pour la Communication Scientifique Directe)Dealing with soft constraints in a constraint satisfaction problem
4 Citations1992Roger Martin Clouaire