8 search results - page 2 / 2 » Deciding the Satisfiability of Propositional Formulas in Fin... |
TACAS
2007
Springer
13 years 10 months ago
2007
Springer
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
FMCAD
2006
Springer
13 years 8 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
CAEPIA
2009
Springer
13 years 5 months ago
2009
Springer
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...