972 search results - page 31 / 195 » Using Preference Order in Ontologies |
LOGCOM
2007
13 years 8 months ago
2007
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
IJCAI
1997
13 years 10 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
SUM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
FQAS
2009
Springer
14 years 1 months ago
2009
Springer
This paper concerns the design of a workflow which permits to feed and query a data warehouse opened on the Web, driven by a domain ontology. This data warehouse has been built to...
ICNP
2006
IEEE
14 years 3 months ago
2006
IEEE
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...