|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 83 occurrences of 63 keywords
|
|
|
Results
Found 295 publication records. Showing 294 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
127 | Louise Leenen, Anbulagan, Thomas Meyer 0002, Aditya K. Ghose |
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
110 | Adi Avidor, Ido Berkovitch, Uri Zwick |
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
109 | Dave A. D. Tompkins, Holger H. Hoos |
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT. |
AI |
2003 |
DBLP DOI BibTeX RDF |
|
107 | Eran Halperin, Uri Zwick |
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
105 | Takao Asano |
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithm, LP-relaxation, MAX SAT |
99 | Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov |
Solution and Optimization of Systems of Pseudo-Boolean Constraints. |
IEEE Trans. Computers |
2007 |
DBLP DOI BibTeX RDF |
Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT) |
93 | Zhaohui Fu, Sharad Malik |
On Solving the Partial MAX-SAT Problem. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
90 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
Encoding Max-CSP into Partial Max-SAT. |
ISMVL |
2008 |
DBLP DOI BibTeX RDF |
Minimal Support, Max-CSP, Partial Max-SAT, Encodings |
88 | Josep Argelich, Felip Manyà |
Exact Max-SAT solvers for over-constrained problems. |
J. Heuristics |
2006 |
DBLP DOI BibTeX RDF |
Soft constraints, Solvers, Max-SAT |
85 | Kevin Smyth, Holger H. Hoos, Thomas Stützle |
Iterated Robust Tabu Search for MAX-SAT. |
AI |
2003 |
DBLP DOI BibTeX RDF |
|
82 | Miquel Bofill, Dídac Busquets, Mateu Villaret |
A declarative approach to robust weighted Max-SAT. |
PPDP |
2010 |
DBLP DOI BibTeX RDF |
max-sat, robustness |
82 | Teresa Alsinet, Felip Manyà, Jordi Planes |
An efficient solver for weighted Max-SAT. |
J. Glob. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT |
82 | Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li |
On Inconsistent Clause-Subsets for Max-SAT Solving. |
CP |
2007 |
DBLP DOI BibTeX RDF |
Unit Propagation, Inconsistent Subset, Max-SAT |
82 | Teresa Alsinet, Felip Manyà, Jordi Planes |
A Max-SAT Solver with Lazy Data Structures. |
IBERAMIA |
2004 |
DBLP DOI BibTeX RDF |
data structures, heuristics, lower bound, branch and bound, Max-SAT |
80 | Federico Heras, Javier Larrosa |
Local Consistency in Weighted CSPs and Inference in Max-SAT. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
79 | Federico Heras, Javier Larrosa |
A Max-SAT Inference-Based Pre-processing for Max-Clique. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
Max-clique, Inference, Max-SAT |
74 | Josep Argelich, Felip Manyà |
Partial Max-SAT Solvers with Clause Learning. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
73 | Chu Min Li, Felip Manyà, Jordi Planes |
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
73 | Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah |
Generic ILP versus specialized 0-1 ILP: an update. |
ICCAD |
2002 |
DBLP DOI BibTeX RDF |
|
73 | Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex |
Solving Max-SAT as Weighted CSP. |
CP |
2003 |
DBLP DOI BibTeX RDF |
|
72 | Zhao Xing, Weixiong Zhang |
Efficient Strategies for (Weighted) Maximum Satisfiability. |
CP |
2004 |
DBLP DOI BibTeX RDF |
|
68 | Federico Heras, Javier Larrosa, Albert Oliveras |
MiniMaxSat: A New Weighted Max-SAT Solver. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
68 | Karima Benatchba, Lotfi Admane, Mouloud Koudil |
Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One. |
IWINAC (2) |
2005 |
DBLP DOI BibTeX RDF |
Optimisation using bees, MBO algorithm, Data-Mining, Optimization, Satisfiability, Maximum-Satisfiability |
67 | Mark H. Liffiton, Karem A. Sakallah |
Generalizing Core-Guided Max-SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
66 | Dave A. D. Tompkins, Holger H. Hoos |
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
64 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
Modelling Max-CSP as Partial Max-SAT. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
63 | Emilia Oikarinen, Matti Järvisalo |
Max-ASP: Maximum Satisfiability of Answer Set Programs. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
63 | John Thornton 0001, Stuart Bain, Abdul Sattar 0001, Duc Nghia Pham |
A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints. |
Australian Joint Conference on Artificial Intelligence |
2002 |
DBLP DOI BibTeX RDF |
|
62 | Abdelraouf Ishtaiwi, John Thornton 0001, Abdul Sattar 0001 |
Weight Redistribution for Unweighted MAX-SAT. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
62 | Konstantinos Georgiou, Periklis A. Papakonstantinou |
Complexity and Algorithms for Well-Structured k-SAT Instances. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Takao Ono, Tomio Hirata, Takao Asano |
An Approximation Algorithm for MAX 3-SAT. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
60 | Frédéric Lardeux |
Approches Hybrides pour les problèmes de Satisfiabilité (SAT et MAX-SAT). (Hybrid approaches for the satisfiability problems (SAT and MAX-SAT)). |
|
2005 |
RDF |
|
56 | Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos |
On the Performance of Congestion Games for Optimum Satisfiability Problems. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
non oblivious local search, max sat, approximation algorithm, price of anarchy |
55 | Arthur Choi, Trevor Standley, Adnan Darwiche |
Approximating Weighted Max-SAT Problems by Compensating for Relaxations. |
CP |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Josep Argelich, Chu Min Li, Felip Manyà |
A Preprocessor for Max-SAT Solvers. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
55 | Alexander S. Kulikov, Konstantin Kutzkov |
New Bounds for MAX-SAT by Clause Learning. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà |
A Complete Resolution Calculus for Signed Max-SAT. |
ISMVL |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Knot Pipatsrisawat, Adnan Darwiche |
Clone: Solving Weighted Max-SAT in a Reduced Search Space. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu |
The Power of Semidefinite Programming Relaxations for MAX-SAT. |
CPAIOR |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Maria Luisa Bonet, Jordi Levy, Felip Manyà |
A Complete Calculus for Max-SAT. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Mitsuo Motoki |
Random Instance Generation for MAX 3SAT. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
Sequential Encodings from Max-CSP into Partial Max-SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
50 | Hankui Zhuo, Qiang Yang 0001, Lei Li 0022 |
Constraint-Based Case-Based Planning Using Weighted MAX-SAT. |
ICCBR |
2009 |
DBLP DOI BibTeX RDF |
|
50 | Dalila Boughaci, Habiba Drias |
Efficient and Experimental Meta-heuristics for MAX-SAT Problems. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Mohamed El-bachir Menai |
A Two-Phase Backbone-Based Search Heuristic for Partial MAX-SAT - An Initial Investigation. |
IEA/AIE |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Daniele Pretolani |
Probability logic and optimization SAT: The PSAT and CPA models. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
CNF formulas, ideal matrices, probability, logic, directed graphs, propositional satisfiability |
48 | Stefan Szeider |
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Robert Nieuwenhuis, Albert Oliveras |
On SAT Modulo Theories and Optimization Problems. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Pedro C. Pinto, Thomas A. Runkler, João Miguel da Costa Sousa |
Ant Colony Optimization and its Application to Regular and Dynamic MAX-SAT Problems. |
Advances in Biologically Inspired Information Systems |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Pedro C. Pinto, Thomas A. Runkler, João Miguel da Costa Sousa |
Wasp Swarm Algorithm for Dynamic MAX-SAT Problems. |
ICANNGA (1) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Evgeny Dantsin, Alexander Wolpert |
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Mohamed El-bachir Menai, Mohamed Batouche |
A Backbone-Based Co-evolutionary Heuristic for Partial MAX-SAT. |
Artificial Evolution |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Maxim Sviridenko |
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Maxim Sviridenko |
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Takao Asano |
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
39 | Federico Heras |
New Research Lines for Max-SAT - Exploiting the Recent Resolution Rule for Max-Sat. |
ICAART (1) |
2010 |
DBLP BibTeX RDF |
|
39 | Souhila Sadeg, Habiba Drias, Hafid Aid, Samir Mazouz |
DNA based algorithms for solving both MAX-SAT and MAX-W-SAT problems. |
BIC-TA |
2010 |
DBLP DOI BibTeX RDF |
|
39 | Brian Borchers, Judith Furman |
A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. |
J. Comb. Optim. |
1998 |
DBLP DOI BibTeX RDF |
|
39 | Steve Joy, John E. Mitchell 0001, Brian Borchers |
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. |
Satisfiability Problem: Theory and Applications |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Mutsunori Yagiura, Toshihide Ibaraki |
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Enrico Giunchiglia, Marco Maratea |
optsat: A Tool for Solving SAT Related Optimization Problems. |
JELIA |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Sean Safarpour, Hratch Mangassarian, Andreas G. Veneris, Mark H. Liffiton, Karem A. Sakallah |
Improved Design Debugging Using Maximum Satisfiability. |
FMCAD |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Josep Argelich, Felip Manyà |
Solving Over-Constrained Problems with SAT Technology. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Takao Asano, Takao Ono, Tomio Hirata |
Approximation Algorithms for the Maximum Satisfiability Problem. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
34 | Luca Trevisan |
Positive Linear Programming, Parallel Approximation and PCP's. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Teresa Alsinet, Felip Manyà, Jordi Planes |
Improved Exact Solvers for Weighted Max-SAT. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Holger H. Hoos, Kevin Smyth, Thomas Stützle |
Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT. |
PPSN |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Habiba Drias, Sarah Ibri |
Parallel ACS for Weighted MAX-SAT. |
IWANN (1) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Berilhes Borges Garcia, Samuel M. Brasil Jr. |
Towards Default Reasoning through MAX-SAT. |
SBIA |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Andrea Roli, Christian Blum 0001 |
Critical Parallelization of Local Search for MAX-SAT. |
AI*IA |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Miquel Ramírez, Hector Geffner |
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT. |
CP |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Matthieu Py, Mohamed Sami Cherif, Djamal Habet |
Computing Max-SAT Refutations using SAT Oracles. |
ICTAI |
2021 |
DBLP DOI BibTeX RDF |
|
30 | Matthieu Py, Mohamed Sami Cherif, Djamal Habet |
Towards Bridging the Gap Between SAT and Max-SAT Refutations. |
ICTAI |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Sixue Liu, Gerard de Melo |
Should Algorithms for Random SAT and Max-SAT Be Different? |
AAAI |
2017 |
DBLP DOI BibTeX RDF |
|
30 | Noureddine Bouhmala |
Enhanced Walk-SAT with Finite Learning Automata For MAX-SAT. |
Int. J. Comb. Optim. Probl. Informatics |
2014 |
DBLP BibTeX RDF |
|
30 | Kenji Kanazawa, Tsutomu Maruyama |
FPGA acceleration of SAT/Max-SAT solving using variable-way cache. |
FPL |
2014 |
DBLP DOI BibTeX RDF |
|
30 | Alexander A. Kolokolov, Alexander Adelshin, Darya Yagofarova |
Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach. |
J. Math. Model. Algorithms Oper. Res. |
2013 |
DBLP DOI BibTeX RDF |
|
30 | Adrian Kügel |
Natural Max-SAT Encoding of Min-SAT. |
LION |
2012 |
DBLP DOI BibTeX RDF |
|
30 | Stefan Szeider |
The parameterized complexity of k-flip local search for SAT and MAX SAT. |
Discret. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
30 | Bruno Escoffier, Vangelis Th. Paschos |
Differential Approximation of min sat, max sat and Related Problems. |
ICCSA (4) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao |
Three Truth Values for the SAT and MAX-SAT Problems. |
IJCAI |
2005 |
DBLP BibTeX RDF |
|
30 | Dave A. D. Tompkins, Holger H. Hoos |
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
30 | Malek Mouhoub, Changhai Wang |
Stochastic Local Search for Incremental SAT and Incremental MAX-SAT. |
KES |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Patrick Mills, Edward P. K. Tsang |
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems. |
J. Autom. Reason. |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Ruiwen Chen, Rahul Santhanam |
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. |
Electron. Colloquium Comput. Complex. |
2015 |
DBLP BibTeX RDF |
|
28 | Ruiwen Chen, Rahul Santhanam |
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. |
SAT |
2015 |
DBLP DOI BibTeX RDF |
|
28 | André Abramé, Djamal Habet |
Local Max-Resolution in Branch and Bound Solvers for Max-SAT. |
ICTAI |
2014 |
DBLP DOI BibTeX RDF |
|
28 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
Regular Encodings from Max-CSP into Partial Max-SAT. |
ISMVL |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin |
Random MAX SAT, random MAX CUT, and their phase transitions. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin |
Random MAX SAT, random MAX CUT, and their phase transitions. |
SODA |
2003 |
DBLP BibTeX RDF |
|
27 | Johan Håstad |
Some optimal inapproximability results. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
NP-hard optimization problems, max-sat, linear equations, Inapproximability, probabilistically checkable proofs |
27 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat |
27 | Sanjeev Arora, Carsten Lund, Rajeev Motwani 0001, Madhu Sudan 0001, Mario Szegedy |
Proof Verification and Hardness of Approximation Problems |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
approximation problems, polynomial-time probabilistic oracle machine, random bits, MAXSNP-hard, metric TSP, time complexity, NP, MAX-CUT, MAX-SAT, proof verification |
26 | Rajeshwary Tayade, Jacob A. Abraham |
Critical Path Selection for Delay Test Considering Coupling Noise. |
ETS |
2008 |
DBLP DOI BibTeX RDF |
Coupling noise, weighted partial max sat, critical path selection, delay test |
25 | Lotfi Admane, Karima Benatchba, Mouloud Koudil, Habiba Drias, Said Gharout, Nacer Hamani |
Using ant colonies to solve data-mining problems. |
SMC (4) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra |
Low Communication 2-Prover Zero-Knowledge Proofs for NP. |
CRYPTO |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Mohamed Qasem, Adam Prügel-Bennett |
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering. |
EvoCOP |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende |
GRASP with path relinking for the weighted MAXSAT problem. |
ACM J. Exp. Algorithmics |
2006 |
DBLP DOI BibTeX RDF |
time-to-target plots, performance, Algorithms, heuristics, experimentation, GRASP, path relinking |
24 | Zhao Xing, Yixin Chen 0001, Weixiong Zhang |
An Efficient Hybrid Strategy for Temporal Planning. |
CPAIOR |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende |
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 294 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|