We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. Global state caching guarantees optimality and termination without dynamic blocking
ALCNIR+—ALCN augmented with transitive and inverse roles—is an expressive Description Logic which is...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which ...
Abstract. We show that global caching can be used with propagation of both satisfiability and unsati...
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 give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
The description logic SHI extends the basic description logic ALC with transitive roles, role hierar...
Abstract. We give the first formal formalisation of global caching for abstract modal tableaux. Our ...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
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 ...
Real-world applications, such as diagnosis and embedded control, are increasingly be-ing framed as O...
The tableaux algorithm is a general technique for deciding concept satisfiability problems in descri...
ALCNIR+—ALCN augmented with transitive and inverse roles—is an expressive Description Logic which is...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which ...
Abstract. We show that global caching can be used with propagation of both satisfiability and unsati...
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 give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
The description logic SHI extends the basic description logic ALC with transitive roles, role hierar...
Abstract. We give the first formal formalisation of global caching for abstract modal tableaux. Our ...
Abstract. We give the first ExpTime (complexity-optimal) tableau decision procedure for check-ing sa...
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 ...
Real-world applications, such as diagnosis and embedded control, are increasingly be-ing framed as O...
The tableaux algorithm is a general technique for deciding concept satisfiability problems in descri...
ALCNIR+—ALCN augmented with transitive and inverse roles—is an expressive Description Logic which is...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
DOI
Add to ORKG