Goré and Nguyen have recently given the first optimal and sound method for global caching for the description (modal) logic ALC, and various extensions. We report on an experimental evaluation for ALC plus its reflexive and reflexive-transitive extensio
We develop a novel description logic (DL) for representing and reasoning with contextual knowledge....
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...
Abstract. We give the first formal formalisation of global caching for abstract modal tableaux. Our ...
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which ...
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability...
We show that global caching can be used with propagation of both satisfiability and unsatisfiability...
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...
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 ...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
Abstract. We develop a novel description logic (DL) for representing and reasoning with contextual k...
Abstract. We develop a novel description logic (DL) for representing and reasoning with contextual k...
Abstract. In this paper we present the results of applying HAM-ALC, a description logic system for A...
We develop a novel description logic (DL) for representing and reasoning with contextual knowledge....
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...
Abstract. We give the first formal formalisation of global caching for abstract modal tableaux. Our ...
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which ...
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability...
We show that global caching can be used with propagation of both satisfiability and unsatisfiability...
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...
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 ...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
Abstract. We develop a novel description logic (DL) for representing and reasoning with contextual k...
Abstract. We develop a novel description logic (DL) for representing and reasoning with contextual k...
Abstract. In this paper we present the results of applying HAM-ALC, a description logic system for A...
We develop a novel description logic (DL) for representing and reasoning with contextual knowledge....
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...
DOI
Add to ORKG