Djamal Habet

According to our database1, Djamal Habet authored at least 46 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Tableau Calculus for Signed Maximum Satisfiability.
Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

Proofs and Certificates for Max-SAT (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A CP Approach for the Liner Shipping Network Design Problem.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
Proofs and Certificates for Max-SAT.
J. Artif. Intell. Res., 2022

Boosting branch-and-bound MaxSAT solvers with clause learning.
AI Commun., 2022

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

From Crossing-Free Resolution to Max-SAT Resolution.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

A Tableau Calculus for MaxSAT Based on Resolution.
Proceedings of the Artificial Intelligence Research and Development, 2022

2021
Conflict history based heuristic for constraint satisfaction problem solving.
J. Heuristics, 2021

A Proof Builder for Max-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Inferring Clauses and Formulas in Max-SAT.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

Computing Max-SAT Refutations using SAT Oracles.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

Combining Clause Learning and Branch and Bound for MaxSAT.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Combining VSIDS and CHB Using Restarts in SAT.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Understanding the power of Max-SAT resolution through UP-resilience.
Artif. Intell., 2020

Towards Bridging the Gap Between SAT and Max-SAT Refutations.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

On the Refinement of Conflict History Search Through Multi-Armed Bandit.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

2019
Conflict history based search for constraint satisfaction problem.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
Conflict History Based Branching Heuristic for CSP Solving.
Proceedings of the 8th International Workshop on Combinations of Intelligent Methods and Applications co-located with 30th International Conference on Artificial Intelligence Tools (ICTAI 2018), 2018

2017
Improving configuration checking for satisfiable random k-SAT instances.
Ann. Math. Artif. Intell., 2017

2016
Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

2015
On the Resiliency of Unit Propagation to Max-Resolution.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Local Search Algorithm for the Partial Minimum Satisfiability Problem.
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

2014
Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver.
J. Satisf. Boolean Model. Comput., 2014

A Two-Levels Local Search Algorithm for Random SAT Instances with Long Clauses.
Proceedings of the STAIRS 2014, 2014

On the Extension of Learning for Max-SAT.
Proceedings of the STAIRS 2014, 2014

Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Local Max-Resolution in Branch and Bound Solvers for Max-SAT.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Efficient Application of Max-SAT Resolution on Inconsistent Subsets.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Local Search Based on Conflict Analysis for the Satisfiability Problem.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Inference Rules in Local Search for Max-SAT.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

2010
Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite.
Comput. Optim. Appl., 2010

Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report.
Proceedings of the Abstraction, 2010

2009
Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study.
Proceedings of the Foundations of Computational Intelligence, 2009

A Tree Decomposition Based Approach to Solve Structured SAT Instances.
Proceedings of the ICTAI 2009, 2009

2008
Enhancing the Robustness/Efficiency of Local Search Algorithms for SAT.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007
Improving Local Search for Satisfiability Problem by Integrating Structural Properties.
Proceedings of the 2007 IEEE International Conference on Research, 2007

Consistent Neighborhood for the Satisfiability Problem.
Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2004
Algorithmes complet et incomplet pour la coloration des graphes de reines.
Proceedings of the Programmation en logique avec contraintes, 2004

Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Complete and Incomplete Algorithms for the Queen Graph Coloring Problem.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003
Consistency checking within local search applied to the frequency assignment with polarization problem.
RAIRO Oper. Res., 2003

2002
A Hybrid Approach for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2002


  Loading...