default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDjamal Habet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c38]Yousra El Ghazi, Djamal Habet, Cyril Terrioux:
A CP Approach for the Liner Shipping Network Design Problem. CP 2023: 16:1-16:21- [c37]Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Manyà:
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. IJCAI 2023: 1979-1987 - [c36]Matthieu Py, Mohamed Sami Cherif, Djamal Habet:
Proofs and Certificates for Max-SAT (Extended Abstract). IJCAI 2023: 6942-6947 - [c35]Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, Felip Manyà:
A Tableau Calculus for Signed Maximum Satisfiability. ISMVL 2023: 170-175 - 2022
- [j8]Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He:
Boosting branch-and-bound MaxSAT solvers with clause learning. AI Commun. 35(2): 131-151 (2022) - [j7]Matthieu Py, Mohamed Sami Cherif
, Djamal Habet:
Proofs and Certificates for Max-SAT. J. Artif. Intell. Res. 75: 1373-1400 (2022) - [c34]Shoulin Li, Jordi Coll, Djamal Habet, Chu-Min Li, Felip Manyà:
A Tableau Calculus for MaxSAT Based on Resolution. CCIA 2022: 35-44 - [c33]Mohamed Sami Cherif, Djamal Habet, Matthieu Py:
From Crossing-Free Resolution to Max-SAT Resolution. CP 2022: 12:1-12:17 - [c32]Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He:
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). IJCAI 2022: 5299-5303 - 2021
- [j6]Djamal Habet, Cyril Terrioux:
Conflict history based heuristic for constraint satisfaction problem solving. J. Heuristics 27(6): 951-990 (2021) - [c31]Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux:
Combining VSIDS and CHB Using Restarts in SAT. CP 2021: 20:1-20:19 - [c30]Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He:
Combining Clause Learning and Branch and Bound for MaxSAT. CP 2021: 38:1-38:18 - [c29]Matthieu Py, Mohamed Sami Cherif, Djamal Habet:
Computing Max-SAT Refutations using SAT Oracles. ICTAI 2021: 404-411 - [c28]Matthieu Py, Mohamed Sami Cherif, Djamal Habet:
Inferring Clauses and Formulas in Max-SAT. ICTAI 2021: 632-639 - [c27]Matthieu Py, Mohamed Sami Cherif, Djamal Habet:
A Proof Builder for Max-SAT. SAT 2021: 488-498 - 2020
- [j5]Mohamed Sami Cherif, Djamal Habet, André Abramé:
Understanding the power of Max-SAT resolution through UP-resilience. Artif. Intell. 289: 103397 (2020) - [c26]Matthieu Py, Mohamed Sami Cherif, Djamal Habet:
Towards Bridging the Gap Between SAT and Max-SAT Refutations. ICTAI 2020: 137-144 - [c25]Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux:
On the Refinement of Conflict History Search Through Multi-Armed Bandit. ICTAI 2020: 264-271
2010 – 2019
- 2019
- [c24]Mohamed Sami Cherif, Djamal Habet:
Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience. CP 2019: 91-107 - [c23]Djamal Habet, Cyril Terrioux:
Conflict history based search for constraint satisfaction problem. SAC 2019: 1117-1122 - 2018
- [c22]Djamal Habet, Cyril Terrioux:
Conflict History Based Branching Heuristic for CSP Solving. CIMA@ICTAI 2018: 70-80 - 2017
- [j4]André Abramé, Djamal Habet, Donia Toumi:
Improving configuration checking for satisfiable random k-SAT instances. Ann. Math. Artif. Intell. 79(1-3): 5-24 (2017) - 2016
- [c21]André Abramé, Djamal Habet:
Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers. ICTAI 2016: 452-459 - 2015
- [c20]André Abramé, Djamal Habet:
Local Search Algorithm for the Partial Minimum Satisfiability Problem. ICTAI 2015: 821-827 - [c19]André Abramé, Djamal Habet:
On the Resiliency of Unit Propagation to Max-Resolution. IJCAI 2015: 268-274 - 2014
- [j3]André Abramé, Djamal Habet:
Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver. J. Satisf. Boolean Model. Comput. 9(1): 89-128 (2014) - [c18]André Abramé, Djamal Habet:
Efficient Application of Max-SAT Resolution on Inconsistent Subsets. CP 2014: 92-107 - [c17]André Abramé, Djamal Habet:
Local Max-Resolution in Branch and Bound Solvers for Max-SAT. ICTAI 2014: 336-343 - [c16]André Abramé, Djamal Habet, Donia Toumi:
Improving Configuration Checking for Satisfiable Random k-SAT Instances. ISAIM 2014 - [c15]André Abramé, Djamal Habet:
Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers. SOCS 2014: 2-9 - [c14]André Abramé, Djamal Habet:
On the Extension of Learning for Max-SAT. STAIRS 2014: 1-10 - [c13]André Abramé, Djamal Habet, Donia Toumi:
A Two-Levels Local Search Algorithm for Random SAT Instances with Long Clauses. STAIRS 2014: 11-20 - 2013
- [c12]Djamal Habet, Donia Toumi:
Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers. CP 2013: 678-693 - 2012
- [c11]André Abramé, Djamal Habet:
Inference Rules in Local Search for Max-SAT. ICTAI 2012: 207-214 - [c10]Djamal Habet, Donia Toumi:
Local Search Based on Conflict Analysis for the Satisfiability Problem. ICTAI 2012: 892-897 - 2010
- [j2]Djamal Habet, Michel Vasquez, Yannick Vimont:
Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite. Comput. Optim. Appl. 47(2): 307-333 (2010) - [c9]Djamal Habet, Philippe Jégou:
Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report. Abstraction, Reformulation, and Approximation 2010
2000 – 2009
- 2009
- [c8]Djamal Habet, Lionel Paris, Cyril Terrioux:
A Tree Decomposition Based Approach to Solve Structured SAT Instances. ICTAI 2009: 115-122 - [p1]Djamal Habet:
Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study. Foundations of Computational Intelligence (3) 2009: 129-151 - 2008
- [c7]Djamal Habet:
Enhancing the Robustness/Efficiency of Local Search Algorithms for SAT. ICTAI (1) 2008: 255-262 - 2007
- [c6]Djamal Habet, Lionel Paris, Belaid Benhamou:
Consistent Neighborhood for the Satisfiability Problem. ICTAI (2) 2007: 497-501 - [c5]Djamal Habet, Michel Vasquez:
Improving Local Search for Satisfiability Problem by Integrating Structural Properties. RIVF 2007: 50-57 - 2004
- [c4]Michel Vasquez, Djamal Habet:
Complete and Incomplete Algorithms for the Queen Graph Coloring Problem. ECAI 2004: 226-230 - [c3]Djamal Habet, Michel Vasquez:
Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic. ICTAI 2004: 302-309 - [c2]Michel Vasquez, Djamal Habet:
Algorithmes complet et incomplet pour la coloration des graphes de reines. JFPLC 2004 - 2003
- [j1]Michel Vasquez, Audrey Dupont, Djamal Habet:
Consistency checking within local search applied to the frequency assignment with polarization problem. RAIRO Oper. Res. 37(4): 311-323 (2003) - 2002
- [c1]Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez:
A Hybrid Approach for SAT. CP 2002: 172-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
