We present a new method for solving problems in intuitionistic propositional logic, which involves the use of an incremental SAT-solver. The method scales to very large problems, and fits well into an SMT-based framework for interaction with other theories
Satisfiability Modulo Theories (SMT) refers to the problem of determin-ing whether a first-order for...
This paper describes a method for combining "off-the-shelf" SAT and constraint solvers for building ...
Abstract. This paper describes a method for combining “off-the-shelf ” SAT and constraint solvers fo...
We present a new method for solving problems in intuitionistic propositional logic, which involves t...
Claessen and R\uf3sen have recently presented an automated theorem prover, intuit, for intuitionisti...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which for...
We present a decision procedure for intermediate logics relying on a modular extension of the SAT-ba...
Abstract. We present a unifying framework for understanding and developing SAT-based decision pro-ce...
Satisfiability Modulo Theories (SMT) can be seen as an extended form of propositional satisfiability...
In recent years some papers have addressed the problem of the validity in Intuitionistic Proposition...
Many problems in nature can be represented as some kind of a satisfiability problem. Several SAT sol...
This paper describes a method for combining "off-the-shelf" SAT and constraint solvers for building ...
Abstract. We investigate the satisfiability problem, SAT(ID), of an ex-tension of propositional logi...
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increa...
Satisfiability Modulo Theories (SMT) refers to the problem of determin-ing whether a first-order for...
This paper describes a method for combining "off-the-shelf" SAT and constraint solvers for building ...
Abstract. This paper describes a method for combining “off-the-shelf ” SAT and constraint solvers fo...
We present a new method for solving problems in intuitionistic propositional logic, which involves t...
Claessen and R\uf3sen have recently presented an automated theorem prover, intuit, for intuitionisti...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which for...
We present a decision procedure for intermediate logics relying on a modular extension of the SAT-ba...
Abstract. We present a unifying framework for understanding and developing SAT-based decision pro-ce...
Satisfiability Modulo Theories (SMT) can be seen as an extended form of propositional satisfiability...
In recent years some papers have addressed the problem of the validity in Intuitionistic Proposition...
Many problems in nature can be represented as some kind of a satisfiability problem. Several SAT sol...
This paper describes a method for combining "off-the-shelf" SAT and constraint solvers for building ...
Abstract. We investigate the satisfiability problem, SAT(ID), of an ex-tension of propositional logi...
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increa...
Satisfiability Modulo Theories (SMT) refers to the problem of determin-ing whether a first-order for...
This paper describes a method for combining "off-the-shelf" SAT and constraint solvers for building ...
Abstract. This paper describes a method for combining “off-the-shelf ” SAT and constraint solvers fo...
DOI
Add to ORKG