Searching for "Independence of Negative Constraints." – sorted by Relevance.
-
On Fourier's Algorithm for Linear Arithmetic
- on the independence of negative constraints. 1 Introduction In 1824 Fourier proposed the first algorithm for solving
- Cited by 23 (4 self) – Add To MetaCart
-
A Logic Programming View of CLP
- it is not possible. We show that the Independence of Negated Constraints property of constraint domains
- Cited by 45 (9 self) – Add To MetaCart
-
Chasing Constrained Tuple-Generating Dependencies
- in demonstrating that a CTGD is implied. We demonstrate that, for constraint domains with Independence of Negative
- Cited by 15 (4 self) – Add To MetaCart
-
Chasing Constrained Tuple-Generating Dependencies
- , for constraint domains with Independence of Negative Constraints, the two chase procedures are equally powerful
- Add To MetaCart
-
Chasing Constrained Tuple-Generating Dependencies
- in demonstrating that a CTGD is implied. We demonstrate that, for constraint domains with Independence of Negative
- Add To MetaCart
-
Negative Boolean Constraints
- 4 investigates independence of negative constraints. Sections 5 and 6 use these independence results
- Cited by 16 (0 self) – Add To MetaCart
-
Constrained Dependencies
- domain (D; L) has the independence of negative constraints property if, for all constraints c; c 1
- Cited by 12 (0 self) – Add To MetaCart
-
A Feature-based Constraint System for Logic Programming with Entailment
- -called "independence of negative constraints". Digital Equipment Corporation, Paris Research Laboratory (PRL), 85
- Cited by 69 (20 self) – Add To MetaCart
-
Negation in Combining Constraint Systems
- be significantly simplified if one can show that the solution domain owns the independence of negative constraints
- Cited by 4 (0 self) – Add To MetaCart
-
A Feature Constraint System for Logic Programming with Entailment
- constraints, the property that conjoined negative constraints may be handled independently. R esum e Nous
- Cited by 13 (1 self) – Add To MetaCart

