Reasoning with Preference Trees over Combinatorial Domains

DOI10.1007/978-3-319-23114-3_2zbMath1405.91138OpenAlexW2234689278MaRDI QIDQ3449520

Miroslaw Truszczynski, Xu-Dong Liu

Publication date: 4 November 2015

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23114-3_2

zbMATH Keywords

computational complexityreasoningpreference trees

Mathematics Subject Classification ID

Individual preferences (91B08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A general framework for preferences in answer set programming ⋮ Probabilistic lexicographic preference trees ⋮ Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains

This page was built for publication: Reasoning with Preference Trees over Combinatorial Domains