On the public citation graph

Nested satisfiability

https://doi.org/10.1007/bf02983372
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 this work says

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

inferredcites →https://doi.org/10.1137/0211025openalex-snapshot
Planar Formulae and Their Uses

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033166.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11527695_20openalex-snapshot
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_128openalex-snapshot
The complexity of the falsifiability problem for pure implicational formulas
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_31openalex-snapshot
Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure?
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_31openalex-snapshot
Algorithms for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_29openalex-snapshot
Hypergraph Reductions and Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69912-5_11openalex-snapshot
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_22openalex-snapshot
A CNF Class Generalizing Exact Linear Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_11openalex-snapshot
On Some Aspects of Mixed Horn Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_15openalex-snapshot
Backdoors to Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_7openalex-snapshot
Strong Backdoors to Nested Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_28openalex-snapshot
Choice Is Hard
inferred← citeshttps://doi.org/10.1007/bf01209713openalex-snapshot
Satisfiability of co-nested formulas
inferred← citeshttps://doi.org/10.1007/s10472-004-9418-zopenalex-snapshot
On Exact Selection of Minimally Unsatisfiable Subformulae
inferred← citeshttps://doi.org/10.1007/s10472-004-9423-2openalex-snapshot
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
inferred← citeshttps://doi.org/10.1007/s10472-005-9000-3openalex-snapshot
New tractable classes for default reasoning from conditional knowledge bases
inferred← citeshttps://doi.org/10.1007/s10479-008-0502-3openalex-snapshot
Optimization and probabilistic satisfiability on nested and co-nested formulas
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100868openalex-snapshot
Backdoors to satisfaction continued
inferred← citeshttps://doi.org/10.1016/j.dam.2007.02.010openalex-snapshot
Satisfiability of mixed Horn formulas
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.011openalex-snapshot
Selecting and covering colored points
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00036-0openalex-snapshot
The complexity of the falsifiability problem for pure implicational formulas
inferred← citeshttps://doi.org/10.1109/focs.2013.59openalex-snapshot
Strong Backdoors to Bounded Treewidth SAT
inferred← citeshttps://doi.org/10.1145/276884.276917openalex-snapshot
Drawing planar partitions I
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-18openalex-snapshot
Planar 3-SAT with a Clause/Variable Cycle
inferred← citeshttps://doi.org/10.33039/ami.2021.03.009openalex-snapshot
Introducing w-Horn and z-Horn: A generalization of Horn and q-Horn formulae
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4483openalex-snapshot
From edge-disjoint paths to independent paths
inferred← citeshttps://doi.org/10.70675/22f799bfz3181z4324z8161zb5470bfc9e34openalex-snapshot
Extensions of tractable classes for propositional satisfiability
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.