On the public citation graph

Minimal set unification

0 signed · 20 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/3-540-16780-3_113openalex-snapshot

NP-completeness of the set unification and matching problems

inferredcites →https://doi.org/10.1007/3-540-54444-5_123openalex-snapshot

Short overview of the CLPS system

inferredcites →https://doi.org/10.1007/3-540-56454-3_8openalex-snapshot

Embedding finite sets in a logic programming language

inferredcites →https://doi.org/10.1007/3-540-57186-8_85openalex-snapshot

A WAM-based implementation of a logic language with sets

inferredcites →https://doi.org/10.1007/bfb0026832openalex-snapshot

Minimal set unification

inferredcites →https://doi.org/10.1016/0167-9236(90)90027-oopenalex-snapshot

Unification theory

inferredcites →https://doi.org/10.1016/0743-1066(92)90005-nopenalex-snapshot

Implementation of subset-equational programs

inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot

Constraint logic programming: a survey

inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot

Embedding boolean expressions into logic programming

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-642-14309-0_3openalex-snapshot

Theory-Specific Automated Reasoning

inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_15openalex-snapshot

Membership-Constraints and Complexity in Logic Programming with Sets

inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_16openalex-snapshot

Integrating Lists, Multisets, and Sets in a Logic Programming Framework

inferred← citeshttps://doi.org/10.1007/bfb0030618openalex-snapshot

A semantic framework for functional logic programming with algebraic polymorphic types

inferred← citeshttps://doi.org/10.1007/bfb0031755openalex-snapshot

Unification of bounded simple set terms in deductive databases

inferred← citeshttps://doi.org/10.1007/bfb0034683openalex-snapshot

The complexity of weak unification of bounded simple set terms

inferred← citeshttps://doi.org/10.1007/bfb0052169openalex-snapshot

Constraint logic programming for computational linguistics

inferred← citeshttps://doi.org/10.1023/a:1006019227709openalex-snapshot

An Algorithm for General Set Unification and Its Complexity

inferred← citeshttps://doi.org/10.1145/238355.238575openalex-snapshot

Optimal unification of bound simple set-terms

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404050openalex-snapshot

A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types

showing the first 10 of 11 · page through all 11

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.