paper-with-me

Papers

An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages

2021-02-08 · Hélène Fargier, Stefan Mengel, Jérôme Mengin

Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexicographic preference trees. Several works have addressed the complexity of some queries (optimization, dominance in particular). We extend in this paper some of these results, and study other queries which have not been addressed so far, like equivalence, and transformations, like conditioning and variable elimination, thereby contributing to a knowledge compilation map for languages based on conditional preference statements. We also study the expressiveness and complexity of queries and transformations for generalized additive utilities.

📄 PDF Abstract BibTeX arXiv:2102.04107

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements

2011-06-30 · C. Boutilier, R. I. Brafman, C. Domshlak, H. H. Hoos 외

Information about user preferences plays a key role in automated decision making. In many domains it is desirable to assess such preferences in a qualitative rather than quantitative way. In this paper, we propose a qual…

Decision Making

Fool Me, Fool Me: User Attitudes Toward LLM Falsehoods

2024-12-16 · Diana Bar-Or Nirman, Ariel Weizman, Amos Azaria

While Large Language Models (LLMs) have become central tools in various fields, they often provide inaccurate or false information. This study examines user preferences regarding falsehood responses from LLMs. Specifical…

Constrained Optimization with Qualitative Preferences

2021-09-24 · Sultan Ahmed, Malek Mouhoub

The Conditional Preference Network (CP-net) graphically represents user's qualitative and conditional preference statements under the ceteris paribus interpretation. The constrained CP-net is an extension of the CP-net, …

ZS4C: Zero-Shot Synthesis of Compilable Code for Incomplete Code Snippets using LLMs

2024-01-25 · Azmain Kabir, Shaowei Wang, Yuan Tian, Tse-Hsun Chen 외

Technical Q&A sites are valuable for software developers seeking knowledge, but the code snippets they provide are often uncompilable and incomplete due to unresolved types and missing libraries. This poses a challenge f…

The Compilation of Decision Models

2013-03-27 · David Heckerman, John S. Breese, Eric J. Horvitz

We introduce and analyze the problem of the compilation of decision models from a decision-theoretic perspective. The techniques described allow us to evaluate various configurations of compiled knowledge given the natur…