On the public citation graph
The First and Second Max-SAT Evaluations
0 signed · 70 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_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/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_18openalex-snapshot
On Inconsistent Clause-Subsets for Max-SAT Solving
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/bfb0017450openalex-snapshot
Look-ahead versus look-back for satisfiability problems
inferredcites →https://doi.org/10.1007/s10898-007-9166-9openalex-snapshot
An efficient solver for weighted Max-SAT
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.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1613/jair.2347openalex-snapshot
MiniMaxSAT: An Efficient Weighted Max-SAT solver
inferredcites →https://doi.org/10.3233/sat190044openalex-snapshot
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis1
inferredcites →https://doi.org/10.3233/sat190046openalex-snapshot
2006 and 2007 Max-SAT Evaluations: Contributed Instances
inferredcites →https://doi.org/10.5281/zenodo.4776212openalex-snapshot
Pseudo Boolean Evaluation 2015
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-1-4419-7518-8_10openalex-snapshot
Algorithms for Maximum Satisfiability Using Unsatisfiable Cores
inferred← citeshttps://doi.org/10.1007/978-3-030-75775-5_25openalex-snapshot
An Abstract View on Optimizations in SAT and ASP
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_41openalex-snapshot
Core-Guided MaxSAT with Soft Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-19644-2_15openalex-snapshot
Cryptanalysis of Simplified-AES Using Intelligent Agent
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-71679-4_11openalex-snapshot
A MaxSAT-Based Approach to the Team Composition Problem in a Classroom
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_4openalex-snapshot
Solving MaxSAT with Bit-Vector Optimization
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-642-02777-2_39openalex-snapshot
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-04428-1_22openalex-snapshot
Aggregating Interval Orders by Propositional Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_19openalex-snapshot
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15246-7_23openalex-snapshot
Partial Weighted MaxSAT for Optimal Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_29openalex-snapshot
Analyzing the Instances of the MaxSAT Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_19openalex-snapshot
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-23954-0_41openalex-snapshot
Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_34openalex-snapshot
A New Encoding from MinSAT into MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_13openalex-snapshot
MinSAT versus MaxSAT for Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10472-016-9502-1openalex-snapshot
On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
inferred← citeshttps://doi.org/10.1007/s10601-010-9097-9openalex-snapshot
Resolution-based lower bounds in MaxSAT
inferred← citeshttps://doi.org/10.1007/s10601-012-9130-2openalex-snapshot
Reformulation based MaxSAT robustness
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.1016/j.artint.2012.05.004openalex-snapshot
Optimizing with minimum satisfiability
inferred← citeshttps://doi.org/10.1093/jigpal/jzz025openalex-snapshot
Clause tableaux for maximum and minimum satisfiability
inferred← citeshttps://doi.org/10.1093/jigpal/jzz028openalex-snapshot
A resolution calculus for MinSAT
inferred← citeshttps://doi.org/10.1103/physrevb.94.134424openalex-snapshot
Finding and proving the exact ground state of a generalized Ising model by convex optimization and MAX-SAT
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.2015.73openalex-snapshot
A Practical Approach for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks
inferred← citeshttps://doi.org/10.1109/iiai-aai.2019.00241openalex-snapshot
Massive Parallel Max-SAT Solver Based on Speculative Computation
inferred← citeshttps://doi.org/10.1109/ismvl.2009.23openalex-snapshot
Regular Encodings from Max-CSP into Partial Max-SAT
inferred← citeshttps://doi.org/10.1109/ismvl.2009.58openalex-snapshot
Generating Hard Instances for MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl.2010.17openalex-snapshot
New Insights into Encodings from MaxCSP into Partial MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00031openalex-snapshot
Clausal Form Transformation in MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl49045.2020.00007openalex-snapshot
Tableaux for Maximum Satisfiability in Łukasiewicz Logic
inferred← citeshttps://doi.org/10.1109/ismvl57333.2023.00040openalex-snapshot
Linking Łukasiewicz Logic and Boolean Maximum Satisfiability
inferred← citeshttps://doi.org/10.1145/1403375.1403474openalex-snapshot
Algorithms for maximum satisfiability using unsatisfiable cores
inferred← citeshttps://doi.org/10.1145/1836089.1836098openalex-snapshot
A declarative approach to robust weighted Max-SAT
inferred← citeshttps://doi.org/10.1145/3127401openalex-snapshot
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
inferred← citeshttps://doi.org/10.13140/rg.2.2.18644.30082openalex-snapshot
Fractality and Coherent Structures in Satisfiability Problems
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7545openalex-snapshot
A New Algorithm for Weighted Partial MaxSAT
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-453openalex-snapshot
Progression in Maximum Satisfiability
inferred← citeshttps://doi.org/10.3233/aic-2010-0488openalex-snapshot
Max-SAT formalisms with hard and soft constraints
inferred← citeshttps://doi.org/10.3233/aic-2012-0527openalex-snapshot
Solving disjunctive temporal problems with preferences using maximum satisfiability
inferred← citeshttps://doi.org/10.3233/sat190046openalex-snapshot
2006 and 2007 Max-SAT Evaluations: Contributed Instances
inferred← citeshttps://doi.org/10.3233/sat190065openalex-snapshot
Terse Integer Linear Programs for Boolean Optimization
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/sat190119openalex-snapshot
MaxSAT Evaluation 2018: New Developments and Detailed Results
inferred← citeshttps://doi.org/10.5220/0005092503270332openalex-snapshot
Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View
inferred← citeshttps://doi.org/10.70675/2228deb4z405fz47f1zbb57z9e9fa6e644d1openalex-snapshot
Practical resolution of satisfiability testing for modal logics
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.