On the public citation graph
QMaxSAT: A Partial Max-SAT Solver
0 signed · 128 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.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/11814948_25openalex-snapshot
On Solving the Partial MAX-SAT Problem
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-45193-8_8openalex-snapshot
Efficient CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_35openalex-snapshot
Towards Robust CNF Encodings of Cardinality Constraints
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-642-02777-2_18openalex-snapshot
Cardinality Networks and Their Applications
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_39openalex-snapshot
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_45openalex-snapshot
Algorithms for Weighted Boolean Optimization
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_10openalex-snapshot
Pairwise Cardinality Networks
inferredcites →https://doi.org/10.1613/jair.2347openalex-snapshot
MiniMaxSAT: An Efficient Weighted Max-SAT solver
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-613openalex-snapshot
MaxSAT, Hard and Soft Constraints
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-695openalex-snapshot
Pseudo-Boolean and Cardinality Constraints
inferredcites →https://doi.org/10.3233/sat190014openalex-snapshot
Translating Pseudo-Boolean Constraints into SAT
inferredcites →https://doi.org/10.3233/sat190046openalex-snapshot
2006 and 2007 Max-SAT Evaluations: Contributed Instances
inferredcites →https://doi.org/10.3233/sat190047openalex-snapshot
The First and Second Max-SAT Evaluations
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-19212-9_3openalex-snapshot
Core-Boosted Linear Search for Incomplete MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_17openalex-snapshot
DRMaxSAT with MaxHS: First Contact
inferred← citeshttps://doi.org/10.1007/978-3-030-29908-8_49openalex-snapshot
Maximum Satisfiability Formulation for Optimal Scheduling in Overloaded Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_11openalex-snapshot
Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_20openalex-snapshot
Abstract Cores in Implicit Hitting Set MaxSat Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_36openalex-snapshot
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_6openalex-snapshot
Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_25openalex-snapshot
On Preprocessing for Weighted MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_33openalex-snapshot
QMaxSATpb: A Certified MaxSAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-031-60599-4_1openalex-snapshot
Core Boosting in SAT-Based Multi-objective Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-27242-3_16openalex-snapshot
Multi-objective Maximum Satisfiability by Single-Objective Implicit Hitting Set Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-36214-8_26openalex-snapshot
Parallel Local Search for MaxSAT with Solutions and Score Functions Co-evolving
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_2openalex-snapshot
Cores in Core Based MaxSat Algorithms: An Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_33openalex-snapshot
Open-WBO: A Modular MaxSAT Solver,
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_41openalex-snapshot
Core-Guided MaxSAT with Soft Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_63openalex-snapshot
Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_22openalex-snapshot
Incremental Encoding and Solving of Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-18008-3_5openalex-snapshot
MaxSAT-Based Scheduling of B2B Meetings
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_15openalex-snapshot
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_20openalex-snapshot
Exploiting Resolution-Based Representations for MaxSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_11openalex-snapshot
The Book Embedding Problem from a SAT-Solving Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-44748-3_24openalex-snapshot
Local Search for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_5openalex-snapshot
Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-56994-9_31openalex-snapshot
Solving MaxSAT by Successive Calls to a SAT Solver
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_29openalex-snapshot
Minimum-Width Confidence Bands via Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_11openalex-snapshot
On Tackling the Limits of Resolution in SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-69131-2_9openalex-snapshot
Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_3openalex-snapshot
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_15openalex-snapshot
Approximation Strategies for Incomplete MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_22openalex-snapshot
Improvements to Core-Guided Binary Search for MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_8openalex-snapshot
Conflict Directed Lazy Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_14openalex-snapshot
Community-Based Partitioning for MaxSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_32openalex-snapshot
SCSat: A Soft Constraint Guided SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_12openalex-snapshot
Improving WPM2 for (Weighted) Partial MaxSAT
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/s10601-013-9146-2openalex-snapshot
Iterative and core-guided MaxSAT solving: A survey and assessment
inferred← citeshttps://doi.org/10.1007/s10601-018-9295-4openalex-snapshot
Improved WPM encoding for coalition structure generation under MC-nets
inferred← citeshttps://doi.org/10.1007/s10601-018-9299-0openalex-snapshot
N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT
inferred← citeshttps://doi.org/10.1007/s10732-015-9300-7openalex-snapshot
Exploiting subproblem optimization in SAT-based MaxSAT algorithms
inferred← citeshttps://doi.org/10.1016/j.artint.2013.01.002openalex-snapshot
SAT-based MaxSAT algorithms
inferred← citeshttps://doi.org/10.1016/j.artint.2015.07.001openalex-snapshot
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2015.12.006openalex-snapshot
MaxSAT by improved instance-specific algorithm configuration
inferred← citeshttps://doi.org/10.1016/j.artint.2016.07.006openalex-snapshot
New local search methods for partial MaxSAT
inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.003openalex-snapshot
WPM3: An (in)complete algorithm for weighted partial MaxSAT
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103354openalex-snapshot
Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106836openalex-snapshot
Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107195openalex-snapshot
Solving weighted Maximum Satisfiability with Branch and Bound and clause learning
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100685openalex-snapshot
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100760openalex-snapshot
CHAMP: A multipass algorithm for Max Sat based on saver variables
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.07.009openalex-snapshot
A constraint optimization approach to causal discovery from subsampled time series data
inferred← citeshttps://doi.org/10.1080/0952813x.2014.993508openalex-snapshot
Improving linear search algorithms with model-based approaches for MaxSAT solving
inferred← citeshttps://doi.org/10.1080/17445760.2018.1499908openalex-snapshot
A MaxSAT based approach for QoS cloud services
inferred← citeshttps://doi.org/10.1093/comjnl/bxz063openalex-snapshot
NuDist: An Efficient Local Search Algorithm for (Weighted) Partial MaxSAT
inferred← citeshttps://doi.org/10.1109/ictai.2013.13openalex-snapshot
Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers
inferred← citeshttps://doi.org/10.1109/ictai.2013.51openalex-snapshot
Using MaxSAT to Correct Errors in AES Key Schedule Images
inferred← citeshttps://doi.org/10.1109/ictai.2015.120openalex-snapshot
Re-using Auxiliary Variables for MaxSAT Preprocessing
inferred← citeshttps://doi.org/10.1109/ictai.2016.0073openalex-snapshot
Non-Portfolio Approaches for Distributed Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/ictai.2017.00135openalex-snapshot
Mixed Radix Weight Totalizer Encoding for Pseudo-Boolean Constraints
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00053openalex-snapshot
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00031openalex-snapshot
Clausal Form Transformation in MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl57333.2023.00040openalex-snapshot
Linking Łukasiewicz Logic and Boolean Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/iwqos.2016.7590389openalex-snapshot
Practical fast scheduling and routing over slotted CSMA for wireless mesh networks
inferred← citeshttps://doi.org/10.1109/taai.2017.15openalex-snapshot
A Hybrid Encoding of Pseudo-Boolean Constraints into CNF
inferred← citeshttps://doi.org/10.1109/tc.2014.2346196openalex-snapshot
CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925889openalex-snapshot
Collision-Free Channel Assignment Is Possible in IEEE802.11-Based Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1142/s0218213015500050openalex-snapshot
Deterministic Parallel MaxSAT Solving
inferred← citeshttps://doi.org/10.1145/3127401openalex-snapshot
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
inferred← citeshttps://doi.org/10.1145/3200947.3201021openalex-snapshot
A Hybrid Evolutionary Algorithm for Maximizing Satisfiability in Temporal or Spatial Qualitative Constraints
inferred← citeshttps://doi.org/10.1145/3468264.3473928openalex-snapshot
Duplicated code pattern mining in visual programming languages
inferred← citeshttps://doi.org/10.1155/2021/9615463openalex-snapshot
Modeling and Solving Scheduling in Overloaded Situations with Weighted Partial MaxSAT
inferred← citeshttps://doi.org/10.1360/n112017-00248openalex-snapshot
Partial maximum satisfiability problem method combined with structure characteristics for diagnostic problems
inferred← citeshttps://doi.org/10.1587/transcom.2020ebp3128openalex-snapshot
Achieving Hidden-Terminal-Free Channel Assignment in IEEE802.11-Based Multi-Radio Multi-Channel Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9109openalex-snapshot
Tailoring Local Search for Partial MaxSAT
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9128openalex-snapshot
MaxSAT by Improved Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11346openalex-snapshot
Dispatch Guided Allocation Optimization for Effective Emergency Response
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011641openalex-snapshot
Low-Rank Semidefinite Programming for the MAX2SAT Problem
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25505openalex-snapshot
NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18546openalex-snapshot
A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18318openalex-snapshot
On Different Strategies for Eliminating Redundant Actions from Plans
inferred← citeshttps://doi.org/10.1613/jair.1.13818openalex-snapshot
Multi-Agent Path Finding: A New Boolean Encoding
inferred← citeshttps://doi.org/10.1613/jair.1.14296openalex-snapshot
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1613/jair.1.15986openalex-snapshot
Unifying SAT-Based Approaches to Maximum Satisfiability Solving
inferred← citeshttps://doi.org/10.2197/ipsjjip.27.117openalex-snapshot
A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay
inferred← citeshttps://doi.org/10.24963/ijcai.2017/90openalex-snapshot
A Core-Guided Approach to Learning Optimal Causal Graphs
inferred← citeshttps://doi.org/10.24963/ijcai.2018/723openalex-snapshot
Reduced Cost Fixing for Maximum Satisfiability
inferred← citeshttps://doi.org/10.24963/ijcai.2020/682openalex-snapshot
Reasoning About Inconsistent Formulas
inferred← citeshttps://doi.org/10.24963/ijcai.2021/643openalex-snapshot
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/kr.2021/72openalex-snapshot
Randomized Problem-Relaxation Solving for Over-Constrained Schedules
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-453openalex-snapshot
Progression in Maximum Satisfiability
inferred← citeshttps://doi.org/10.3233/978-1-61499-906-5-193openalex-snapshot
SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks
inferred← citeshttps://doi.org/10.3233/aic-180768openalex-snapshot
Resizing cardinality constraints for MaxSAT
inferred← citeshttps://doi.org/10.3233/aic-210178openalex-snapshot
Boosting branch-and-bound MaxSAT solvers with clause learning
inferred← citeshttps://doi.org/10.3233/sat190102openalex-snapshot
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
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.3233/sat190105openalex-snapshot
MSCG: Robust Core-Guided MaxSAT Solving
inferred← citeshttps://doi.org/10.3233/sat190118openalex-snapshot
Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT
inferred← citeshttps://doi.org/10.3233/sat190119openalex-snapshot
MaxSAT Evaluation 2018: New Developments and Detailed Results
inferred← citeshttps://doi.org/10.3390/fi11090201openalex-snapshot
Role-Mining Optimization with Separation-of-Duty Constraints and Security Detections for Authorizations
inferred← citeshttps://doi.org/10.34726/1842openalex-snapshot
Extension Enforcement under Grounded Semantics in Abstract Argumentation
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02408openalex-snapshot
DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02206openalex-snapshot
InterLock: An Intercorrelated Logic and Routing Locking
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94935openalex-snapshot
Solving hard industrial combinatorial problems with SAT
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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
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.