Jean-Marie Lagniez

Emmanuel Lonca

Jean-Guy Mailly

Julien Rossit

Proceedings of the Third International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 8th International Conference on Computational Models of Argument (COMMA 2020), 2020

2019

What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An Incremental SAT-Based Approach to the Graph Colouring Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

A Recursive Algorithm for Projected Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Promenade au-delà de NP. (Beyond NP).

[BibT_eX]

[DOI]

, 2019

2018

Preface.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2018

Consensus-finding that preserves mutually conflicting hypothetical information from a same agent.

[BibT_eX]

[DOI]

AI Commun., 2018

Probabilistic Coalition Structure Generation.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

A SAT-Based Approach For PSPACE Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

DMC: A Distributed Model Counter.

[BibT_eX]

[DOI]

Nicolas Szczepanski

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Boosting MCSes Enumeration.

[BibT_eX]

[DOI]

Yacine Izza

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017

On Preprocessing Techniques and Their Impact on Propositional Model Counting.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

A Distributed Version of Syrup.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Boosting Distance-Based Revision Using SAT Encodings.

[BibT_eX]

[DOI]

Sébastien Konieczny

Proceedings of the Logic, Rationality, and Interaction - 6th International Workshop, 2017

An Improved Decision-DNNF Compiler.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Computing One Max_Subset Inclusion Consensus.

[BibT_eX]

[DOI]

Yacine Izza

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Defining and Evaluating Heuristics for the Compilation of Constraint Networks.

[BibT_eX]

[DOI]

Anastasia Paparrizou

Proceedings of the Principles and Practice of Constraint Programming, 2017

Combining Nogoods in Restart-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

SAT Encodings for Distance-Based Belief Merging Operators.

[BibT_eX]

[DOI]

Sébastien Konieczny

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

RCL: An A. I. Tool for Computing Maximal Consensuses.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2016

A Computational Method for Enforcing Knowledge that Cannot be Subsumed.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2016

Improving Model Counting by Leveraging Definability.

[BibT_eX]

[DOI]

Emmanuel Lonca

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

On Consensus Extraction.

[BibT_eX]

[DOI]

Sébastien Konieczny

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A Computational Approach to Consensus-Finding.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

An Improved CNF Encoding Scheme for Probabilistic Inference.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On Computing Non-hypocritical Consensuses in Standard Logic.

[BibT_eX]

[DOI]

Proceedings of the 27th International Workshop on Database and Expert Systems Applications, 2016

An Adaptive Parallel SAT Solver.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

On Checking Kripke Models for Modal Logic K.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), 2016

On the Extraction of One Maximal Information Subset That Does Not Conflict with Multiple Contexts.

[BibT_eX]

[DOI]

Yacine Izza

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Logical consensuses for case-based reasoning and for mathematical engineering of AI.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Cognitive Informatics & Cognitive Computing , 2016

2015

On getting rid of the preprocessing minimization step in MUC-finding algorithms.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

On Anti-subsumptive Knowledge Enforcement.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Compiling Constraint Networks into Multivalued Decomposable Decision Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver.

[BibT_eX]

[DOI]

Emmanuel Lonca

Jean-Guy Mailly

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts.

[BibT_eX]

[DOI]

Philippe Besnard

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Améliorer SAT dans le cadre incrémental.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2014

Boosting MUC extraction in unsatisfiable constraint networks.

[BibT_eX]

[DOI]

Appl. Intell., 2014

Multiple Contraction through Partial-Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Enforcing Solutions in Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Symmetry-Driven Decision Diagrams for Knowledge Compilation.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A General Artificial Intelligence Approach for Skeptical Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Artificial General Intelligence - 7th International Conference, 2014

Preprocessing for Propositional Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

An Experimentally Efficient Method for (MSS, CoMSS) Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Improving MUC extraction thanks to local search.

[BibT_eX]

[DOI]

CoRR, 2013

Factoring Out Assumptions to Speed Up MUS Extraction.

[BibT_eX]

[DOI]

Armin Biere

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction.

[BibT_eX]

[DOI]

Gilles Audemard

Laurent Simon

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Knowledge Compilation for Model Counting: Affine Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Preserving Partial Solutions While Relaxing Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Just-In-Time Compilation of Knowledge Bases.

[BibT_eX]

[DOI]

Gilles Audemard

Laurent Simon

Proceedings of the IJCAI 2013, 2013

Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012

Revisiting Clause Exchange in Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Relax!

[BibT_eX]

[DOI]

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

2011

On Freezing and Reactivating Learnt Clauses.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Dynamic Polarity Adjustment in a Parallel SAT Solver.

[BibT_eX]

[DOI]

Long Guo

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

A CSP Solver Focusing on fac Variables.

[BibT_eX]

[DOI]