The computational complexity of dominance and consistency in CP-nets

@inproceedings{Goldsmith2005TheCC,
  title={The computational complexity of dominance and consistency in CP-nets},
  author={J. Goldsmith and J. Lang and M. Truszczynski and N. Wilson},
  booktitle={IJCAI},
  year={2005}
}
  • J. Goldsmith, J. Lang, +1 author N. Wilson
  • Published in IJCAI 2005
  • Computer Science, Mathematics
  • We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. We show here that both dominance and consistency testing for general CP-nets are PSPACE-complete. The reductions used in the proofs are… CONTINUE READING
    162 Citations
    A Parameterized Complexity Analysis of Generalized CP-Nets
    • 2
    • Highly Influenced
    • PDF
    More Complexity Results about Reasoning over ( m )CP-nets
    • 1
    • PDF
    A Divide and Conquer Algorithm for Dominance Testing in Acyclic CP-Nets
    • Sultan Ahmed, M. Mouhoub
    • Computer Science
    • 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)
    • 2019
    • 1
    Efficient heuristic approach to dominance testing in CP-nets
    • 16
    • Highly Influenced
    • PDF
    Dominance Testing via Model Checking
    • 33
    • PDF
    Preference Aggregation with Incomplete CP-Nets
    • 2
    • Highly Influenced
    • PDF
    On the Integration of CP-nets in ASPRIN
    • PDF
    Representation and realization of binary-valued CP-nets in single-branch tree
    • Xuejiao Sun, Jinglei Liu
    • Mathematics, Computer Science
    • 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery
    • 2010
    • 3
    Representation and realization of binary-valued CP-nets in directed tree
    • Xuejiao Sun, Jinglei Liu
    • Mathematics
    • 2010 3rd International Conference on Biomedical Engineering and Informatics
    • 2010
    CP-nets with indifference
    • T. E. Allen
    • Mathematics, Computer Science
    • 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
    • 2013
    • 6
    • PDF

    References

    SHOWING 1-10 OF 35 REFERENCES
    Consistency and Constrained Optimisation for Conditional Preferences 1
    • 1
    • PDF
    Extending CP-Nets with Stronger Conditional Preference Statements
    • 179
    • PDF
    The Computational Complexity of Propositional STRIPS Planning
    • T. Bylander
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1994
    • 880
    • PDF
    Constraint-Based Preferential Optimization
    • 41
    • PDF
    An Efficient Upper Approximation for Conditional Preference
    • 28
    • PDF
    Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
    • 96
    • PDF
    Extended Semantics and Optimization Algorithms for CP‐Networks
    • 59
    • PDF
    Hard and soft constraints for reasoning about qualitative conditional preferences
    • 50
    • Highly Influential
    • PDF
    Strucutre and Complexitiy in Planning with Unary Operators
    • 91
    • PDF