Qualitative theorem proving in linear constraints

DOI10.1007/B12001MaRDI QIDQ5305651zbMATH OpenOpenAlexFDO

Authors Vijay Chandru, Jean-Louis Lassez

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Elimination procedures for mechanical theorem proving in geometry
• A new approach for automatic theorem proving in real geometry
• Proof synthesis and reflection for linear arithmetic
• A Quantifier Elimination Algorithm for Linear Real Arithmetic
• scientific article; zbMATH DE number 871442

Cited in

(3)

• New approach to Farkas' theorem of the alternative
• Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
• Qualification Conditions in Semialgebraic Programming

This page was built for publication: Qualitative theorem proving in linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305651)