Sciweavers

3244 search results - page 212 / 649
» Extensions to Description Logics
Sort
View
JELIA
2004
Springer
15 years 11 months ago
Computing the Least Common Subsumer w.r.t. a Background Terminology
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
CSCW
2000
ACM
15 years 10 months ago
Composable collaboration infrastructures based on programming patterns
In general, collaboration infrastructures have supported sharing of an object based on its logical structure. However, current implementations assume an implicit binding between t...
Vassil Roussev, Prasun Dewan, Vibhor V. Jain
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
16 years 22 days ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
LICS
1999
IEEE
15 years 10 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
TAMODIA
2008
15 years 7 months ago
Preserving Rich User Interface State in Web Applications across Various Platforms
This paper aims to provide thorough discussion of the aspects that compose the state of a Web application user interface, and show how it can be preserved across multiple devices w...
Fabio Paternò, Carmen Santoro, Antonio Scor...