Results 251 to 260 of about 185,880 (279)
Some of the next articles are maybe not open access.
2008
In this paper, we propose a new technique to compute irredundant sub-sets of constraint networks. Since, checking redundancy is Co-NP Complete problem, we use different polynomial local consistency entailments for reducing the computational complexity. The obtained constraint network is irredundant modulo a given local consistency.
Chmeiss, Assef +2 more
openaire +3 more sources
In this paper, we propose a new technique to compute irredundant sub-sets of constraint networks. Since, checking redundancy is Co-NP Complete problem, we use different polynomial local consistency entailments for reducing the computational complexity. The obtained constraint network is irredundant modulo a given local consistency.
Chmeiss, Assef +2 more
openaire +3 more sources
Semiring-based CSPs and valued CSPs: Basic properties and comparison
1996In this paper we describe two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discuss the relationship between them.
Bistarelli, Stefano +5 more
openaire +3 more sources
2008
In this paper the analysis of CSP conception implementation problem for intelligible data analysis by means of Constraint Logic Programming is presented and formal logical substantiation of effective control routine for constraints set is introduced on the base of example data from oil&gas subject domain.
openaire +1 more source
In this paper the analysis of CSP conception implementation problem for intelligible data analysis by means of Constraint Logic Programming is presented and formal logical substantiation of effective control routine for constraints set is introduced on the base of example data from oil&gas subject domain.
openaire +1 more source
2005
We present a new class of binary CSPs called extremal CSPs. The CSPs of this class are inconsistent but would become consistent if any pair of variable assignments among the forbidden ones was allowed. Being inconsistent, they cannot be solved by any local repair method.
openaire +1 more source
We present a new class of binary CSPs called extremal CSPs. The CSPs of this class are inconsistent but would become consistent if any pair of variable assignments among the forbidden ones was allowed. Being inconsistent, they cannot be solved by any local repair method.
openaire +1 more source
Proceedings of the 2000 ACM symposium on Applied computing - Volume 2, 2000
Quentin Miller, Bernard Sufrin
openaire +1 more source
Quentin Miller, Bernard Sufrin
openaire +1 more source