• Publications
  • Influence
Extending CP-Nets with Stronger Conditional Preference Statements
TLDR
A logic of conditional preferences is defined, with a language which allows a compact representation of certain kinds of conditional preference statements, a semantics and a proof theory, and an approach to constrained optimisation can be used which generalises a natural approach for CP-nets. Expand
  • 179
  • 28
  • PDF
The computational complexity of dominance and consistency in CP-nets
TLDR
We show that both dominance and consistency testing for general CP-nets are PSPACE-complete, and this holds even for the propositional case. Expand
  • 162
  • 19
  • PDF
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
TLDR
We propose and investigate a number of techniques for solving such problems based on combinations of Monte Carlo simulation, solutions to the associated deterministic problem, and either constraint programming or tabu search. Expand
  • 73
  • 11
  • PDF
Algorithms for Dempster-Shafer Theory
TLDR
The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur DemPster [Dempster, 1967; 1968] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 1976], and further publications e.g., [Smets, 1988; Smets and Keimes, 1994] and the Theory of Hints. Expand
  • 82
  • 10
  • PDF
Computational techniques for a simple theory of conditional preferences
  • N. Wilson
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1 May 2011
TLDR
A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory generalise those of CP-nets and TCP-nets. Expand
  • 42
  • 10
Semiring induced valuation algebras: Exact and approximate local computation algorithms
TLDR
We study how valuation algebras are induced by semirings and how the structure of valuation algebra is related to the algebraic structure of the semiring. Expand
  • 59
  • 7
Decision Diagrams for the Computation of Semiring Valuations
  • N. Wilson
  • Mathematics, Computer Science
  • IJCAI
  • 30 July 2005
TLDR
This paper describes a new approach to computation in a semiring-based system, which includes semiring based CSPs and Bayesian networks. Expand
  • 38
  • 4
  • PDF
From Preference Logics to Preference Languages, and Back
TLDR
We propose a "prototypical" preference logic, which combines features of existing preference logics, and then we show that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it. Expand
  • 57
  • 3
  • PDF
Consistency and Constrained Optimisation for Conditional Preferences
TLDR
The paper derives various sufficient conditions for a subset of the logical language to be consistent, and develops methods for finding a total order on outcomes which is consistent with the set of conditional preferences. Expand
  • 37
  • 3
  • PDF
Interval-valued soft constraint problems
TLDR
We define several notions of optimal solutions for soft constraint problems, providing algorithms to find optimal solutions and also to test whether a solution is optimal. Expand
  • 24
  • 3
  • PDF