Sciweavers

1435 search results - page 135 / 287
» E-connections of Description Logics
Sort
View
COOPIS
2002
IEEE
15 years 6 months ago
A Defeasible Ontology Language
We extend the description logic ¢¤£¦¥¦§©¨ with a preference order on the axioms. With this strict partial order certain axioms can be overruled, if defeated with more ...
Stijn Heymans, Dirk Vermeir
CADE
2005
Springer
16 years 1 months ago
The OWL Instance Store: System Description
Abstract. We describe the instance store, a system for reasoning about individuals (i.e., instances of classes) in OWL ontologies. By using a hybrid reasoner/database architecture,...
Sean Bechhofer, Ian Horrocks, Daniele Turi
RTA
2000
Springer
15 years 4 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
15 years 3 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
15 years 2 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...