On the public citation graph
Quantified Equality Constraints
0 signed · 30 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/s00012-008-2122-9openalex-snapshot
Existence theorems for weakly symmetric operations
inferredcites →https://doi.org/10.1007/s00224-007-9083-9openalex-snapshot
The Complexity of Equality Constraint Languages
inferredcites →https://doi.org/10.1016/s0304-3975(97)00230-2openalex-snapshot
On the algebraic structure of combinatorial problems
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170812-4openalex-snapshot
Reduced Products and Horn Classes
inferredcites →https://doi.org/10.1093/logcom/exi083openalex-snapshot
Constraint Satisfaction with Countable Homogeneous Templates
inferredcites →https://doi.org/10.1137/050628957openalex-snapshot
A Simple Algorithm for Mal'tsev Constraints
inferredcites →https://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1147/rd.254.0327openalex-snapshot
Positive First-Order Logic Is NP-Complete
inferredcites →https://doi.org/10.2178/jsl/1286198146openalex-snapshot
The reducts of equality up to primitive positive interdefinability
inferredcites →https://doi.org/10.4153/cjm-1994-054-1openalex-snapshot
Finite Clones Containing All Permutations
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-319-40189-8_34openalex-snapshot
The Complexity of Counting Quantifiers on Equality Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_4openalex-snapshot
Meditations on Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_51openalex-snapshot
Syntactically Characterizing Local-to-Global Consistency in ORD-Horn
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_70openalex-snapshot
QCSP on Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_45openalex-snapshot
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.022openalex-snapshot
The complexity of counting quantifiers on equality languages
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/ijcnn.2015.7280507openalex-snapshot
Generalized constraint neural network regression model subject to equality function constraints
inferred← citeshttps://doi.org/10.1109/lics.2012.32openalex-snapshot
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/time.2012.19openalex-snapshot
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch103openalex-snapshot
The complete classification for quantified equality constraints
inferred← citeshttps://doi.org/10.1142/s0218196714500507openalex-snapshot
Tractability of quantified temporal constraints to the max
inferred← citeshttps://doi.org/10.1145/3007899openalex-snapshot
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1145/3568397openalex-snapshot
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
inferred← citeshttps://doi.org/10.2168/lmcs-9(1:15)2013openalex-snapshot
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.615openalex-snapshot
The Complexity of Abduction for Equality Constraint Languages
inferred← citeshttps://doi.org/10.4230/lipics.csl.2017.42openalex-snapshot
An Algebraic Approach to Valued Constraint Satisfaction
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02721openalex-snapshot
Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction 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.