Sciweavers

306 search results - page 4 / 62
» From Preference Logics to Preference Languages, and Back
Sort
View
COOPIS
2002
IEEE
14 years 14 days 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
ECAI
2004
Springer
14 years 27 days ago
Consistency and Constrained Optimisation for Conditional Preferences
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of condition...
Nic Wilson
IJCAI
1989
13 years 8 months ago
Preferred Subtheories: An Extended Logical Framework for Default Reasoning
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
Gerhard Brewka
IJCAI
1997
13 years 8 months ago
Compiling Reasoning with and about Preferences into Default Logic
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...
James P. Delgrande, Torsten Schaub
DEXAW
2002
IEEE
99views Database» more  DEXAW 2002»
14 years 13 days ago
Using Preference Order in Ontologies
The latest ontology languages can be translated into a description logic (DL), thus providing them with a formal semantics and associated reasoning procedures. We introduce the or...
Stijn Heymans, Dirk Vermeir