A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions-Reference-Cited by-同舟云学术

A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions

Published:2002 Issue: Volume: Page:195-210
ISSN:0302-9743
Container-title:Automated Deduction—CADE-18
language:
Short-container-title:

Author:

Audemard Gilles,Bertoli Piergiorgio,Cimatti Alessandro,Korniłowicz Artur,Sebastiani Roberto

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45620-1_17

Reference19 articles.

1. R. Alur. Timed Automata. In Proc. 11th International Computer Aided Verification Conference, pages 8–22, 1999.

2. A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Proc. European Conference on Planning, ECP-99, 1999.

3. G. Audemard, A. Cimatti, A. Korni!lowicz, and R. Sebastiani. Bounded Model Checking for Timed Systems. Technical Report 0201-05, ITC-IRST, Trento, Italy, January 2002. Submitted for publication.

4. R. J. Bayardo, Jr. and R. C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT instances. In Proc AAAI’97, pages 203–208. AAAI Press, 1997.

5. Michel Berkelaar. The solver lpsolve for Linear Programming and Mixed-Integer Problems. Available at http://elib.zib.de/pub/Packages/mathprog/linprog/lp-solve/ .

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

1. Impact of Satisfiability Solvers on Logic Locking;Understanding Logic Locking;2023-09-23

2. Model Abstraction for Discrete-Event Systems Using a SAT Solver;IEEE Access;2023

3. SMT solving for the validation of B and Event-B models;International Journal on Software Tools for Technology Transfer;2022-11-21

4. Symbolic Reasoning Methods in Rewriting Logic and Maude;Logic, Language, Information, and Computation;2018

5. An Efficient Approach for Solving Optimization over Linear Arithmetic Constraints;Journal of Computer Science and Technology;2016-09