Finite Domain Problem 
Author Message
 Finite Domain Problem

For a finite domain (over integers) constraint E > 0, where E is an
arithmetic expression with only +, -, *, domain variables and integers,
is it correct to rewrite it as E - 1 >= 0 ?  It seems to work because E
will be always an integer, but I am not sure.  Would someone be kind
enough to point out any errors ?

Department of Computer Science, The Chinese University of Hong Kong
Shatin, New Territories, Hong Kong

Fri, 18 Oct 1996 23:50:53 GMT  
 [ 1 post ] 

 Relevant Pages 

1. Constraint Satisfaction Problems (CSP) w/ non-finite domains?

2. Theorem Prover on Propositions in Finite Domains

3. seeking for Real or Finite Domains constraint solving algorithm in Prolog

4. Finite Domains and Exclusions as First-Class Citizens

5. Finite domain constraint solver for LISP?...

6. Off topid: finite element vs finite volume

7. finite-state-machine problems => Synopsys

8. Off topic - Optimization of a finite volume differencing scheme for multispecies transport problem

9. Time domain to frequency domain...and back again

10. convert time domain to frequency domain

11. public domain prolog for apollo domain

12. UNIX domain sockets problem


Powered by phpBB® Forum Software