Linear Integer Arithmetic Revisited-Reference-Cited by-同舟云学术

Linear Integer Arithmetic Revisited

Published:2015 Issue: Volume: Page:623-637
ISSN:0302-9743
Container-title:Automated Deduction - CADE-25
language:
Short-container-title:

Author:

Bromberger Martin,Sturm Thomas,Weidenbach Christoph

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-21401-6_42

Reference13 articles.

1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);CW Barrett,2006

2. Bromberger, M., Sturm, T., Weidenbach, C.: Linear integer arithmetic revisited. ArXiv e-prints, abs/1503.02948 (2015)

3. Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) 1971 Proceedings of the Seventh Annual Machine Intelligence Workshop, Edinburgh. Machine Intelligence, vol. 7, pp. 91–99. Edinburgh University Press (1972)

4. Lecture Notes in Computer Science;I Dillig,2009

5. Fietzke, A., Weidenbach, C.: Superposition as a decision procedure for timed automata. Math. Comput. Sci. 6(4), 409–425 (2012)

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

1. Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches;Theory and Practice of Logic Programming;2021-11-02

2. Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs;Journal of Automated Reasoning;2021-09-12

3. A complete and terminating approach to linear integer solving;Journal of Symbolic Computation;2020-09

4. The Challenge of Unifying Semantic and Syntactic Inference Restrictions;Electronic Proceedings in Theoretical Computer Science;2019-12-31

5. SCL Clause Learning from Simple Models;Lecture Notes in Computer Science;2019