On the public citation graph

Chapter 23. MaxSAT, Hard and Soft Constraints

https://doi.org/10.3233/faia201007
0 signed · 29 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 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-031-08166-8_16openalex-snapshot
Inference in MaxSAT and MinSAT
inferred← citeshttps://doi.org/10.1007/978-3-031-20862-1_2openalex-snapshot
Robust Weighted Partial Maximum Satisfiability Problem: Challenge to $$\varSigma _{2}^{P}$$-Complete Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_10openalex-snapshot
Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_1openalex-snapshot
Certified Core-Guided MaxSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-40289-0_21openalex-snapshot
Heavy Weighting for Potential Important Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_21openalex-snapshot
The MaxSAT Problem in the Real-Valued MV-Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-57712-3_8openalex-snapshot
Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices Under Recombination
inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_24openalex-snapshot
Automatic Construction of HD Maps for Simulation-Based Testing of Autonomous Driving Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_3openalex-snapshot
A Local Search Algorithm for MaxSMT(LIA)
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_14openalex-snapshot
Maximum Satisfiability Formulations for Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-31390-4_6openalex-snapshot
Solving Branch Location Problem Using a Special Variant of VNS
inferred← citeshttps://doi.org/10.1007/978-3-032-39395-1_14openalex-snapshot
Efficient MaxSAT Encoding for Coalition Structure Generation in Partition Function Games via Transitivity Reduction
inferred← citeshttps://doi.org/10.1007/s11786-025-00603-7openalex-snapshot
A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00113openalex-snapshot
Efficient and Verifiable Proof Logging for MaxSAT Solving
inferred← citeshttps://doi.org/10.1109/eeiss69782.2026.11584620openalex-snapshot
A Novel Initial Assignment Strategy Based on Johnson's Algorithm for MaxSAT Problem
inferred← citeshttps://doi.org/10.1109/ictai62512.2024.00060openalex-snapshot
Optimizing Power Peaks in Simple Assembly Line Balancing Through Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/ictai66417.2025.00061openalex-snapshot
Integer Linear Programming Preprocessing for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/ismvl57333.2023.00040openalex-snapshot
Linking Łukasiewicz Logic and Boolean Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/ismvl57333.2023.00041openalex-snapshot
A Tableau Calculus for Signed Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/ismvl60454.2024.00035openalex-snapshot
A Tableau Calculus for Non-Clausal Regular MaxSAT
inferred← citeshttps://doi.org/10.1109/ismvl64713.2025.00016openalex-snapshot
A Complete Tableau Calculus for Signed MaxSAT
inferred← citeshttps://doi.org/10.1145/3563308openalex-snapshot
Synthesis-powered optimization of smart contracts via data type refactoring
inferred← citeshttps://doi.org/10.1145/3689765openalex-snapshot
Scaling Abstraction Refinement for Program Analyses in Datalog using Graph Neural Networks
inferred← citeshttps://doi.org/10.1287/ijoc.2023.0036openalex-snapshot
On Solving MAX-SAT Using Sum of Squares
inferred← citeshttps://doi.org/10.1360/ssi-2024-0163openalex-snapshot
Neuro-symbolic systems: a perspective of uncertainty management
inferred← citeshttps://doi.org/10.1527/tjsai.39-2_b-n64openalex-snapshot
MaxSAT Application for Vertical Transport Machine's Scheduling
inferred← citeshttps://doi.org/10.3724/sp.j.1089.2023.19482openalex-snapshot
Method for Optimal Redundant via Insertion with Maximum Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.2307.11607openalex-snapshot
Finding Optimal Diverse Feature Sets with Alternative Feature Selection
inferred← citeshttps://doi.org/10.7759/cureus.91800openalex-snapshot
Anesthesia Practice Shift Scheduling With a Generative Deep Learning Model
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.