Sciweavers

85 search results - page 5 / 17
» Conservative Extensions in Expressive Description Logics
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ä
DLOG
2009
13 years 5 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
JAR
2007
129views more  JAR 2007»
13 years 7 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
Carsten Lutz, Maja Milicic
TIME
2007
IEEE
14 years 2 months ago
Temporalising Tractable Description Logics
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
DLOG
2010
13 years 5 months ago
Optimization Techniques for Fuzzy Description Logics
Sophisticated uncertainty representation and reasoning are necessary for the alignment and integration of Web data from different sources. For this purpose the extension of the Des...
Nikos Simou, Theofilos P. Mailis, Giorgos Stoilos,...