881 citations · 1.4k across the 15 of their papers we have counts for
4 papers · 1 filter
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
C. Domshlak, J. Hoffmann
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF…
On Graphical Modeling of Preference and Importance
R. I. Brafman, C. Domshlak, S. E. Shimony
In recent years, CP-nets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CP-nets capture and support reasoning with qualitative…
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
C. Boutilier, R. I. Brafman, C. Domshlak +2
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 quantitati…
Structure and Complexity in Planning with Unary Operators
R. I. Brafman, C. Domshlak
Unary operator domains -- i.e., domains in which operators have a single effect -- arise naturally in many control problems. In its most general form, the problem of STRIPS plannin…