On the public citation graph

Exotic Semi-Ring Constraints

https://doi.org/10.29007/qqvt
0 signed · 27 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/11814771_47openalex-snapshot
Matrix Interpretations for Proving Termination of Term Rewriting
inferredcites →https://doi.org/10.1007/11889205_42openalex-snapshot
Compiling Finite Linear CSP into SAT
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-45193-8_8openalex-snapshot
Efficient CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_33openalex-snapshot
SAT Solving for Termination Analysis with Polynomial Interpretations
inferredcites →https://doi.org/10.1007/978-3-642-01492-5_1openalex-snapshot
Semirings and Formal Power Series
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_24openalex-snapshot
Extending SAT Solvers to Cryptographic Problems
inferredcites →https://doi.org/10.1007/978-3-642-23786-7_47openalex-snapshot
Boolean Equi-propagation for Optimized SAT Encoding
inferredcites →https://doi.org/10.1007/bfb0017135openalex-snapshot
Recognizable sets with multiplicities in the tropical semiring
inferredcites →https://doi.org/10.1007/s10601-008-9061-0openalex-snapshot
Compiling finite linear CSP into SAT
inferredcites →https://doi.org/10.1007/s10817-007-9087-9openalex-snapshot
Matrix Interpretations for Proving Termination of Term Rewriting
inferredcites →https://doi.org/10.1016/j.jsc.2011.12.049openalex-snapshot
Tropical linear-fractional programming and parametric mean payoff games
inferredcites →https://doi.org/10.1017/cbo9780511662508.005openalex-snapshot
Some automata-theoretic aspects of min-max-plus semirings
inferredcites →https://doi.org/10.25596/jalc-2007-545openalex-snapshot
Weighted Automata for Proving Termination of String Rewriting
inferredcites →https://doi.org/10.48550/arxiv.1104.4617openalex-snapshot
Boolean Equi-propagation for Optimized SAT Encoding
inferredcites →https://doi.org/10.48550/arxiv.1208.1594openalex-snapshot
Certification extends Termination Techniques

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-29436-6_7openalex-snapshot
SPASS-SATT
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_12openalex-snapshot
Local Search for SMT on Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_28openalex-snapshot
Proving Functional Program Equivalence via Directed Lemma Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_10openalex-snapshot
SMT(LIA) Sampling with High Diversity
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_26openalex-snapshot
SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-42547-4_3openalex-snapshot
$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
inferred← citeshttps://doi.org/10.1109/synasc.2016.014openalex-snapshot
Symbolic Computation Techniques in Satisfiability Checking
inferred← citeshttps://doi.org/10.1145/2755996.2756636openalex-snapshot
Building Bridges between Symbolic Computation and Satisfiability Checking
inferred← citeshttps://doi.org/10.1145/3597495openalex-snapshot
Local Search For Satisfiability Modulo Integer Arithmetic Theories
inferred← citeshttps://doi.org/10.23638/lmcs-13(1:11)2017openalex-snapshot
Termination of Cycle Rewriting by Transformation and Matrix Interpretation
inferred← citeshttps://doi.org/10.4230/lipics.rta.2013.97openalex-snapshot
Compression of Rewriting Systems for Termination Analysis
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.