2024 - 2023 - 2022
- 2021 - 2020
- 2019
- 2018 - 2017
- 2016
- 2015 - 2014 - 2013 - 2012 - 2011 - 2010 - 2009 - 2008 - 2007 - 2006 - 2005 - 2004 - 2003 - 2002 - 2001 - 2000 - 1998 - 1997 - 1996 - 1995 - 1994 - 1993 - 1992 - 1991 - 1990 and before
2024
Independence
of Irrelevant Alternatives under the Lens of Pairwise Distortion AAAI 2024 : 9645-9652Discovering
Consistent Subelections AAMAS 2024 : 935-943Fair Division of Indivisible Goods Economics and Computation -- An
Introduction to Algorithmic Game Theory, Computational Social
Choice, and Fair Division 2023
Multiwinner
Voting with Possibly Unavailable Candidates AAAI 2023 : 5532-5539Fair Rent Division on a Budget Revisited ECAI 2023
Understanding
political divisiveness using online participation data
from the 2022 French and Brazilian presidential
elections Nature Human Behaviour , 2023, pp.1-84.Portioning
using ordinal preferences: Fairness and efficiency Artif. Intell. 314: 103809 (2023)Morphologic
for knowledge dynamics: revision, fusion and abduction J. Appl. Non Class. Logics 33(3-4): 421-466 (2023)
Collective
combinatorial optimisation as judgment aggregation Annals of Mathematics and Artificial Intelligence
Proportionnelle
: le retour Terra Nova
2022 Truth-Tracking via Approval Voting:
Size Matters Tahar Allouche, Jérôme Lang, Florian YgerAAAI 2022 : 4768-4775
Selecting
PhD Students and Projects with Limited Funding Jatin Jindal, Jérôme Lang, Katarína
Cechlárová, Julien LescaAAMAS 2022: 687-695
Approval
with Runoff IJCAI 2022 : 230-236Online
Approval Committee Elections IJCAI 2022 : 251-257Multi-winner
approval voting goes epistemic UAI 2022 : 75-84
Voting
behavior in one-shot and iterative multiple referenda Social Choice and Welfare , 2022
Approximating
voting rules from truncated ballots Auton. Agents Multi Agent Syst. 36(1): 24 (2022)
2021
A
Market-Inspired Bidding Scheme for Peer Review Paper
Assignment AAAI 2021 : 4776-4784
Online
Selection of Diverse Committees IJCAI 2021 : 154-160
2020
Hedonic
Games with Ordinal Preferences and Thresholds Anna
Maria Kerkmann J érôme Lang J. Artif. Intell. Res. 67 705-756 (2020 )
Knowledge-based programs as succinct
policies for partially observable domains Bruno Zanuttini Jérôme Lang Abdallah Saffidine François Schwarzentruber Artif. Intell. 288 103365 (2020 )
The
Complexity Landscape of Outcome Determination in Judgment
Aggregation .
Collective
Decision Making under Incomplete Knowledge: Possible and
Necessary Solutions Jérôme
Lang IJCAI 2020 , Survey TrackApproximating
Voting Rules from Truncated Ballots EUMAS 2020 2019
Efficient
reallocation under additive and responsive preferences Haris Aziz Péter Biró Jérôme Lang Julien Lesca Jérôme Monnot. Theor.
Comput. Sci. 790 1-15 (2019 ) Single
Transferable Vote: Incomplete Knowledge and Communication
Issues Manel
Ayadi Nahla Ben Amor Jérôme Lang Dominik
Peters AAMAS 2019 1288-1296 Portioning
Using Ordinal Preferences: Fairness and Efficiency. Stéphane
Airiau Haris
Aziz Ioannis
Caragiannis Justin Kruger Jérôme Lang Dominik
Peters IJCAI 2019 11-17 In Praise of Nonanomymity: Nonsubstitutable
Voting Jérôme Lang The
Future of Economic Design Le Référendum
d'Initiative Citoyenne Délibératif Rapport Terra Nova
2018 Une
dose de proportionnelle : pourquoi, comment, laquelle? Rapport Terra Nova Multi-attribute
proportional representation Artif. Intell. 263: 74-106 (2018)
Voting on multi-issue domains with conditionally lexicographic
preferences Artif. Intell. 265: 18-44 (2018)Group
activity selection problem with approval preferences Int. J. Game Theory 47(3): 767-796 (2018)
Knowledge, Fairness, and Social Constraints AAAI 2018 : 4638-4645 Proceedings
of the Twenty-Seventh International Joint Conference on
Artificial Intelligence, IJCAI 2018 2017 Positional
scoring-based allocation of indivisible goods Autonomous Agents and Multi-Agent System s 31(3): 628-655
(2017)A
partial taxonomy of judgment aggregation rules and their
properties Social Choice and Welfare 48(2): 327-356 (2017)Complexity
of Manipulating Sequential Allocation AAAI 2017 : 328-334
On Simplified Group Activity Selection ADT 2017 : 255-269Beyond
Electing and Ranking: Collective Dominating Chains, Dominating
Subsets and Dichotomies AAMAS 2017: 24-32Manipulation
of Hamming-based Approval Voting for Multiple Referenda and
Committee Elections AAMAS 2017 : 597-605Voting
by sequential elimination with few voters IJCAI 2017 : 128-134Proceedings
Sixteenth Conference on Theoretical Aspects of Rationality and
Knowledge, TARK 2017 Vers
la fin du scrutin majoritaire à deux tours? Libération , 20/4/172016 Finding
a collective set of items: From proportional multirepresentation
to group recommendation Artif. Intell. 241: 191-216 (2016)Conditional and Sequential Approval Voting on
Combinatorial Domains IJCAI-16 How Hard Is It for a Party to Nominate an
Election Winner? IJCAI-16 Computing Pareto Optimal Committees IJCAI-16 Boolean
Hedonic Games Haris Aziz Paul
Harrenstein Jérôme Lang Michael
Wooldridge KR 2016 166-175
Succinctness of Languages for Judgment
Aggregation Ulle Endriss ,
Umberto
Grandi ,
Ronald
de Haan ,
Jérôme Lang KR 2016 :
176-186 Multi-Attribute
Proportional Representation Jérôme Lang Piotr
Krzysztof Skowron AAAI 2016 :530-536
Agenda Separability in Judgment
Aggregation ,
Marija Slavkovik ,
Srdjan
Vesic AAAI 2016 :
1016-1022
Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang,
and Ariel D. ProcacciaIntroduction to Computational Social
Choice Handbook of Computational Social
Choice , Cambridge University Press, 2016. (Paper )
Jérôme Lang and Lirong Xia. Voting over Combinatorial Domains Handbook of Computational Social
Choice , Cambridge University Press, 2016.
Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and
Ariel D. Procaccia, editors. Handbook of Computational Social Choice WebSite )
Jérôme Lang and Jörg Rothe Fair Division of Indivisible Goods Economics and Computation -- An
Introduction to Algorithmic Game Theory, Computational Social
Choice, and Fair Division
2015 Possible and Necessary Winners of Partial
Tournaments J. Artif. Intell.
Res. (JAIR) 54: 493-534 (2015)Condorcet winning sets. Social Choice and Welfare 44(3): 493-517 (2015)Guest Editors' Introduction J. Philosophical Logic 44(2): 111-115 (2015)Finding a Collective Set of Items: From
Proportional Multirepresentation to Group Recommendation. AAAI 2015 : 2131-2137Multiple Referenda and Multiwinner Elections
Using Hamming Distances: Complexity and Manipulability. AAMAS 2015: 715-723Representing and Solving Hedonic Games with
Ordinal Preferences and Thresholds. AAMAS 2015 : 1229-1237Probabilistic Knowledge-Based Programs. IJCAI 2015 : 1594-1600Group Decision Making via Weighted Propositional
Logic: Complexity and Islands of Tractability. IJCAI 2015 : 3008-3015Twenty-Five
Years of Preferred Subtheories. Advances in Knowledge Representation, Logic Programming, and
Abstract Argumentation . Springer International Publishing,
2015. 157-172. 2014Robust
Winners and Winner Determination Policies under
Candidate Uncertainty Craig Boutilier ,
Jérôme LangJoel
Oren and Hector
Palacios AAAI-14 Rank-Dependent Scoring Rules Judy Goldsmith ,
Jérôme LangNick
Mattei and Patrice
Perny AAAI-14 Manipulating Picking Sequences ECAI-14 Positional Scoring Rules for the Allocation of
Indivisible Scoring Rules for the Allocation of Indivisible
Goods ECAI-14 How Hard is it to Compute Majority-Preserving
Judgment Aggregation Rules? ECAI-14 Actions, Belief Update, and DDL Krister
Segerberg on Logic of Action s2013 Knowledge-Based Programs as Plans -
Succinctness, and the Complexity of Plan Existence Jérôme Lang , Bruno
Zanuttini TARK-2013 Strategic
Voting and the Logic of Knowledge Hans Van
Ditmarsch , Jérôme Lang and Abdallah Saffidine TARK-2013 Incentive engineering for Boolean games Michael
Wooldridge , Ulle
Endriss , Sarit
Kraus , Jérôme Lang :Artif.
Intell. 195Propositional
Update Operators based on Formula/Literal Dependence Andreas
Herzig , Jérôme Lang and Pierre
Marquis ACM Transactions on Computational Logic , 14(3), 2013
(article 24, 33 pages).Judgment Aggregation Rules and Voting Rules Marija Slavkovik and Jérôme Lang ADT-2013 Possible and Necessary Winners in Single-Winner
and Multiwinner Approval Voting Laurent Gourves ,
Jérôme Lang, Jérôme
Monnot and Bernard
Ries ADT-2013 New Results on Strategic Candidacy Nicolas
Maudet and Maria
Polukarov SAGT-2013 2012 Effectivity
functions and efficient coalitions in Boolean games
Synthese , 187(1):73–103, 2012.New candidates welcome! Possible
winners with respect to the addition of new
candidates Yann
Chevaleyre , Jérôme Lang ,
Nicolas
Maudet , Jérôme
Monnot , Lirong
Xia Mathematical
Social Sciences 64Winner
determination in voting trees with incomplete preferences
and weighted votes Maria
Silvia Pini , Francesca
Rossi , Domenico
Salvagnin , Kristen
Brent Venable , Toby
Walsh Autonomous
Agents and Multi-Agent Systems 25 Campaigns for lazy voters: truncated ballots Dorothea
Baumeister , Piotr
Faliszewski , Jérôme Lang , Jörg
Rothe AAMAS
2012 Possible and necessary winners of partial
tournaments Haris
Aziz , Paul
Harrenstein , Markus
Brill , Jérôme Lang , Felix
A. Fischer , Hans
Georg Seedig AAMAS
2012 Strategic voting and the logic of knowledge Hans
P. van Ditmarsch , Jérôme Lang ,
Abdallah
Saffidine AAMAS
2012 Aggregating Conditionally Lexicographic
Preferences on Multi-issue Domains Jérôme Lang , Jérôme
Mengin , Lirong
Xia CP
2012 Knowledge-Based Programs as Plans - The
Complexity of Plan Verification Jérôme Lang , Bruno
Zanuttini ECAI
2012 Group Activity Selection Problem Andreas
Darmann , Edith
Elkind , Sascha
Kurz , Jérôme Lang , Joachim
Schauer , Gerhard
J. Woeginger WINE
2012 Logic, Rationality, and Interaction
Hans
P. van Ditmarsch , Jérôme Lang, Shier
Ju
Designing incentives for Boolean
games Ulle
Endriss , Sarit
Kraus , Jérôme Lang, Michael
Wooldridge AAMAS
2011
Possible winners when new
alternatives join: new results coming up! Lirong
Xia , Jérôme Lang, Jérôme
Monnot AAMAS
2011
Strategic sequential voting in
multi-issue domains and multiple-election paradoxes Lirong
Xia , Vincent
Conitzer , Jérôme LangACM
Conference on Electronic Commerce 2011
Hypercubewise Preference
Aggregation in Multi-Issue Domains Vincent
Conitzer , Jérôme Lang, Lirong
Xia IJCAI
2011
Choosing Collectively Optimal
Sets of Alternatives Based on the Condorcet Criterion Edith
Elkind , Jérôme Lang, Abdallah
Saffidine IJCAI
2011
Incentive Engineering for Boolean
Games Ulle
Endriss , Sarit
Kraus , Jérôme Lang, Michael
Wooldridge IJCAI
2011
A General Elicitation-Free
Protocol for Allocating Indivisible Goods Sylvain
Bouveret , Jérôme LangIJCAI
2011
Compilation and communication
protocols for voting rules with a dynamic set of candidates Yann
Chevaleyre , Jérôme Lang, Nicolas
Maudet , Jérôme
Monnot TARK
2011 Judgment aggregation rules based on
minimization Jérôme Lang, Gabriella
Pigozzi , Marija
Slavkovik , Leendert
van der Torre TARK
2011 A
partial taxonomy of judgment aggregation rules and their
properties Social Choice and Welfare 48(2):
327-356 (2017)
Belief extrapolation (or how to
reason about observations and unpredicted change) Florence
Dupin de Saint-Cyr , Jérôme LangArtif.
Intell. 175 (
Guest editorial: special issue on
computational social choice Edith
Elkind , Jérôme LangAutonomous
Agents and Multi-Agent Systems 22
Reasoning under inconsistency: A
forgetting-based approach. Pierre
Marquis Artif.
Intell . 174
From
preference logics to preference languages, and back Proceedings of KR-10.
Aggregating
preferences in multi-issue domains by using maximum likelihood
estimators classes of lexicographic orderings Proceedings of AAMAS-10.
Learning conditionally
lexicographic preference relations Proceedings of ECAI 2010 : 269-274
Graphical Representation of
Ordinal Preferences: Languages and Applications. Proceedings of 18th International Conference on Conceptual
Structures (ICCS 2010) . Lecture Notes in Computer Science
6208 Springer 2010, 3--9. Fair Division under Ordinal
Preferences: Computing Envy-Free Allocations of Indivisible
Goods Proceedings of ECAI-2010 , 387-392.
Possible Winners when New
Candidates are Added: the Case of Scoring Rules Proceedings of AAAI-2010 .2009 Learning ordinal preferences on
multiattribute domains: the case of CP-nets Preference Learning (J.
Fürnkranz and E. Hüllermeier, eds.), Springer-Verlag. Conditional importance networks: a
graphical language for representing ordinal, monotonic
preferences over sets of goods Proceedings of IJCAI-09 How hard is it to control sequential
elections via the agenda? Proceedings of IJCAI-09 Compiling the votes of a
subelectorate Jérôme Lang, Nicolas
Maudet and Guillaume Ravilly-Abadie Proceedings of IJCAI-09 The complexity of learning ceteris
paribus separable preferences Proceedings of IJCAI-09 A dichotomy theorem on the existence
of efficient or neutral sequential voting correspondences Proceedings of IJCAI-09
Sequential
composition of voting rules in multi-issue domains Jérôme Lang and Lirong Xia Mathematical Social Sciences , Vol.
57 N. 3, p. 304-324, 2009.
Dependencies Between Players in
Boolean Games International Journal of Approximate Reasoning , vol. 50, p.
899-914, 2009.Short
version : ECSQARU 2007 ,
743-754, 2007)
Representing Utility Functions
via Weighted Goals. 55 (4):341-361, 2009.2008
The
Computational Complexity of Dominance and Consistency in CP-nets Judy Goldsmith, Jérôme Lang, Miroslaw
Truszczynski, Nic Wilson.Journal of Artificial Intelligence Research , Vol. 33, p.
403-432, 2009
Efficiency and Envy-freeness in
Fair Division of Indivisible Goods: Logical Representation and
Complexity Journal of Artificial Intelligence Research , Vol. 32,
p. 525-564, 2008.
Compact preference representation
and Boolean games Autonomous Agents and Multi-Agent Systems journal , vol. 18
p.1-35, 2009.
Voting in Combinatorial Domains:
What Logic and AI Have to Say Proceedings of JELIA 2008 ,5-7
Preference Handling in
Combinatorial Domains: From AI to Social Choice. 29 (4):37-46,
2008. Voting on Multiattribute Domains
with Cyclic Preferential Dependencies AAAI 2008 , 202-207
From belief change to preference
change Proceedings of ECAI-2008
Single-peaked consistency and
its complexity Proceedings of ECAI-2008
Efficient coalitions in Boolean
games New
Perspectives on Games and Interaction (K. Apt and R. van
Rooij, Eds.), vol. 4 of Texts
in Logic and Games , p.283-297. Amsterdam University Press,
2008.
On propositional definability 2007
A Short Introduction to
Computational Social Choice Proceedings of the 33rd Conference on Current Trends in
Theory and Practice of Computer Science (SOFSEM-2007) , LNCS,
volume 4362, Springer-Verlag, January 2007.
Vote and Aggregation in
Combinatorial Domains with Structured Preferences Proceedings of IJCAI 200 7,
1366-1371
Belief Update Revisited Proceedings of IJCAI 200 7,
2517-2522 (poster) Belief change based on global
minimization Proceedings of IJCAI 200 7,
2468-2473
Winner Determination in
Sequential Majority Voting Proceedings of IJCAI 2007 ,
1372-1377 Sequential voting rules and multiple
election paradoxes When are elections with few
candidates hard to manipulate?
Strongly Decomposable Voting
Rules on Multiattribute Domains AAAI 2007 , 776-781, 2007
Purely Epistemic Markov Decision
Processes AAAI 2007 , 1057-1062, 20072006
Boolean
games revisited Proceedings of ECAI-2006 ,
265-269
Compact Preference Representation for Boolean Games Proceedings of PRICAI
2006 : 41-50 Iterated revision as prioritized
merging Proceedings of KR 2006 ,
210-220
Representing Policies for
Quantified Boolean Formulae. Proceedings of KR 2006 ,
286-297 Expressive Power of Weighted
Propositional Formulas for Cardinal Preference Modeling Proceedings of KR 2006 ,
145-152
Variable Forgetting in Preference
Relations over Propositional Domains. Proceedings of ECAI 2006 : 763-7642005
From Knowledge-Based Programs to
Graded Belief-Based Programs Part I: On-Line Reasoning. Synthese , Springer Netherlands, vol. 147, no. 2, pp.
277-321
The
computational complexity of dominance and consistency in CP-nets Proceedings of IJCAI-2005 ,
144-149.
Efficiency and envy-freeness in fair division of indivisible
good: logical representation and complexity Proceedings of IJCAI-2005 ,
935-940.
From Knowledge-Based Programs to
Graded Belief-Based Programs Part II: Off-Line Reasoning.
Proceedings of IJCAI-2005 ,
497-502.
Reasoning under inconsistency: the
forgotten connective Proceedings of IJCAI-2005 ,
484-489.
Negotiating over small bundles of
resources. Proceedings of AAMAS 2005 ,
296-302.
Voting procedures with incomplete
preferences Warning! Proposition 2 is false
(and so is Corollary 1). See L.
Xia and V. Conitzer, Determining Possible and Necessary Winners
under Common Voting Rules Given Partial Orders, AAAI-08,
196-201, 2008.
Some Representation and
Computational Issues in Social Choice. Proceedings of ECSQARU 2005 ,
15-26revised
and longer version with Y. Chevaleyre, U. Endriss and N.
Maudet (in Proceedings of
SOFSEM-2007 )Logical
preference representation and combinatorial vote Annals of Mathematics and Artificial Intelligence 42:
37-71, 2004
DA 2 merging
operators Artificial Intelligence
157(1-2): 49-79 (2004)
From Knowledge-Based Programs to
Graded Belief-Based Programs Part I: On-Line Reasoning. Proceedings of ECAI 2004 ,
368-372
A Preference-Based Interpretation
of Other Agents' Actions Proceedings of ICAPS 2004 , 33-42 and KR
2004,
Expressive Power and Succinctness
of Propositional Languages for Preference Representation Proceedings of KR 2004 ,
203-212
Habilitation
à diriger des recherches
Action representation and partially observable planning in
epistemic logic
Eighteenth International Joint Conference on Artificial
Intelligence (IJCAI'03) , 1067-1072Causal
theories of action: a computational core Eighteenth International Joint Conference on Artificial
Intelligence (IJCAI'03) , 1073-1078
Hidden
uncertainty in the logical representation of desires Eighteenth International Joint Conference on Artificial
Intelligence (IJCAI'03) , 685-690
Quantifying
information and contradiction in propositional logic through
test actions Eighteenth International Joint Conference on Artificial
Intelligence (IJCAI'03) , 106-111
Propositional
Independence - Formula-Variable Independence and Forgetting
Journal of Artificial Intelligence Research 18:391-443,
2003.
How
many candidates are needed to make an election hard to
manipulate? Proceedings of the 9th Conference on Theoretical Aspects of
Rationality and Knowledge (TARK-03) , 201-214
Vote électronique : problèmes algorithmiques Sciences de la Société (in French) 2003
Conditional
Independence in Propositional Logic Artificial Intelligence 141(1-2):79-121, 2002
Utilitarian
desires International Journal of Autonomous Agents and Multi-Agent
Systems 5, 329-363, 2002, Kluwer Academic Publishers
From
preference representation to combinatorial vote Proceedings of the 8th International Conference on Principles
of Knowledge Representation and Reasoning (KR2002) , 277-288.
Belief
extrapolation (or how to reason about observations and
unpredicted change) Proceedings of the 8th International Conference on Principles
of Knowledge Representation and Reasoning (KR2002) , 497-508
Distance-based merging: a general framework and some complexity
results Proceedings of the Eighth International Conference on Principles
of Knowledge Representation and Reasoning (KR2002), 97-108 DA 2 merging
operators
Artificial Intelligence 157(1-2): 49-79 (2004)
Resolving
Inconsistencies by Variable Forgetting Proceedings of the 8th International Conference on Principles
of Knowledge Representation and Reasoning (KR2002) , 239-250
Removing
Inconsistencies in Assumption-based Theories through
Knowledge-Gathering Actions Studia Logica 67(2):179-214, 2001
Plausible reasoning from spatial observations Proceedings of the Seventeenth Conference on Uncertainty in
Artificial Intelligence (UAI-01) , 285-292
Updates,
Actions and Planning Proceedings of 17th International Joint Conference on
Artificial Intelligence (IJCAI'01) , 119-124
Updating
Epistemic States Proceedings of 14th Australian Joint Conference on Artificial
Intelligence (AI'01), Lecture Notes in Artificial Intelligence 2256,
Springer-Verlag, Adelaide, 2001 (297-308).
Propositional distances and preference representation
Lectures Notes in Artificial Intelligence 2143 (Proceedings of
ECSQARU-2001) , 48-59, 2001, Springer-Verlag.
Logical representation of preference for group decision
making Proceedings of the 7th International Conference on Principles
of Knowledge Representation and Reasoning (KR2000) , 457-468
Propositional
Logic and One-stage Decision Making Proceedings of the 7th International Conference on Principles
of Knowledge Representation and Reasoning (KR2000) , 445-456
A
logic for planning under partial observability Proceedings of AAAI'2000
A modal logic for epistemic tests Proceedings of ECAI'2000
Towards
mathematical ``morpho-logics'' Proceedings of IPMU'2000 . Revised version in Technologies
for Contructing Intelligent Systems , Vol. 2, 367-380,
Springer-Verlag, 2002.
In
Search of the Right Extension Proceedings of the 7th International Conference on Principles
of Knowledge Representation and Reasoning (KR2000) , 625-636
Graded
paraconsistency -- Reasoning with inconsistent and uncertain
knowledge Frontiers of Paraconsistent Logic , King's College
Publications (co-editors: C. Mortenson, G. Priest, J.P. Van
Bendegem), 2000.
Possibilistic
logic: complexity and algorithms Handbook of Defeasible Reasoning
and Uncertainty Management Systems (D. Gabbay and Ph.
Smets, eds.),
Complexity
Results for Independence and Definability in Propositional
Logic Proceedings of the 6th International Conference on Principles
of Knowledge Representation and Reasoning (KR'98) , 356-367.
Two
forms of Dependence in Propositional Logic : Controllability
and Definability Proceedings of the 15th National Conference on Artificial
Intelligence (AAAI'98), 268-273
Toward
qualitative approaches to multi-stage decision making International Journal on Approximate Reasoning 19 (1998),
441-471.
A general approach for inconsistency handling and merging
information in prioritized knowledge bases Proceedings of the 6th International Conference on Principles
of Knowledge Representation and Reasoning (KR'98) , 466-477.
Reasoning about unpredicted change and explicit time Qualitative and Quantitative Practical Reasoning, Lectures Notes
in Artificial Intelligence 1244, Springer-Verlag, 1997,
223-236.
Possibilistic
planning: representation and complexity Recent Advances in Planning (Proceedings of ECP'99)
Planning
with graded nondeterministic actions: a possibilistic approach
International Journal of Intelligent Systems , 12 (11/12),
1997, 935-962.
Planning
to discriminate diagnoses Proceedings of DX'97 , Le Mont St Michel, Sept. 1997,
135-139
Traitement de problèmes de décision sous incertitude par des
problèmes de satisfaction de contraintes Revue d'Intelligence Artificielle Vol. 11, num. 3,
Septembre 1997, Hermès, 375-398.
Conditional
desires and utilities -- An alternative logical framework for
qualitative decision theory Proceedings of the 12th European Conference on Artificial
Intelligence (ECAI'96) , 318-322
Mixed
constraint satisfaction: a framework for decision under
incomplete knowledge Proceedings of AAAI'96 , 175-180
Linking transition-based update and base revision Proceedings of ECSQARU'95, Lectures Notes in Artificial
Intelligence 946 , Springer Verlag, 133-141.
A
constraint satisfaction framework for decision under
uncertainty Proceedings of the 10th Int. Conf. on Uncertainty in Artificial
Intelligence (UAI'95) , 167-174.
A nonmonotonic approach to spatial persistence based on
distances and boundaries
Possibility
and necessity functions over non-classical logics Proceedings of the 10th Int. Conf. on Uncertainty in Artificial
Intelligence (UAI'94), 69-76
Syntax-based
default reasoning as probabilistic model-based diagnosis Proceedings of the 10th Int. Conf. on Uncertainty in Artificial
Intelligence (UAI'94) , 391-398
Possibilistic
logic Handbook of Logic for Artificial Intelligence and Logic
Programming , Clarendon Press, Oxford, Vol.3,
439-513, 1994.
Penalty
logic and its links with Dempster-Shafer theory
Ordering-based nonmonotonic reasoning Artificial Intelligence Journal , 66:375-393, 1994
When
nonmonotonicity comes from distances Proceedings of KI'94, Lectures Notes in Artificial Intelligence ,
Vol. 861, 308-318.
Inconsistency management and prioritized syntax-based
entailment Proceedings of the 13th International Joint Conference on
Artificial Intelligence (IJCAI'93) , 640-645. Possibilistic decreasing persistence UAI 1993 : 469-476
Inconsistency in possibilistic knowledge bases: to live or not
live with Fuzzy Logic for the Management of Uncertainty (L. Zadeh, J.
Kacprzyk, eds.), Wiley, 1992, 335-352. Proceedings of the 10th Eur. Conf. on Artificial Intelligence
(ECAI'92) , pages 314-318.
Dealing with Multi-Source
Information in Possibilistic Logic Proceedings of the 10th Eur. Conf. on Artificial Intelligence
(ECAI'92) , pages 38-42Possibilistic logic as a logical
framework for min-max discrete optimisation problems and
prioritized constraints Towards Possibilistic Logic
Programming
A
Logic of Graded Possibility and Certainty Coping with Partial
Inconsistency
Timed possibilistic logic Fundam. Inform. 15(3-4):
211-234 (1991)
Semantic Evaluation in
Possibilistic Logic, Application to Min-Max Discrete Optimisation
Problems IPMU 1990: 260-268A Possibilistic Assumption-Based
Truth Maintenance System with Uncertain Justifications, and its
Application to Belief Revision Didier Dubois, Jérôme Lang, Henri PradeTruth
Maintenance
Systems
(ECAI
Workshop)
1990 : 87-106Logique possibiliste et logique
floue -- Application au raisonnement automatisé et aux systèmes
d'information (in French) Vincent Andrès, Didier Dubois, Jérôme Lang and Henri PradeMéthodes Logiques et Systèmes
d'Intelligence Artificielle (L. Iturrioz, A. Duchaussoy,
eds.), Hermès, 163-181, 1990
Theorem
Proving Under Uncertainty - A Possibility Theory-based Approach IJCAI 1987 : 984-986
Jérôme lang