A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
- 4 July 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 195-210
- https://doi.org/10.1007/3-540-45620-1_17
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Bounded Model Checking for Timed SystemsLecture Notes in Computer Science, 2002
- Fully Symbolic Model Checking of Timed Systems using Difference Decision DiagramsElectronic Notes in Theoretical Computer Science, 2001
- Towards an Efficient Library for SAT: a ManifestoElectronic Notes in Discrete Mathematics, 2001
- Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)Information and Computation, 2000
- SAT-Based Procedures for Temporal ReasoningLecture Notes in Computer Science, 2000
- Negative-cycle detection algorithmsMathematical Programming, 1999
- Symbolic Model Checking without BDDsPublished by Defense Technical Information Center (DTIC) ,1999
- Timed AutomataLecture Notes in Computer Science, 1999
- FaCT and DLPLecture Notes in Computer Science, 1998
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal KLecture Notes in Computer Science, 1996