Constraint satisfaction using soft quantifiers
نویسندگان
چکیده
منابع مشابه
Constraint satisfaction using soft quantifiers
Ronald R. Yager Machine Intelligence Institute, Iona College New Rochelle, NY 10801 [email protected] (212)249-2047 ABSTRACT Fuzzy sets and other methods have been used to model a softening of constraints in CP problems. Here we suggest an approach to the softening of the CP problem at the meta level, the process used to aggregate the satisfactions to the individual constraints. We suggest the us...
متن کاملConstraint Satisfaction with Counting Quantifiers
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers ∃ which assert the existence of at least j elements such that the ensuing property holds. These are natural variants of CSPs in the mould of quantified CSPs (QCSPs). Namely, ∃ := ∃ and ∃ := ∀ (for the domain of size n) We observe that a single counting quantifier ∃ strictly between ∃ and ∀ a...
متن کاملConstraint Satisfaction with Counting Quantifiers 2
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers ∃≥j, asserting the existence of j distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper [11], we focus on the complexity of undirected graph templates. As our main contribution, we settle the two principal open questions proposed in [11]. Firstly, we complete th...
متن کاملThe complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of constraints to a corresponding set of algebraic operations, known as polymorphisms. In this paper we extend the analysis of com...
متن کاملConstraint Satisfaction Using Constraint Logic Programming
Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Systems in Accounting, Finance & Management
سال: 2004
ISSN: 1055-615X,1099-1174
DOI: 10.1002/isaf.250