On the public citation graph

Logical testing for rule-base management

https://doi.org/10.1007/bf02186367
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.1002/nav.3800310108openalex-snapshot
A note on specialized versus unspecialized methods for maximum‐flow problems
inferredcites →https://doi.org/10.1016/0166-218x(84)90123-9openalex-snapshot
Inverting graphs of rectangular matrices
inferredcites →https://doi.org/10.1016/0167-9236(88)90128-5openalex-snapshot
Computation-oriented reductions of predicate to propositional logic
inferredcites →https://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferredcites →https://doi.org/10.1016/s0304-0208(08)72450-2openalex-snapshot
Degree-two Inequalities, Clique Facets, and Biperfect Graphs
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1145/321850.321862openalex-snapshot
Testing for the Church-Rosser Property
inferredcites →https://doi.org/10.1145/368996.369025openalex-snapshot
Topological sorting of large networks
inferredcites →https://doi.org/10.1287/mnsc.17.3.200openalex-snapshot
A Selection Problem of Shared Fixed Costs and Network Flows
inferredcites →https://doi.org/10.1287/mnsc.17.3.230openalex-snapshot
Notes—On a Selection Problem
inferredcites →https://doi.org/10.1287/mnsc.22.11.1268openalex-snapshot
Maximal Closure of a Graph and Applications to Combinatorial Problems
inferredcites →https://doi.org/10.1515/9781400875184openalex-snapshot
Flows in Networks
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118033166.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-4615-2223-2_2openalex-snapshot
On Embedded Languages, Meta-Level Reasoning, and Computer-Aided Modeling
inferred← citeshttps://doi.org/10.1007/978-1-4757-2807-1_4openalex-snapshot
An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-84048-7_3openalex-snapshot
Synergy of Expert Systems, CAD, and Logic Programming
inferred← citeshttps://doi.org/10.1007/bf02187327openalex-snapshot
A bibliography for the development of an Intelligent Mathematical Programming System
inferred← citeshttps://doi.org/10.1007/bfb0023767openalex-snapshot
Logical inference and polyhedral projection
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90062-gopenalex-snapshot
Optimal compression of propositional Horn knowledge bases: complexity and approximation
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90028-7openalex-snapshot
On the complexity of the maximum satisfiability problem for horn formulas
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90250-yopenalex-snapshot
Horn functions and their DNFs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90033-7openalex-snapshot
Recognition of q-Horn formulae in linear time
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90228-fopenalex-snapshot
The use of mathematical programming with artificial intelligence and expert systems
inferred← citeshttps://doi.org/10.1109/69.469822openalex-snapshot
Quasi-acyclic propositional Horn knowledge bases: optimal compression
inferred← citeshttps://doi.org/10.1109/hicss.1994.323341openalex-snapshot
Graph-based methods for Horn knowledge compression
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.