Sciweavers

503 search results - page 33 / 101
» Combining Description Logics, Description Graphs, and Rules
Sort
View
EACL
2003
ACL Anthology
13 years 9 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Guarded Hybrid Knowledge Bases
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...
Stijn Heymans, Jos de Bruijn, Livia Predoiu, Crist...
ECEASST
2008
88views more  ECEASST 2008»
13 years 7 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
Steffen Mazanek, Mark Minas
DLOG
1998
13 years 9 months ago
Expressiveness Revisited
We consider two recently proposed definitions of the expressive power of description logics, one due to Baader, the other due to Kurtonina and de Rijke. The proposals are non-equi...
Carlos Areces, Maarten de Rijke