Sciweavers

3758 search results - page 28 / 752
» A Complete Subsumption Algorithm
Sort
View
DLOG
2004
13 years 9 months ago
Efficient Reasoning with Range and Domain Constraints
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Dmitry Tsarkov, Ian Horrocks
COCO
1994
Springer
90views Algorithms» more  COCO 1994»
13 years 11 months ago
On the Structure of Complete Sets
We show the following results regarding complete sets.
Harry Buhrman, Leen Torenvliet
DLOG
2010
13 years 5 months ago
Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...
Anni-Yasmin Turhan, Rafael Peñaloza
ERSHOV
2009
Springer
14 years 2 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács