Qualitative theorem proving in linear constraints


Autoria(s): Chandru, Vijay; Lassez, Jean-Louis
Contribuinte(s)

Dershowitz, N

Data(s)

2003

Resumo

We know, from the classical work of Tarski on real closed fields, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take place through the elimination of middle terms, and because the computational complexity of the proof is not an issue. Indeed what we need is the existence of the proof and not its mechanization. In this paper, we treat the linear case and illustrate the power of this paradigm by giving extremely simple proofs of two central theorems in the complexity and geometry of linear programming.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/40180/1/Qualitative_Theorem.pdf

Chandru, Vijay and Lassez, Jean-Louis (2003) Qualitative theorem proving in linear constraints. In: Lecture Notes in Computer Science, 2772 . pp. 395-406.

Publicador

Springer

Relação

http://www.springerlink.com/content/93mfrv8tbylh1x7e/

http://eprints.iisc.ernet.in/40180/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Editorials/Short Communications

PeerReviewed