Computing Least Common Subsumers for FLE+

13 years 5 months ago

Download ftp.informatik.rwth-aachen.de

Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a ﬁrst algorithm to compute least common subsumers in a description logic with transitive roles.

Sebastian Brandt, Anni-Yasmin Turhan

Real-time Traffic

Adequate Representation | Automated Reasoning | DLOG 2003 | Transitive Roles | ﬁrst Algorithm |

claim paper

» Computing the Least Common Subsumer wrt a Background Terminology

» A Tableauxbased Method for Computing Least Common Subsumers for Expressive Description Log...

» Computing Probabilistic Least Common Subsumers in Description Logics

» Using Lazy Unfolding for the Computation of Least Common Subsumers

» Roledepth Bounded Least Common Subsumers by Completion for EL and probELTBoxes

» Implementing CompletionBased Inferences for the ELfamily

» Representing Sequences in Description Logics

» A Unified Framework for Nonstandard Reasoning Services in Description Logics

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	DLOG
Authors	Sebastian Brandt, Anni-Yasmin Turhan

Comments (0)

Sciweavers

Computing Least Common Subsumers for FLE+

Adequate Representation | Automated Reasoning | DLOG 2003 | Transitive Roles | ﬁrst Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers