Variable Elimination for Disequations in Generalized Linear Constraint Systems | Zendy

J.-L. Imbert | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Variable Elimination for Disequations in Generalized Linear Constraint Systems

Author(s) -

J.-L. Imbert

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.5.473

Subject(s) - variable elimination , variable (mathematics) , constraint (computer aided design) , linear system , projection (relational algebra) , mathematics , local consistency , computer science , mathematical optimization , algorithm , constraint satisfaction , statistics , mathematical analysis , geometry , artificial intelligence , inference , probabilistic logic

This paper is concerned with the case of generalized linear constraint systems. A generalized linear constraints system is the cojunction of a sub-system of equations E, a sub-system of inequations I (≤), and a sub-system of disequations D (¬=). We first of all establish that the variable elimination operation on a generalized linear constraint system E, I, D has, as its result, a generalized linear constraint system E', I', D'. We then show that E', I' does not depend on D, and that the disequations of D are independent from one another for the variable elimination operation. Next, we present two algorithms for variable elimination in the disequation sub-system D

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research