On the public citation graph

Combining Syntax and Semantics through Prime Form Representation

0 signed · 40 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.1006/jcss.2001.1775openalex-snapshot
The Minimum Equivalent DNF Problem and Shortest Implicants
inferredcites →https://doi.org/10.1007/11579427_15openalex-snapshot
A Syntactical Approach to Belief Update
inferredcites →https://doi.org/10.1007/3-540-45655-4_57openalex-snapshot
Counting Satisfying Assignments in 2-SAT and 3-SAT
inferredcites →https://doi.org/10.1007/3-540-52885-7_113openalex-snapshot
Computing prime implicants
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-540-28645-5_17openalex-snapshot
Propositional Reasoning for an Embodied Cognitive Model
inferredcites →https://doi.org/10.1007/978-3-642-60211-5_9openalex-snapshot
An Improved Incremental Algorithm for Generating Prime Implicates
inferredcites →https://doi.org/10.1007/bf00249017openalex-snapshot
Optimizing the clausal normal form transformation
inferredcites →https://doi.org/10.1007/bf01530750openalex-snapshot
An SE-tree-based prime implicant generation algorithm
inferredcites →https://doi.org/10.1016/0004-3702(94)00092-1openalex-snapshot
On the hardness of approximate reasoning
inferredcites →https://doi.org/10.1016/0304-3975(91)90315-sopenalex-snapshot
Counting the number of solutions for instances of satisfiability
inferredcites →https://doi.org/10.1016/0304-3975(95)00144-1openalex-snapshot
Number of models and satisfiability of sets of clauses
inferredcites →https://doi.org/10.1016/s0004-3702(99)00072-7openalex-snapshot
Propositional belief base update and minimal change
inferredcites →https://doi.org/10.1016/s0747-7171(08)80029-6openalex-snapshot
An incremental method for generating prime implicants/implicates
inferredcites →https://doi.org/10.1017/cbo9780511526664.007openalex-snapshot
On the difference between updating a knowledge base and revising it
inferredcites →https://doi.org/10.1023/a:1005721905269openalex-snapshot
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates
inferredcites →https://doi.org/10.1023/a:1011917032470openalex-snapshot
An Algorithm for Dual Transformation in First-Order Logic
inferredcites →https://doi.org/10.1080/00029890.1952.11988183openalex-snapshot
The Problem of Simplifying Truth Functions
inferredcites →https://doi.org/10.1080/00029890.1959.11989404openalex-snapshot
On Cores and Prime Implicants of Truth Functions
inferredcites →https://doi.org/10.1109/t-c.1970.222917openalex-snapshot
A New Algorithm for Generating Prime Implicants
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1613/jair.601openalex-snapshot
The Good Old Davis-Putnam Procedure Helps Counting Models
inferredcites →https://doi.org/10.21236/ada256431openalex-snapshot
CMU Common Lisp User's Manual

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-08587-6_10openalex-snapshot
A Rewriting Strategy to Generate Prime Implicates in Equational Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-24598-0_13openalex-snapshot
Public and Secret Forgetting of Propositional Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_19openalex-snapshot
Prime Implicate Tries
inferred← citeshttps://doi.org/10.1007/978-3-642-04125-9_22openalex-snapshot
Prime Implicates and Reduced Implicate Tries
inferred← citeshttps://doi.org/10.1007/978-3-642-17432-2_5openalex-snapshot
Characterizing Relevant Belief Revision Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-21916-0_23openalex-snapshot
Tri-Based Set Operations and Selective Computation of Prime Implicates
inferred← citeshttps://doi.org/10.1093/jigpal/jzv049openalex-snapshot
Forgetting complex propositions
inferred← citeshttps://doi.org/10.1093/logcom/exv071openalex-snapshot
Computing prime implicates by pruning the search space and accelerating subsumption
inferred← citeshttps://doi.org/10.1613/jair.2754openalex-snapshot
Prime Implicates and Prime Implicants: From Propositional to Modal Logic
inferred← citeshttps://doi.org/10.21236/ada564895openalex-snapshot
Techniques and Tools for Trustworthy Composition of Pre-Designed Embedded Software Components
inferred← citeshttps://doi.org/10.21236/ada602193openalex-snapshot
A Formal Approach to the Provably Correct Synthesis of Mission Critical Embedded Software for Multi Core Embedded Platforms
inferred← citeshttps://doi.org/10.29007/q7h3openalex-snapshot
Trie Based Subsumption and Improving the pi-Trie Algorithm
inferred← citeshttps://doi.org/10.3233/fi-2010-247openalex-snapshot
Identifying Prime Implicate Branches in Reduced Implicate Tries
inferred← citeshttps://doi.org/10.48550/arxiv.1104.2312openalex-snapshot
Minimization for Generalized Boolean Formulas
inferred← citeshttps://doi.org/10.5555/1734953.1734955openalex-snapshot
Prime implicates and prime implicants
inferred← citeshttps://doi.org/10.70675/9ba5c75bz578ez4ecaz9d9fz077af75d391bopenalex-snapshot
Abductive reasoning modulo theories and an application to program verification
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.