Solve math inequality with SAT (CNF)
- From: MadMocro (mehassan@xxxxxxxxxxx)
- Date: Tue, 24 Oct 2006 13:36:15 +0200
Hello,
I have a SAT problem that is giving me headache. It is a math
problem that has to be solved with SAT resolution. But I don't see
how I can convert integers and math inequalities into Boolean or CNF
form. The problem is to find (positive integers) values a,b,c,d such
that 2a > b + c and 2b > c + d and 2c > 3d and 3d > a+ c. I don't
see how I can turn this into a CNF. specially the ">" and "+".
I'm still a beginner so have some mercy. I'm not asking for a
complete solution but some hints and guidance in the right direction
or just and small example.
Thanks in advance.
Madmocro
--
--------------------------------- --- -- -
Posted with NewsLeecher v3.7 Final
Web @ http://www.newsleecher.com/?usenet
------------------- ----- ---- -- -
.
- Follow-Ups:
- Re: Solve math inequality with SAT (CNF)
- From: tchow
- Re: Solve math inequality with SAT (CNF)
- Prev by Date: Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- Next by Date: Re: Solve math inequality with SAT (CNF)
- Previous by thread: Top down parsing
- Next by thread: Re: Solve math inequality with SAT (CNF)
- Index(es):
Relevant Pages
|