On the public citation graph

optsat: A Tool for Solving SAT Related Optimization Problems

0 signed · 16 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11527695_25openalex-snapshot
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition
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/s10817-006-9063-9openalex-snapshot
Some Computational Aspects of distance-sat
inferredcites →https://doi.org/10.1016/s0020-0190(98)00144-6openalex-snapshot
A linear-time transformation of linear inequalities into conjunctive normal form
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.3233/sat190018openalex-snapshot
The First Evaluation of Pseudo-Boolean Solvers (PB’05)

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-540-74782-6_37openalex-snapshot
SAT-Based Planning with Minimal-#actions Plans and “soft” Goals
inferred← citeshttps://doi.org/10.1007/s10472-025-09997-3openalex-snapshot
A MaxSAT-based framework for computing circumscription
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.1017/s1471068417000278openalex-snapshot
Model enumeration in propositional circumscription via unsatisfiable core analysis
inferred← citeshttps://doi.org/10.1109/icnp.2016.7784426openalex-snapshot
Rules in play: On the complexity of routing tables and firewalls
inferred← citeshttps://doi.org/10.1145/2542182.2542200openalex-snapshot
A SAT-based approach to cost-sensitive temporally expressive planning
inferred← citeshttps://doi.org/10.1145/3167132.3167230openalex-snapshot
A preference-based approach to backbone computation with application to argumentation
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7822openalex-snapshot
Core-Guided Binary Search Algorithms for Maximum Satisfiability
inferred← citeshttps://doi.org/10.3233/ia-240019openalex-snapshot
Design and implementation of modern CDCL ASP solvers
inferred← citeshttps://doi.org/10.4204/eptcs.84.1openalex-snapshot
Sparse Positional Strategies for Safety Games
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.