activity
20112024
most citedThe Computational Complexity of Dominance and Consistency in CP-Nets

141 citations · 291 across the 14 of their papers we have counts for

collaborators
Showing cs.AIShow all

11 papers · 1 filter

cs.AI2014★ 1 cited

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…

cs.AI2014

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…

cs.AI2014★ 141 cited

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…

cs.AI2013★ 1 cited

Rules, Belief Functions and Default Logic

Nic Wilson

This paper describes a natural framework for rules, based on belief functions, which includes a repre- sentation of numerical rules, default rules and rules allowing and rules not…

cs.AI2013

A Monte-Carlo Algorithm for Dempster-Shafer Belief

Nic Wilson

A very computationally-efficient Monte-Carlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster's Rule of belief functio…

cs.AI2013

The Assumptions Behind Dempster's Rule

Nic Wilson

This paper examines the concept of a combination rule for belief functions. It is shown that two fairly simple and apparently reasonable assumptions determine Dempster's rule, givi…