- DEPARTMENT OF INFORMATION AND COMMUNICATION TECHNOLOGY 38050 Povo Trento (Italy), Via Sommarive 14
- The MathSAT 3 System Marco Bozzano1, Roberto Bruttomesso1, Alessandro Cimatti1, Tommi Junttila2,
- Simple and Minimum-Cost Satisfiability for Goal Models
- Using Abstraction Interactively \Lambda Roberto Sebastiani 1 , Mauro Di Manzo 1 , Fausto Giunchiglia 2;3
- Encoding the satisfiability of modal and description logics into SAT: the case study of K(m)/ALC
- "p02c12smt" --2008/11/16 --16:01 --page 825 --#1 Handbook of Satisfiability
- Formal Speci cation and Development of a Safety-Critical Train Management System
- Curriculum Vitae et Studiorum prof. ing. Roberto Sebastiani, PhD
- GSTE is Partitioned Model Checking Roberto Sebastiani (rseba@dit.unitn.it)
- Formal Specification and Validation of a Vital Communication Protocol ?
- UNIVERSIT A DEGLI STUDI DI PADOVA
- Proof planning by abstraction Adolfo Villa orita 1
- Integrating BDD-based and SAT-based Symbolic Model Checking
- Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability
- A new method for testing decision procedures in modal and terminological logics
- SATbased decision procedures for normal modal logics: a theoretical framework ?
- Journal of Artificial Intelligence Research 1 (1994) 309314 Submitted 1/94; published 6/94 Research Note
- The 2006 Federated Logic Conference The Seattle Sheraton Hotel and Towers
- Applying the Davis-Putnam procedure to non-clausal formulas ?
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic #
- List of Figures Figure 1. A simple goal graph
- Axiom Pinpointing in Lightweight Description Logics
- Efficient Satisfiability Modulo Theories via Delayed Theory Combination #
- Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms and Requirements ?
- Integrating SAT Solvers with Math Reasoners: Foundations and Basic Algorithms
- SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
- Efficient Generation of Craig Interpolants in Satisfiability Modulo Theories
- A New System and Methodology for Generating Random Modal Formulae
- Integrating SAT solvers with domain-speci c reasoners
- A SATbased decision procedure for ALC Fausto Giunchiglia
- A new method for testing decision procedures in modal logics ?
- 1 2 3 4 5 6 7 8 9 computers #
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- More evaluation of decision procedures for modal logics Enrico Giunchiglia
- Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: a Comparative Analysis
- Improving the Encoding of LTL Model Checking into SAT ?
- Proving Theorems By Using Abstraction Interactively \Lambda
- Astrazione: dalla Teoria alla Realizzazione di un
- Interpolant Generation for UTVPI # Alessandro Cimatti 1 , Alberto Griggio 2 , and Roberto Sebastiani 2
- To Ackermann-ize or not to Ackermann-ize? On Efficiently Handling Uninterpreted Function
- Model Checking Syllabi and Student Careers ? Roberto Sebastiani 1 , Alessandro Tomasi 1 , and Fausto Giunchiglia 1;2
- [AG93] A. Armando and E. Giunchiglia. Embedding Complex Decision Procedures inside an Interactive Theorem Prover. Annals of Mathematics and Artificial
- The MathSAT 4 SMT Solver (Tool Paper) Roberto Bruttomesso1
- Ann Math Artif Intell DOI 10.1007/s10472-009-9152-7
- MATHSAT: Tight Integration of SAT and Mathematical Decision Procedures
- "p02c11mod" --2008/11/16 --16:01 --page 781 --#1 Handbook of Satisfiability
- Satisfiability Modulo the Theory of Costs: Foundations and Applications
- Software Model Checking via Large-Block Encoding Simon Fraser University
- Efficient Interpolant Generation in Satisfiability Modulo Theories
- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
- A Lazy and Layered SMT(BV ) Solver for Hard Industrial Verification Problems
- DIPARTIMENTO DI INGEGNERIA E SCIENZA DELL'INFORMAZIONE 38050 Povo Trento (Italy), Via Sommarive 14
- Bounded Model Checking for Timed Systems G. Audemard 1 , A. Cimatti 1 , A. Kornilowicz 1 , and R. Sebastiani 1;2
- GSTE is Partitioned Model Checking Roberto Sebastiani1
- Building decision procedures for modal logics from propositional decision procedures ---
- As c n is monotonically decreasing, jc n+1 \Gamma c n j
- An Analysis of Empirical Testing for Modal Decision Procedures
- universit`a facolt`a di
- New upper bounds for satisfiability in modal logics --
- Satisfiability Modulo the Theory of Costs: Foundations and Applications
- Improving the Generation of Random Modal Formulae for Testing Decision Procedures
- Curriculum Vitae et Studiorum prof. ing. Roberto Sebastiani, PhD
- Journal on Satisfiability, Boolean Modeling and Computation 1 (2006) Lazy Satisfiability Modulo Theories
- Curriculum Vitae et Studiorum prof. ing. Roberto Sebastiani, PhD
- Efficient Theory Combination via Boolean Search Marco Bozzano a, Roberto Bruttomesso a, Alessandro Cimatti a,
- Symbolic Systems, Explicit Properties: on Hybrid Approaches
- Journal of Artificial Intelligence Research () Submitted ; published Research Note
- Handbook of Satisfiability Clark Barrett1
- Handbook of Satisfiability Roberto Sebastiani and Armando Tacchella
- Applying SMT in Symbolic Execution of Microcode Anders Franzen
- Stochastic Local Search for SMT: a Preliminary Report (extended abstract)
- Call for Papers FLOC'06/IJCAR'06 Workshop
- New upper bounds for satisfiability in modal K \Lambda Roberto Sebastiani
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical
- From Tableaubased to SATbased procedures ---
- ``More Deterministic'' vs. ``Smaller'' B uchi Automata
- Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
