141 citations · 291 across the 14 of their papers we have counts for
14 papers
Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models
Anne-Marie George, Nic Wilson, Barry O'Sullivan
In this paper, we construct and compare algorithmic approaches to solve the Preference Consistency Problem for preference statements based on hierarchical models. Instances of this…
Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models
Nic Wilson, Anne-Marie George
We analyse preference inference, through consistency, for general preference languages based on lexicographic models. We identify a property, which we call strong compositionality,…
Computation and Complexity of Preference Inference Based on Hierarchical Models
Nic Wilson, Anne-Marie George, Barry O'Sullivan
Preference Inference involves inferring additional user preferences from elicited or observed preferences, based on assumptions regarding the form of the user's preference relation…
Quality of Geographic Information: Ontological approach and Artificial Intelligence Tools
Robert Jeansoulin, Nic Wilson
The objective is to present one important aspect of the European IST-FET project "REV!GIS"1: the methodology which has been developed for the translation (interpretation) of the qu…
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
David Lesaint, Deepak Mehta, Barry O'Sullivan +2
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subsc…
The Computational Complexity of Dominance and Consistency in CP-Nets
Judy Goldsmith, Jerome Lang, Miroslaw Truszczyski +1
We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in w…