On the public citation graph
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
0 signed · 117 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/11499107_38openalex-snapshot
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/978-1-4613-1315-1openalex-snapshot
Logic-Based 0–1 Constraint Programming
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-642-81952-0_16openalex-snapshot
A Machine Program for Theorem Proving
inferredcites →https://doi.org/10.1007/bf02186368openalex-snapshot
Generalized resolution and cutting planes
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/0004-3702(90)90046-3openalex-snapshot
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
inferredcites →https://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1057/jors.1996.181openalex-snapshot
Logic-Based 0-1 Constraint Programming
inferredcites →https://doi.org/10.1090/s0002-9904-1958-10224-4openalex-snapshot
Outline of an algorithm for integer solutions to linear programs
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/dac.2003.1219134openalex-snapshot
A fast pseudo-Boolean constraint solver
inferredcites →https://doi.org/10.1109/date.2005.126openalex-snapshot
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
inferredcites →https://doi.org/10.1109/date.2005.246openalex-snapshot
Pueblo: A Modern Pseudo-Boolean SAT Solver
inferredcites →https://doi.org/10.1109/iccad.2002.1167571openalex-snapshot
Generic ILP versus specialized 0-1 ILP: an update
inferredcites →https://doi.org/10.1109/tai.1996.560473openalex-snapshot
Computing prime implicants by integer programming
inferredcites →https://doi.org/10.1109/tcad.2004.842808openalex-snapshot
A fast pseudo-Boolean constraint solver
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1142/s0218213094000108openalex-snapshot
NOGOOD RECORDING FOR STATIC AND DYNAMIC CONSTRAINT SATISFACTION PROBLEMS
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/774572.774638openalex-snapshot
Generic ILP versus specialized 0-1 ILP
inferredcites →https://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferredcites →https://doi.org/10.1613/jair.1353openalex-snapshot
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
inferredcites →https://doi.org/10.3233/sat190014openalex-snapshot
Translating Pseudo-Boolean Constraints into SAT
inferredcites →https://doi.org/10.3233/sat190018openalex-snapshot
The First Evaluation of Pseudo-Boolean Solvers (PB’05)
inferredcites →https://doi.org/10.48550/arxiv.cs/0509032openalex-snapshot
A Simple Model to Generate Hard Satisfiable Instances
inferredcites →https://doi.org/10.5555/777092.777190openalex-snapshot
Inference methods for a pseudo-boolean satisfiability solver
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/11864127_7openalex-snapshot
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_23openalex-snapshot
On Weakening Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_10openalex-snapshot
Watched Propagation of $$0$$-$$1$$ Integer Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_22openalex-snapshot
On Dedicated CDCL Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-031-60597-0_20openalex-snapshot
Certifying MIP-Based Presolve Reductions for $$0$$–$$1$$ Integer Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_30openalex-snapshot
CNFgen: A Generator of Crafted Benchmarks
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_18openalex-snapshot
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_5openalex-snapshot
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_33openalex-snapshot
SAT Solving for Termination Analysis with Polynomial Interpretations
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-74960-8_2openalex-snapshot
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes
inferred← citeshttps://doi.org/10.1007/978-3-540-88737-9_6openalex-snapshot
Lexicographical Inference over Inconsistent DL-Based Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_40openalex-snapshot
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
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-02846-5_23openalex-snapshot
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_28openalex-snapshot
Translating Pseudo-Boolean Constraints into CNF
inferred← citeshttps://doi.org/10.1007/978-3-642-33158-9_6openalex-snapshot
Reasoning with Uncertain and Inconsistent OWL Ontologies
inferred← citeshttps://doi.org/10.1007/s10115-012-0478-9openalex-snapshot
Weight-based consistent query answering over inconsistent $${\mathcal {SHIQ}}$$ knowledge bases
inferred← citeshttps://doi.org/10.1007/s10462-018-9628-0openalex-snapshot
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
inferred← citeshttps://doi.org/10.1007/s10479-009-0675-4openalex-snapshot
Haplotype inference with pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1007/s10601-007-9029-5openalex-snapshot
Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques
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-020-09318-xopenalex-snapshot
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
inferred← citeshttps://doi.org/10.1007/s10617-012-9102-1openalex-snapshot
Symbolic system-level design methodology for multi-mode reconfigurable systems
inferred← citeshttps://doi.org/10.1007/s10732-018-9400-2openalex-snapshot
Virtual machine consolidation using constraint-based multi-objective optimization
inferred← citeshttps://doi.org/10.1007/s11704-024-3631-1openalex-snapshot
PBCounter: weighted model counting on pseudo-boolean formulas
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.2021.103559openalex-snapshot
Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
inferred← citeshttps://doi.org/10.1016/j.dss.2012.12.029openalex-snapshot
An integrative framework for intelligent software project risk planning
inferred← citeshttps://doi.org/10.1016/j.egypro.2012.01.153openalex-snapshot
A New Hybrid Algorithm for FPGA Routing
inferred← citeshttps://doi.org/10.1089/cmb.2007.a001openalex-snapshot
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates
inferred← citeshttps://doi.org/10.1109/access.2018.2885120openalex-snapshot
State-of-the-Art Clustering Schemes in Mobile Ad Hoc Networks: Objectives, Challenges, and Future Directions
inferred← citeshttps://doi.org/10.1109/afrcon.2013.6757599openalex-snapshot
A SAT-based approach to solve the faculty course scheduling problem
inferred← citeshttps://doi.org/10.1109/date.2007.364519openalex-snapshot
Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/date.2011.5763207openalex-snapshot
As-Robust-As-Possible test generation in the presence of small delay defects using pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1109/dsd.2017.74openalex-snapshot
SAT-Based Generation of Optimum Function Implementations with XOR Gates
inferred← citeshttps://doi.org/10.1109/icfn.2009.16openalex-snapshot
Solution and Optimization of FPGA Routing Algorithm
inferred← citeshttps://doi.org/10.1109/icist.2011.5765208openalex-snapshot
Optimization of pseudo-boolean satisfiability algorithm for FPGA routing
inferred← citeshttps://doi.org/10.1109/icse.2007.59openalex-snapshot
OPIUM: Optimal Package Install/Uninstall Manager
inferred← citeshttps://doi.org/10.1109/isspa.2012.6310628openalex-snapshot
Solving the Clustering Problem in MANETs using SAT & ILP techniques
inferred← citeshttps://doi.org/10.1109/iwcmc.2012.6314357openalex-snapshot
Using SAT & ILP techniques to solve enhanced ILP formulations of the Clustering Problem in MANETS
inferred← citeshttps://doi.org/10.1109/jsen.2013.2254234openalex-snapshot
Optimizing Complex Cluster Formation in MANETs Using SAT/ILP Techniques
inferred← citeshttps://doi.org/10.1109/rsp.2009.21openalex-snapshot
WoLFram- A Word Level Framework for Formal Verification
inferred← citeshttps://doi.org/10.1109/sere.2014.25openalex-snapshot
Automatic Test Data Generation for Unit Testing to Achieve MC/DC Criterion
inferred← citeshttps://doi.org/10.1109/tcad.2010.2061631openalex-snapshot
A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem
inferred← citeshttps://doi.org/10.1109/tcad.2011.2169259openalex-snapshot
Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/tse.2026.3696093openalex-snapshot
Tackling Expressive Feature-Modeling Constructs With Pseudo-Boolean d-DNNF Compilation
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2011048openalex-snapshot
DFT and Minimum Leakage Pattern Generation for Static Power Reduction During Test and Burn-In
inferred← citeshttps://doi.org/10.1109/uemcos46508.2019.9221548openalex-snapshot
A PB-SAT based methodology to solve Personnel shift Scheduling problem
inferred← citeshttps://doi.org/10.1142/s0218213015500050openalex-snapshot
Deterministic Parallel MaxSAT Solving
inferred← citeshttps://doi.org/10.1145/1367497.1367574openalex-snapshot
Computing minimum cost diagnoses to repair populated DL-based ontologies
inferred← citeshttps://doi.org/10.1145/2815493.2815497openalex-snapshot
On the interplay between proof complexity and SAT solving
inferred← citeshttps://doi.org/10.11575/prism/24928openalex-snapshot
A Novel Approach to White-Box Policy Analysis
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0999openalex-snapshot
Cut-Based Conflict Analysis in Mixed Integer Programming
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5508openalex-snapshot
A Cardinal Improvement to Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5515openalex-snapshot
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16492openalex-snapshot
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16502openalex-snapshot
On Continuous Local BDD-Based Search for Hybrid SAT Solving
inferred← citeshttps://doi.org/10.1613/jair.2347openalex-snapshot
MiniMaxSAT: An Efficient Weighted Max-SAT solver
inferred← citeshttps://doi.org/10.2168/lmcs-7(1:10)2011openalex-snapshot
Equality Saturation: A New Approach to Optimization
inferred← citeshttps://doi.org/10.24963/ijcai.2018/180openalex-snapshot
Divide and Conquer: Towards Faster Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.24963/ijcai.2018/261openalex-snapshot
Pseudo-Boolean Constraints from a Knowledge Representation Perspective
inferred← citeshttps://doi.org/10.24963/ijcai.2019/237openalex-snapshot
On Division Versus Saturation in Pseudo-Boolean Solving
inferred← citeshttps://doi.org/10.3233/fi-2010-311openalex-snapshot
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
inferred← citeshttps://doi.org/10.3233/sat190014openalex-snapshot
Translating Pseudo-Boolean Constraints into SAT
inferred← citeshttps://doi.org/10.3233/sat190018openalex-snapshot
The First Evaluation of Pseudo-Boolean Solvers (PB’05)
inferred← citeshttps://doi.org/10.3233/sat190023openalex-snapshot
On Using Cutting Planes in Pseudo-Boolean Optimization
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.4016/6986.01openalex-snapshot
A Pseudo-Boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.423-426.2667openalex-snapshot
A New Routing Method Based on Hybrid Algorithm
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.490-495.1511openalex-snapshot
The Improvement of Pseudo-Boolean Satisfiability Algorithm for FPGA Routing
inferred← citeshttps://doi.org/10.4204/eptcs.29.3openalex-snapshot
Comparison of PBO solvers in a dependency solving domain
inferred← citeshttps://doi.org/10.4304/jcp.8.4.851-858openalex-snapshot
Solving the Employee Timetabling Problem Using Advanced SAT & ILP Techniques
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1479openalex-snapshot
A Family of Encodings for Translating Pseudo-Boolean Constraints into SAT
inferred← citeshttps://doi.org/10.48550/arxiv.1109.2752openalex-snapshot
On Validating Boolean Optimizers
inferred← citeshttps://doi.org/10.5539/mas.v9n4p67openalex-snapshot
Data Storage Control System Design
inferred← citeshttps://doi.org/10.5555/1266366.1266703openalex-snapshot
Maximum circuit activity estimation using pseudo-boolean satisfiability
inferred← citeshttps://doi.org/10.5555/2157654.2157664openalex-snapshot
Pseudo-Boolean Solving by incremental translation to SAT
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
inferred← citeshttps://doi.org/10.70675/41a21d4bz191ez4409za183z754a7064aeafopenalex-snapshot
Raisonnement à partir de contraintes pseudo-booléennes et compilation
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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.