Sciweavers

1096 search results - page 6 / 220
» Evaluating Algorithms for Concept Description
Sort
View
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
WWW
2003
ACM
14 years 8 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon
TABLEAUX
2005
Springer
14 years 27 days ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
Carsten Lutz, Maja Milicic
KI
2007
Springer
14 years 1 months ago
Knowledge Compilation for Description Logics
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
Ulrich Furbach, Claudia Obermaier
BMCBI
2010
95views more  BMCBI 2010»
13 years 7 months ago
Protein structure modelling and evaluation based on a 4-distance description of side-chain interactions
Background: Accurate evaluation and modelling of residue-residue interactions within and between proteins is a key aspect of computational structure prediction including homology ...
Vladimir Potapov, Mati Cohen, Yuval Inbar, Gideon ...