Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic-Reference-Cited by-同舟云学术

Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic

Published:2005 Issue: Volume: Page:367-380
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Chaieb Amine,Nipkow Tobias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11591191_26.pdf

Reference19 articles.

1. Appel, A.W., Felty, A.P.: Dependent types ensure partial correctness of theorem provers. J. Funct. Program. 14(1), 3–19 (2004)

2. Lecture Notes in Computer Science;S. Berghofer,2000

3. Lecture Notes in Computer Science;S. Berghofer,2002

4. Chaieb, A., Nipkow, T.: Generic proof synthesis for presburger arithmetic. Technical report, TU München (2003), http://www4.in.tum.de/~nipkow/pubs/presburger.pdf

5. Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 7, pp. 91–100. Edinburgh University Press (1972)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq;Journal of Automated Reasoning;2024-08-14

2. Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory;Automated Deduction – CADE 29;2023

3. Model Transformation as Conservative Theory-Transformation.;The Journal of Object Technology;2020

4. Formalization of Karp-Miller tree construction on petri nets;Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs;2017-01-16

5. Semi-intelligible Isar Proofs from Machine-Generated Proofs;Journal of Automated Reasoning;2015-07-12