Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

TAPSOFT
1989
Springer

favoriteEmaildiscussreport

88views Software Engineering» more TAPSOFT 1989»

Independence of Negative Constraints

13 years 9 months ago

Independence of Negative Constraints

Download www.cse.unsw.edu.au

In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set associated with the constraints is empty. We show here that Fourier's algorithm has an important hidden property: in effect it also computes the affine hull of the polyhedral set. This result is established by making use of a recent theorem on the independence of negative constraints.

Jean-Louis Lassez, Ken McAloon

Real-time Traffic

Algorithm | Linear Arithmetic Constraints | Polyhedral Set | Software Engineering | TAPSOFT 1989 |

claim paper

Related Content

» Matching independent global constraints for composite web services

» Anatomical PartsBased Regression Using NonNegative Matrix Factorization

» Predicting the Semantic Orientation of Adjectives

» Programming Deep Concurrent Constraint Combinators

» Tnormbased logics with an independent involutive negation

» Abducing through negation as failure stable models within the independent choice logic

» Ordering Constraints over Feature Trees

» Extending clpFD by Negative Constraint Solving

» Records for Logic Programming

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1989
Where	TAPSOFT
Authors	Jean-Louis Lassez, Ken McAloon

Comments (0)