Abstract. An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our framework of Abstract DPLL and Abstract DPLL modulo Theories, we explain our DPLL(T) approach to SMT. Experimental results and future projects are discussed within BarcelogicTools, a set of logic-based tools developed by our research group in Barcelona. At the 2005 SMT competition, BarcelogicTools won all four categories it participated in (out of the seven existing categories).
The annual Satisfiability Modulo Theories Competition (SMT-COMP) is held to spur advances in SMT sol...
The goal of this paper is to propose a new technique for developing decision procedures for proposit...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
International audienceSatisfiability modulo theory (SMT) consists in testing the satisfiability of f...
Satisfiability Modulo Theories (SMT) can be seen as an extended form of propositional satisfiability...
We present a set of SAT-based decision procedures for various classical modal logics. By SAT based, ...
We first introduce Abstract DPLL, a rule-based formulation of the Davis-Putnam-Logemann-Loveland (DP...
This paper follows on previous papers which presented and evaluated various decision procedures for ...
Abstract. We present a unifying framework for understanding and developing SAT-based decision pro-ce...
Decision procedures for checking satisfiability of logical formulas are crucial for many verificatio...
International audienceModal logics extend classical propositional logic, and they are robustly decid...
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we sho...
Satisfiability modulo theories (SMT) is a branch of automated reasoning that builds on advances in p...
Abstract. The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further adv...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
The annual Satisfiability Modulo Theories Competition (SMT-COMP) is held to spur advances in SMT sol...
The goal of this paper is to propose a new technique for developing decision procedures for proposit...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
International audienceSatisfiability modulo theory (SMT) consists in testing the satisfiability of f...
Satisfiability Modulo Theories (SMT) can be seen as an extended form of propositional satisfiability...
We present a set of SAT-based decision procedures for various classical modal logics. By SAT based, ...
We first introduce Abstract DPLL, a rule-based formulation of the Davis-Putnam-Logemann-Loveland (DP...
This paper follows on previous papers which presented and evaluated various decision procedures for ...
Abstract. We present a unifying framework for understanding and developing SAT-based decision pro-ce...
Decision procedures for checking satisfiability of logical formulas are crucial for many verificatio...
International audienceModal logics extend classical propositional logic, and they are robustly decid...
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we sho...
Satisfiability modulo theories (SMT) is a branch of automated reasoning that builds on advances in p...
Abstract. The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further adv...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
The annual Satisfiability Modulo Theories Competition (SMT-COMP) is held to spur advances in SMT sol...
The goal of this paper is to propose a new technique for developing decision procedures for proposit...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...