Efficient theory combination via boolean search

13 years 4 months ago

Download dit.unitn.it

Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT

Marco Bozzano, Roberto Bruttomesso, Alessandro Cim

Real-time Traffic

Background Theory | Decision Procedures | IANDC 2006 | Theory |

claim paper

» Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

» Generating Implied Boolean Constraints Via Singleton Consistency

» TDecision by Decomposition

» Effective and efficient structured retrieval

» Efficient Combination of Decision Procedures for MUS Computation

» Faster SAT and Smaller BDDs via Common Function Structure

» Efficient SAT solving beyond supercubes

» Modelbased Theory Combination

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IANDC
Authors	Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani

Comments (0)

Sciweavers

Efficient theory combination via boolean search

Background Theory | Decision Procedures | IANDC 2006 | Theory |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers