scientific article
From MaRDI portal
Publication:3624167
zbMath1182.68089arXiv1401.3453MaRDI QIDQ3624167
No author found.
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1401.3453
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Possibilistic Conditional Preference Networks ⋮ Conditional lexicographic orders in constraint satisfaction problems ⋮ Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting ⋮ A general framework for preferences in answer set programming ⋮ Compactly representing utility functions using weighted goals and the Max aggregator ⋮ Possibilistic preference networks ⋮ Relational networks of conditional preferences ⋮ Computational techniques for a simple theory of conditional preferences ⋮ A distributed social choice protocol for combinatorial domains ⋮ Expressive efficiency of two kinds of specific CP-nets ⋮ Lexicographically-ordered constraint satisfaction problems ⋮ Learning conditional preference networks ⋮ Hard and soft constraints for reasoning about qualitative conditional preferences ⋮ The complexity of exact learning of acyclic conditional preference networks from swap examples ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting ⋮ Preference-based inconsistency-tolerant query answering under existential rules
Uses Software
This page was built for publication:
