We present a new methodology for testing decision procedures for modal and terminological logics which extends the fixed-clause-length test model, commonly used for propositional satisfiability testing. The new method is easy to implement and to use, and it allows for a statistical control of some important features, e.g., hardness and satisfiability rate, of the formulas generate
We present a new proof-theoretic approach to bounding the complexity of the decision problem for pro...
AbstractA bottom-up algorithm is given for testing the satisfiability of sets of propositional modal...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...
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...
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we sho...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
Heavily-optimised decision procedures for propositional modal satisfiability are now becoming availa...
The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of ...
The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of ...
This paper reports on empirical performance analysis of four modal theorem provers on benchmark suit...
We present a new proof-theoretic approach to bounding the complexity of the decision problem for pro...
AbstractA bottom-up algorithm is given for testing the satisfiability of sets of propositional modal...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...
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...
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we sho...
Abstract. Modal logics extend classical propositional logic, and they are ro-bustly decidable. Where...
Heavily-optimised decision procedures for propositional modal satisfiability are now becoming availa...
The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of ...
The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of ...
This paper reports on empirical performance analysis of four modal theorem provers on benchmark suit...
We present a new proof-theoretic approach to bounding the complexity of the decision problem for pro...
AbstractA bottom-up algorithm is given for testing the satisfiability of sets of propositional modal...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...