37 citations · 61 across the 3 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2013★ 9 cited
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence
Jerome Lang, Bruno Zanuttini
Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge. The use of KBPs for expressing acti…
cs.AI2013★ 37 cited
Probabilistic Conditional Preference Networks
Damien Bigot, Bruno Zanuttini, Helene Fargier +1
In order to represent the preferences of a group of individuals, we introduce Probabilistic CP-nets (PCP-nets). PCP-nets provide a compact language for representing probability dis…
cs.AI2011★ 15 cited
New Polynomial Classes for Logic-Based Abduction
B. Zanuttini
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given prop…