Arnaud Lequen

About me

I am a Postdoctoral Researcher at Linköping University, Sweden. I obtained my PhD in Computer Science at IRIT, France, in November 2024, under the supervision of Prof. Martin C. Cooper. My thesis focused on theoretical and practical aspects of extracting knowledge from automated planning models, without actually solving the planning problem. Before pursuing a PhD, I studied computer science and applied mathematics at École Normale Supérieure de Rennes.

More generally, I am interested in Automated Planning, Operations Research and theoretical CS — especially Complexity Theory and Logics.

You can find a quick resume here.

Publications

International Journals & Conferences

• Damien Van Meerbeeck, Arnaud Lequen, Gilles Pesant, Jendrik Seipp. An Automata-Based Constraint Programming Framework for Optimal Classical Planning. CP 2026.
• Arnaud Lequen, Clément Legrand-Lixon, Léo Saulières. Generating Explainable Counterfactual Policies through Temporal Logic Queries. KR 2026.
• Arnaud Lequen, Oliver Joergensen, Windy Phung, Elliot Gestrin, Damien Van Meerbeeck, Markus Fritzsche, Dominik Drexler, Jendrik Seipp. Planner Museum: Evaluating Classical Planners Over Time. ICAPS 2026.
• Arash Haratian, Arnaud Lequen, Daniel Gnad, Jendrik Seipp. Domain Model Acquisition From Binary Traces. ICAPS 2026.
• Arnaud Lequen, Clément Legrand-Lixon, Léo Saulières. Pareto-Q-Learning with Reward Machines. PRL workshop at ICAPS 2026.
• Arnaud Lequen, Martin C. Cooper. Analysis of Planning Instances Without Search. The European Journal on Artificial Intelligence, 2025. pdf doi
• Arnaud Lequen. Learning Interpretable Classifiers for PDDL Planning. ECAI 2024, pp. 4140–4147. pdf slides code
• Arnaud Lequen, Martin C. Cooper, Frédéric Maris. Homomorphisms and Embeddings of STRIPS Planning Models. Computational Intelligence 40(6), 2024. pdf
• Thomas Bolander, Arnaud Lequen. Parameterized Complexity of Dynamic Belief Updates: A Complete Map. Journal of Logic and Computation 33(6), pp. 1270–1300, 2023. pdf
• Martin C. Cooper, Arnaud Lequen, Frédéric Maris. Isomorphisms Between STRIPS Problems and Sub-Problems. CP 2022, pp. 13:1–13:16. pdf slides open access
• Thomas Bolander, Arnaud Lequen. Parametrized Complexity of Dynamic Belief Updates. DaLí 2020, LNCS vol. 12569, pp. 87–102. pdf slides

National Conferences

• Arnaud Lequen. Learning Interpretable Classifiers for PDDL Planning. JIAF, 2024.
• Martin C. Cooper, Arnaud Lequen, Frédéric Maris. Analysis of planning instances without search. JIAF, 2023.
• Martin C. Cooper, Arnaud Lequen, Frédéric Maris. Isomorphismes entre instances et sous-instances de planification STRIPS. JFPC, 2022.