Add to ORKGAbstract. We give the first formal formalisation of global caching for abstract modal tableaux. Our global caching method is sound and applicable to different tableau calculi of (EXPTime-complete) modal or description logics to produce optimal (EXPTime) decision procedures.
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
Abstract. Our interest in this paper are semantic tableau approaches closely related to bottom-up mo...
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions ...
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions ...
We show that global caching can be used with propagation of both satisfiability and unsatisfiability...
Goré and Nguyen have recently given the first optimal and sound method for global caching for the de...
Abstract. We show that global caching can be used with propagation of both satisfiability and unsati...
The description logic SHI extends the basic description logic ALC with transitive roles, role hierar...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which ...
We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic moda...
The aim of this paper is to construct a tableau decision algorithm for the modal description logic K...
We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic mod...
We present a sound and complete tableau calculus for a class of extended regular modal logics which ...
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
Abstract. Our interest in this paper are semantic tableau approaches closely related to bottom-up mo...
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions ...
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions ...
We show that global caching can be used with propagation of both satisfiability and unsatisfiability...
Goré and Nguyen have recently given the first optimal and sound method for global caching for the de...
Abstract. We show that global caching can be used with propagation of both satisfiability and unsati...
The description logic SHI extends the basic description logic ALC with transitive roles, role hierar...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which ...
We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic moda...
The aim of this paper is to construct a tableau decision algorithm for the modal description logic K...
We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic mod...
We present a sound and complete tableau calculus for a class of extended regular modal logics which ...
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
Abstract. Our interest in this paper are semantic tableau approaches closely related to bottom-up mo...