On the public citation graph
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
0 signed · 84 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.2000.1075openalex-snapshot
New Upper Bounds for Maximum Satisfiability
inferredcites →https://doi.org/10.1007/11499107_27openalex-snapshot
Improved Exact Solvers for Weighted Max-SAT
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_50openalex-snapshot
Efficient Strategies for (Weighted) Maximum Satisfiability
inferredcites →https://doi.org/10.1007/978-3-540-30498-2_34openalex-snapshot
A Max-SAT Solver with Lazy Data Structures
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_25openalex-snapshot
Solving Max-SAT as Weighted CSP
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1007/b102591openalex-snapshot
Advances in Artificial Intelligence – IBERAMIA 2004
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1007/bf00881805openalex-snapshot
Branching rules for satisfiability
inferredcites →https://doi.org/10.1007/bf01531077openalex-snapshot
Solving propositional satisfiability problems
inferredcites →https://doi.org/10.1007/bfb0017424openalex-snapshot
Principles and practice of constraint programming - CP 97 : Third International Conference, CP 97, Linz, Austria, October 29 - November 1, 1997 : proceedings
inferredcites →https://doi.org/10.1007/bfb0017450openalex-snapshot
Look-ahead versus look-back for satisfiability problems
inferredcites →https://doi.org/10.1016/s0012-365x(00)00199-0openalex-snapshot
Faster exact algorithms for hard problems: A parameterized point of view
inferredcites →https://doi.org/10.1016/s1571-0661(04)80663-7openalex-snapshot
Exact Algorithms for MAX-SAT
inferredcites →https://doi.org/10.1023/a:1009725216438openalex-snapshot
A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems
inferredcites →https://doi.org/10.1023/a:1021902812784openalex-snapshot
Current Approaches for Solving Over-Constrained Problems
inferredcites →https://doi.org/10.1090/dimacs/026/28openalex-snapshot
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11814948_18openalex-snapshot
On SAT Modulo Theories and Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_3openalex-snapshot
Core-Boosted Linear Search for Incomplete MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_16openalex-snapshot
Inference in MaxSAT and MinSAT
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_10openalex-snapshot
Efficient Application of Max-SAT Resolution on Inconsistent Subsets
inferred← citeshttps://doi.org/10.1007/978-3-319-39817-4_12openalex-snapshot
Breaking Cycle Structure to Improve Lower Bound for Max-SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_3openalex-snapshot
Parallel Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_42openalex-snapshot
Weight-Aware Core Extraction in SAT-Based MaxSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_7openalex-snapshot
Partial Max-SAT Solvers with Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_8openalex-snapshot
MiniMaxSat: A New Weighted Max-SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_18openalex-snapshot
On Inconsistent Clause-Subsets for Max-SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_1openalex-snapshot
Modelling Max-CSP as Partial Max-SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_13openalex-snapshot
A Max-SAT Inference-Based Pre-processing for Max-Clique
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_2openalex-snapshot
A Preprocessor for Max-SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_46openalex-snapshot
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_1openalex-snapshot
Symmetry Breaking for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_43openalex-snapshot
Exploiting Cycle Structures in Max-SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_35openalex-snapshot
Lower Bounds and Upper Bounds for MaxSAT
inferred← citeshttps://doi.org/10.1007/s10462-009-9136-3openalex-snapshot
Improving GASAT by replacing tabu search by DLM and enhancing the best members
inferred← citeshttps://doi.org/10.1007/s10601-010-9097-9openalex-snapshot
Resolution-based lower bounds in MaxSAT
inferred← citeshttps://doi.org/10.1007/s10601-013-9146-2openalex-snapshot
Iterative and core-guided MaxSAT solving: A survey and assessment
inferred← citeshttps://doi.org/10.1007/s10732-006-7234-9openalex-snapshot
Exact Max-SAT solvers for over-constrained problems
inferred← citeshttps://doi.org/10.1007/s11390-013-1325-5openalex-snapshot
A Taxonomy of Exact Methods for Partial Max-SAT
inferred← citeshttps://doi.org/10.1007/s44196-022-00120-6openalex-snapshot
Negative Learning Ant Colony Optimization for MaxSAT
inferred← citeshttps://doi.org/10.1016/j.artint.2007.05.006openalex-snapshot
A logical approach to efficient Max-SAT solving
inferred← citeshttps://doi.org/10.1016/j.artint.2010.02.001openalex-snapshot
Soft arc consistency revisited
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.004openalex-snapshot
Optimizing with minimum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103397openalex-snapshot
Understanding the power of Max-SAT resolution through UP-resilience
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.01.005openalex-snapshot
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
inferred← citeshttps://doi.org/10.1109/ictai.2010.57openalex-snapshot
Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1109/ictai.2014.58openalex-snapshot
Local Max-Resolution in Branch and Bound Solvers for Max-SAT
inferred← citeshttps://doi.org/10.1109/ictai.2016.0075openalex-snapshot
Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers
inferred← citeshttps://doi.org/10.1109/ismvl.2006.43openalex-snapshot
Towards Solving Many-Valued MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl.2007.2openalex-snapshot
A Complete Resolution Calculus for Signed Max-SAT
inferred← citeshttps://doi.org/10.1109/ismvl.2008.22openalex-snapshot
Encoding Max-CSP into Partial Max-SAT
inferred← citeshttps://doi.org/10.1109/ismvl.2017.42openalex-snapshot
Exploiting Many-Valued Variables in MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl52857.2022.00012openalex-snapshot
Quantum Algorithm for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/rivf.2006.1696426openalex-snapshot
Modeling and optimization of the capacity allocation problem with constraints
inferred← citeshttps://doi.org/10.12785/amis/080109openalex-snapshot
A Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems
inferred← citeshttps://doi.org/10.13039/501100003176openalex-snapshot
Finding safe policies in model-based active learning
inferred← citeshttps://doi.org/10.1504/ijor.2013.054970openalex-snapshot
A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1515/jisys-2016-0129openalex-snapshot
MAX-SAT Problem using Hybrid Harmony Search Algorithm
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7536openalex-snapshot
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18313openalex-snapshot
Handling All Unit Propagation Reasons in Exact Max-SAT Solvers
inferred← citeshttps://doi.org/10.1613/jair.1.15986openalex-snapshot
Unifying SAT-Based Approaches to Maximum Satisfiability Solving
inferred← citeshttps://doi.org/10.1613/jair.2347openalex-snapshot
MiniMaxSAT: An Efficient Weighted Max-SAT solver
inferred← citeshttps://doi.org/10.1613/jair.4953openalex-snapshot
An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.24963/ijcai.2022/739openalex-snapshot
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)
inferred← citeshttps://doi.org/10.29007/38lmopenalex-snapshot
Improved Exact Solver for the Weighted MAX-SAT Problem
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-303openalex-snapshot
Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning
inferred← citeshttps://doi.org/10.3233/978-1-61499-421-3-1openalex-snapshot
On the Extension of Learning for Max-SAT
inferred← citeshttps://doi.org/10.3233/aic-210178openalex-snapshot
Boosting branch-and-bound MaxSAT solvers with clause learning
inferred← citeshttps://doi.org/10.3233/faia200112openalex-snapshot
Preprocessing in Incomplete MaxSAT Solving
inferred← citeshttps://doi.org/10.3233/sat190044openalex-snapshot
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis1
inferred← citeshttps://doi.org/10.3233/sat190047openalex-snapshot
The First and Second Max-SAT Evaluations
inferred← citeshttps://doi.org/10.3233/sat190080openalex-snapshot
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
inferred← citeshttps://doi.org/10.3233/sat190104openalex-snapshot
ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
inferred← citeshttps://doi.org/10.3390/e24111615openalex-snapshot
Quantum Algorithm for Variant Maximum Satisfiability
inferred← citeshttps://doi.org/10.4304/jait.3.2.138-146openalex-snapshot
A Clonal Selection Algorithm Based Tabu Search for Satisfiability Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1508.06096openalex-snapshot
Unsatisfiable Cores and Lower Bounding for Constraint Programming
inferred← citeshttps://doi.org/10.70675/90961a35z8128z45eaz9859z1d246d7621d4openalex-snapshot
Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
inferred← citeshttps://doi.org/10.7282/t32n52pzopenalex-snapshot
Optimization in logical analysis of data
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.