activity
20032024
most citedThe Computational Complexity of Dominance and Consistency in CP-Nets

141 citations · 180 across the 25 of their papers we have counts for

collaborators
Showing 2013Show all

11 papers · 1 filter

cs.GT2013

Strategic Voting and the Logic of Knowledge

Hans van Ditmarsch, Jerome Lang, Abdallah Saffidine

We propose a general framework for strategic voting when a voter may lack knowledge about other votes or about other voters' knowledge about her own vote. In this setting we define…

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.GT2013

New Results on Equilibria in Strategic Candidacy

Jérôme Lang, Nicolas Maudet, Maria Polukarov +1

We consider a voting setting where candidates have preferences about the outcome of the election and are free to join or leave the election. The corresponding candidacy game, where…

cs.AI2013

Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision and Variable Certainty Weights

Didier Dubois, Jerome Lang, Henri Prade

In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a…

cs.AI2013

A Logic of Graded Possibility and Certainty Coping with Partial Inconsistency

Jerome Lang, Didier Dubois, Henri Prade

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or po…

cs.AI2013

Possibilistic decreasing persistence

Dimiter Driankov, Jerome Lang

A key issue in the handling of temporal data is the treatment of persistence; in most approaches it consists in inferring defeasible confusions by extrapolating from the actual kno…