Add to ORKGTableau systems are very popular in AI for their simplicity and versatility. In recent papers we showed that tableau-based procedures are intrinsically inefficient, and proposed an alternative approach of building decision procedures on top of SAT decision procedure. We called this approach `SAT-based`. In extensive empirical tests on the case study of modal K, a SAT-based procedure drastically outperformed state-of-the-art tableau-based systems. In this paper we provide the theoretical foundations for developing SAT-based decision procedures for many different modal logic
This paper reports on empirical performance analysis of four modal theorem provers on benchmark suit...
AbstractModal description logics provide a more expressive framework than their propositional counte...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we sho...
This paper follows on previous papers which presented and evaluated various decision procedures for ...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
The goal of this paper is to propose a new technique for developing decision procedures for proposit...
We present a set of SAT-based decision procedures for various classical modal logics. By SAT based, ...
This paper investigates the evaluation method of decision procedures for multi-modal logic proposed ...
International audienceModal logics extend classical propositional logic, and they are robustly decid...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
Modal description logics provide a more expressive framework than their propositional counterparts b...
We present a modification of the DPLL-based approach to decide modal satisfiability where we substit...
Abstract. An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SM...
The goal of this paper is to describe and thoroughly test a decision procedure, called KSAT, checkin...
This paper reports on empirical performance analysis of four modal theorem provers on benchmark suit...
AbstractModal description logics provide a more expressive framework than their propositional counte...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we sho...
This paper follows on previous papers which presented and evaluated various decision procedures for ...
AbstractThe goal of this paper is to propose a new technique for developing decision procedures for ...
The goal of this paper is to propose a new technique for developing decision procedures for proposit...
We present a set of SAT-based decision procedures for various classical modal logics. By SAT based, ...
This paper investigates the evaluation method of decision procedures for multi-modal logic proposed ...
International audienceModal logics extend classical propositional logic, and they are robustly decid...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
Modal description logics provide a more expressive framework than their propositional counterparts b...
We present a modification of the DPLL-based approach to decide modal satisfiability where we substit...
Abstract. An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SM...
The goal of this paper is to describe and thoroughly test a decision procedure, called KSAT, checkin...
This paper reports on empirical performance analysis of four modal theorem provers on benchmark suit...
AbstractModal description logics provide a more expressive framework than their propositional counte...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...