On the public citation graph

An SE-tree-based prime implicant generation algorithm

0 signed · 48 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.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1956.tb03835.xopenalex-snapshot
Minimization of Boolean Functions*
inferredcites →https://doi.org/10.1007/3-540-52885-7_113openalex-snapshot
Computing prime implicants
inferredcites →https://doi.org/10.1007/3-540-53104-1_27openalex-snapshot
Characterizing diagnoses
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.1016/0004-3702(82)90024-8openalex-snapshot
A comparative study of several proof procedures
inferredcites →https://doi.org/10.1016/0004-3702(87)90062-2openalex-snapshot
A theory of diagnosis from first principles
inferredcites →https://doi.org/10.1016/0004-3702(89)90026-xopenalex-snapshot
A circumscriptive theorem prover
inferredcites →https://doi.org/10.1016/0004-3702(89)90079-9openalex-snapshot
A correction to the algorithm in reiter's theory of diagnosis
inferredcites →https://doi.org/10.1016/0169-2607(91)90002-bopenalex-snapshot
A problem decomposition method for efficient diagnosis and interpretation of multiple disorders
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.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1080/00029890.1952.11988183openalex-snapshot
The Problem of Simplifying Truth Functions
inferredcites →https://doi.org/10.1109/caia.1988.196094openalex-snapshot
Diagnosing multiple failures using knowledge of component states
inferredcites →https://doi.org/10.1109/pgec.1967.264648openalex-snapshot
Generalization of Consensus Theory and Application to the Minimization of Boolean Functions
inferredcites →https://doi.org/10.1109/t-c.1970.222917openalex-snapshot
A New Algorithm for Generating Prime Implicants
inferredcites →https://doi.org/10.1109/tce.1953.6371932openalex-snapshot
The map method for synthesis of combinational logic circuits
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-84628-271-3_9openalex-snapshot
Agents in a Wild World
inferred← citeshttps://doi.org/10.1007/978-1-4615-0429-0_12openalex-snapshot
Condensing Uncertainty via Incremental Treatment Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-31414-8_2openalex-snapshot
Logic-Based Explainability in Machine Learning
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-24318-4_30openalex-snapshot
SAT-Based Horn Least Upper Bounds
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-319-26979-5_2openalex-snapshot
A Framework for Fast Service Verification and Query Execution for Boolean Service Rules
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_19openalex-snapshot
On Finding Minimum Satisfying Assignments
inferred← citeshttps://doi.org/10.1007/978-3-642-31951-8_31openalex-snapshot
Comparison of Upward and Downward Generalizations in CF-Induction
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_3openalex-snapshot
Consequence Finding Algorithms
inferred← citeshttps://doi.org/10.1007/s10462-007-9055-0openalex-snapshot
Just enough learning (of association rules): the TAR2 “Treatment” learner
inferred← citeshttps://doi.org/10.1016/j.artint.2007.12.003openalex-snapshot
On propositional definability
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.017openalex-snapshot
Computational aspects of monotone dualization: A brief survey
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105198openalex-snapshot
On prime scenarios in qualitative spatial and temporal reasoning
inferred← citeshttps://doi.org/10.1016/s0065-2458(05)65004-8openalex-snapshot
Verification and Validation and Artificial Intelligence
inferred← citeshttps://doi.org/10.1093/jigpal/jzv049openalex-snapshot
Forgetting complex propositions
inferred← citeshttps://doi.org/10.1093/logcom/exm051openalex-snapshot
Combining Syntax and Semantics through Prime Form Representation
inferred← citeshttps://doi.org/10.1109/ase.2001.989836openalex-snapshot
Better reasoning about software engineering activities
inferred← citeshttps://doi.org/10.1109/icdm.2003.1250958openalex-snapshot
A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns
inferred← citeshttps://doi.org/10.1109/sew.2006.27openalex-snapshot
Qualitative Modeling for Requirements Engineering
inferred← citeshttps://doi.org/10.1109/tencon.2005.301005openalex-snapshot
Prime Implicant Computation Based on Adjacent Minterm Operations
inferred← citeshttps://doi.org/10.1109/wi.2006.78openalex-snapshot
Fast Discovery of Interesting Collections of Web Services
inferred← citeshttps://doi.org/10.1145/3459637.3482321openalex-snapshot
ASTERYX
inferred← citeshttps://doi.org/10.1145/3594869openalex-snapshot
Interpreting Adversarial Examples in Deep Learning: A Review
inferred← citeshttps://doi.org/10.1613/jair.5001openalex-snapshot
Parallel Model-Based Diagnosis on Multi-Core Computers
inferred← citeshttps://doi.org/10.24963/ijcai.2020/726openalex-snapshot
Towards Trustable Explainable AI
inferred← citeshttps://doi.org/10.33915/etd.1237openalex-snapshot
Random search of AND-OR graphs representing finite-state models
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4639openalex-snapshot
Post-Proceedings of the First International Workshop on Learning and Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.70675/9ba5c75bz578ez4ecaz9d9fz077af75d391bopenalex-snapshot
Abductive reasoning modulo theories and an application to program verification
inferred← citeshttps://doi.org/10.70675/e74c615fz12cbz4425z8bc7z8f651a87f9d8openalex-snapshot
Modèles prédictifs & raisonnement avec les explications
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.