On the public citation graph
Optimal Implementation of Watched Literals and More General Techniques
0 signed · 36 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_39openalex-snapshot
Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
inferredcites →https://doi.org/10.1007/11889205_15openalex-snapshot
Watched Literals for Constraint Propagation in Minion
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-74970-7_62openalex-snapshot
A Case for Simple SAT Solvers
inferredcites →https://doi.org/10.1007/s10472-004-9425-0openalex-snapshot
Efficient Data Structures for Backtrack Search SAT Solvers
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0004-3702(86)90035-4openalex-snapshot
Depth-first iterative-deepening: An optimal admissible tree search
inferredcites →https://doi.org/10.1016/j.artint.2005.02.004openalex-snapshot
An optimal coarse-grained arc consistency algorithm
inferredcites →https://doi.org/10.1016/j.artint.2010.07.001openalex-snapshot
Implementing logical connectives in constraint programming
inferredcites →https://doi.org/10.1016/s0898-1221(96)90087-5openalex-snapshot
Empirical methods for artificial intelligence
inferredcites →https://doi.org/10.1023/a:1006351428454openalex-snapshot
Implementing the Davis–Putnam Method
inferredcites →https://doi.org/10.1023/b:aire.0000036261.28708.7fopenalex-snapshot
Saving Support-Checks Does Not Always Save Time
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.1111/j.1467-8640.1993.tb00310.xopenalex-snapshot
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
inferredcites →https://doi.org/10.1145/1963190.2019581openalex-snapshot
Limited discrepancy search revisited
inferredcites →https://doi.org/10.1145/775832.776041openalex-snapshot
A fast pseudo-boolean constraint solver
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-131openalex-snapshot
Conflict-Driven Clause Learning SAT Solvers
inferredcites →https://doi.org/10.3233/sat190013openalex-snapshot
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations
inferredcites →https://doi.org/10.5860/choice.33-5144openalex-snapshot
Empirical methods for artificial intelligence
inferredcites →https://doi.org/10.7916/d8hq46x1openalex-snapshot
Depth-First Iterative Deepening: An Optimal Admissible Tree Search
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-20652-9_10openalex-snapshot
Optimizing a Verified SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_11openalex-snapshot
Speeding Up Assumption-Based SAT
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_4openalex-snapshot
Trail Saving on Backtrack
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_24openalex-snapshot
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
inferred← citeshttps://doi.org/10.1007/s00146-020-01026-7openalex-snapshot
Artificial intelligence, culture and education
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.002openalex-snapshot
STR3: A path-optimal filtering algorithm for table constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104470openalex-snapshot
Using execution logs for improving Pseudo-Boolean propagation
inferred← citeshttps://doi.org/10.1016/j.micpro.2025.105199openalex-snapshot
Polynomial formal verification parameterized by cutwidth properties of a circuit using Boolean satisfiability
inferred← citeshttps://doi.org/10.1108/fs-05-2021-0104openalex-snapshot
New forms of intellectual activity in globalized society
inferred← citeshttps://doi.org/10.1515/sem-2015-0034openalex-snapshot
Non-anthropogenic mind and complexes of cultural codes
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04365openalex-snapshot
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
inferred← citeshttps://doi.org/10.70675/03e04021z39fcz4f3bz9d7fza5cd0b4d1b2aopenalex-snapshot
On the use of tasks ordering to solve scheduling problems with constraint programming
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
inferred← citeshttps://doi.org/10.70675/d6cf375fz03f4z432ezb038z4ed4d48b08d3openalex-snapshot
Search, propagation, and learning in sequencing and scheduling problems
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.