Sciweavers

19 search results - page 3 / 4
» A Tableaux-based Method for Computing Least Common Subsumers...
Sort
View
AAAI
1997
13 years 7 months ago
Representing Sequences in Description Logics
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
Haym Hirsh, Daniel Kudenko
ECAI
2010
Springer
13 years 7 months ago
A Unified Framework for Non-standard Reasoning Services in Description Logics
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
DLOG
2011
12 years 9 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
EWSA
2005
Springer
13 years 11 months ago
Architecture Description for Mobile Distributed Systems
Abstract. In this paper we motivate an Architecture Description Language (ADL) for mobile distributed systems based on the π-calculus. Different from other approaches, the non-fu...
Volker Gruhn, Clemens Schäfer
DMSN
2009
ACM
14 years 24 days ago
Message models and aggregation in knowledge based middleware for rich sensor systems
Networked, distributed real world sensing is an increasingly prominent topic in computing and has quickly expanded from resource constrained “sensor networks” measuring simple...
Joseph B. Kopena, William C. Regli, Boon Thau Loo