Uniform random generation and dominance testing for CP-nets

DOI10.1613/JAIR.5455MaRDI QIDQ5371005zbMATH OpenOpenAlexWikidataFDO

Authors Thomas E. Allen, J. Goldsmith, Hayden Elizabeth Justice, Nicholas Mattei, Kayla Raines

Publication date 24 October 2017

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.5455

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Individual preferences (91B08)

Recommendations

• Expressive efficiency of two kinds of specific CP-nets
• The computational complexity of dominance and consistency in CP-nets
• CP-nets, -pref nets, and Pareto dominance
• scientific article; zbMATH DE number 2243357
• Learning conditional preference networks

Cited in

(7)

• Preference-based inconsistency-tolerant query answering under existential rules
• Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
• Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
• Random graphic model generation algorithm based on Prüfer code
• The computational complexity of dominance and consistency in CP-nets
• Constraints and lifting-based (conditional) preferences in abstract argumentation
• Independent relaxed subproblems for dominance testing in CP-nets

This page was built for publication: Uniform random generation and dominance testing for CP-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371005)