Sciweavers

1545 search results - page 182 / 309
» Defeasible Description Logics
Sort
View
RTA
2000
Springer
13 years 11 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
AAAI
2007
13 years 10 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
SWAP
2008
13 years 9 months ago
Exploiting Semantic Technology in Computational Logic-based Service Contracting
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
Marco Alberti, Massimiliano Cattafi, Marco Gavanel...
FLAIRS
2009
13 years 6 months ago
A Knowledge Compilation Technique for ALC Tboxes
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered ef...
Ulrich Furbach, Heiko Günther, Claudia Oberma...
ER
2007
Springer
89views Database» more  ER 2007»
14 years 2 months ago
On Order Dependencies for the Semantic Web
We consider the problem of adding both equality and order generating dependencies to Web ontology languages such as OWL DL that are based on description logics. Such dependencies u...
David Toman, Grant E. Weddell