On the public citation graph

Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis1

https://doi.org/10.3233/sat190044

0 signed · 56 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564751_31openalex-snapshot

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

inferredcites →https://doi.org/10.1007/11814948_25openalex-snapshot

On Solving the Partial MAX-SAT Problem

inferredcites →https://doi.org/10.1007/3-540-16486-3_100openalex-snapshot

The complexity of optimization problems

inferredcites →https://doi.org/10.1007/3-540-45657-0_19openalex-snapshot

Applying SAT Methods in Unbounded Symbolic Model Checking

inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot

An Extensible SAT-solver

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-72788-0_7openalex-snapshot

Partial Max-SAT Solvers with Clause Learning

inferredcites →https://doi.org/10.1007/978-3-540-72788-0_8openalex-snapshot

MiniMaxSat: A New Weighted Max-SAT Solver

inferredcites →https://doi.org/10.1007/978-3-540-74970-7_43openalex-snapshot

Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT

inferredcites →https://doi.org/10.1007/978-3-540-76928-6_24openalex-snapshot

Clone: Solving Weighted Max-SAT in a Reduced Search Space

inferredcites →https://doi.org/10.1007/978-3-540-79719-7_2openalex-snapshot

A Preprocessor for Max-SAT Solvers

inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot

Computational Complexity

inferredcites →https://doi.org/10.1007/s10732-006-7234-9openalex-snapshot

Exact Max-SAT solvers for over-constrained problems

inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot

Consistency in networks of relations

inferredcites →https://doi.org/10.1016/0004-3702(77)90029-7openalex-snapshot

Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis

inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot

Graph minors. II. Algorithmic aspects of tree-width

inferredcites →https://doi.org/10.1016/0888-613x(90)90003-kopenalex-snapshot

Probabilistic inference in multiply connected belief networks using loop cutsets

inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot

A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS

inferredcites →https://doi.org/10.1016/c2013-0-12434-8openalex-snapshot

Graph Theory and Computing

inferredcites →https://doi.org/10.1016/j.artint.2004.04.005openalex-snapshot

Compiling propositional weighted bases

inferredcites →https://doi.org/10.1016/j.artint.2007.05.006openalex-snapshot

A logical approach to efficient Max-SAT solving

inferredcites →https://doi.org/10.1016/j.engappai.2004.08.021openalex-snapshot

Constraint processing

inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot

GRASP: a search algorithm for propositional satisfiability

inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot

Chaff: engineering an efficient SAT solver

inferredcites →https://doi.org/10.1109/iccad.2001.968634openalex-snapshot

Efficient conflict driven learning in a Boolean satisfiability solver

inferredcites →https://doi.org/10.1109/icsmc.1995.538456openalex-snapshot

A branching heuristic for testing propositional satisfiability

inferredcites →https://doi.org/10.1145/12130.12138openalex-snapshot

The complexity of optimization problems

inferredcites →https://doi.org/10.1145/240518.240555openalex-snapshot

On solving covering problems

inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot

Chaff

inferredcites →https://doi.org/10.1145/502090.502091openalex-snapshot

Decomposable negation normal form

inferredcites →https://doi.org/10.1613/jair.2215openalex-snapshot

New Inference Rules for Max-SAT

inferredcites →https://doi.org/10.48550/arxiv.1206.5251openalex-snapshot

Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks

inferredcites →https://doi.org/10.5555/777092.777197openalex-snapshot

Using weighted MAX-SAT engines to solve MPE

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-64583-0_60openalex-snapshot

Unit Propagation by Means of Coordinate-Wise Minimization

inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_45openalex-snapshot

Algorithms for Weighted Boolean Optimization

inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_19openalex-snapshot

Approximating Weighted Max-SAT Problems by Compensating for Relaxations

inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_8openalex-snapshot

Satisfiability Modulo the Theory of Costs: Foundations and Applications

inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_16openalex-snapshot

Improving Unsatisfiability-Based Algorithms for Boolean Optimization

inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_2openalex-snapshot

Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference

inferred← citeshttps://doi.org/10.1007/s10462-020-09908-4openalex-snapshot

Stochastic local search for Partial Max-SAT: an experimental evaluation

inferred← citeshttps://doi.org/10.1007/s10472-011-9233-2openalex-snapshot

Boolean lexicographic optimization: algorithms & applications

inferred← citeshttps://doi.org/10.1007/s10479-012-1081-xopenalex-snapshot

Curriculum-based course timetabling with SAT and MaxSAT

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/s11390-013-1325-5openalex-snapshot

A Taxonomy of Exact Methods for Partial Max-SAT

inferred← citeshttps://doi.org/10.1007/s11590-012-0461-0openalex-snapshot

Incomplete inference for graph problems

inferred← citeshttps://doi.org/10.1093/bioinformatics/btq215openalex-snapshot

Optimal algorithms for haplotype assembly from whole-genome sequence data

inferred← citeshttps://doi.org/10.1109/ismvl.2009.58openalex-snapshot

Generating Hard Instances for MaxSAT

inferred← citeshttps://doi.org/10.1142/s0218488520500348openalex-snapshot

MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation

inferred← citeshttps://doi.org/10.1145/2908961.2931644openalex-snapshot

Schemata Bandits for MAXSAT

inferred← citeshttps://doi.org/10.17576/jsm-2018-4706-30openalex-snapshot

Discrete Hopfield Neural Network in Restricted Maximum k-Satisfiability Logic Programming

inferred← citeshttps://doi.org/10.3233/sat190047openalex-snapshot

The First and Second Max-SAT Evaluations

inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-103openalex-snapshot

Read-once resolution for unsatisfiability-based Max-SAT algorithms

inferred← citeshttps://doi.org/10.5821/dissertation-2117-95760openalex-snapshot

Automatic program analysis using Max-SMT

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.9781/ijimai.2016.429openalex-snapshot

Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network

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.