On the public citation graph

Bottom-up computation of the Fitting model for general deductive databases

https://doi.org/10.1007/bf00712386
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.
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/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferredcites →https://doi.org/10.1016/0306-4379(92)90003-6openalex-snapshot
Safe computation of the well-founded semantics of datalog queries
inferredcites →https://doi.org/10.1016/0743-1066(93)90034-eopenalex-snapshot
A goal-oriented approach to computing the well-founded semantics
inferredcites →https://doi.org/10.1016/0890-5401(91)90059-bopenalex-snapshot
The expressive power of stratified logic programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1109/69.75890openalex-snapshot
A generalized relational model for indefinite and maybe information
inferredcites →https://doi.org/10.1137/0205033openalex-snapshot
The Theoretical Aspects of the Optimal Fixedpoint
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/195613.195646openalex-snapshot
Modular stratification and magic sets for Datalog programs with negation
inferredcites →https://doi.org/10.1145/298514.298558openalex-snapshot
Modular stratification and magic sets for DATALOG programs with negation
inferredcites →https://doi.org/10.3233/fi-1990-13107openalex-snapshot
On Downward Closure Ordinals of Logic Programs
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44399-1_42openalex-snapshot
Tuple Relational Calculus for Paraconsistent Databases
inferred← citeshttps://doi.org/10.1007/3-540-46019-5_11openalex-snapshot
Paraconsistency in Object-Oriented Databases
inferred← citeshttps://doi.org/10.1007/3-540-48252-0_21openalex-snapshot
Infinite Relations in Paraconsistent Databases
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_75openalex-snapshot
An algebraic construction of the well-founded model
inferred← citeshttps://doi.org/10.1007/978-1-4615-5209-3_4openalex-snapshot
A Query Construct for Paraconsistent Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-26181-2_2openalex-snapshot
Construction of P-Minimal Models Using Paraconsistent Relational Model
inferred← citeshttps://doi.org/10.1007/978-3-319-27060-9_12openalex-snapshot
Description Logic Programs: A Paraconsistent Relational Model Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/s10472-017-9536-zopenalex-snapshot
Quasi-classical reasoning in paraconsistent databases
inferred← citeshttps://doi.org/10.1016/s0306-4379(00)00032-6openalex-snapshot
Efficient representation and algebraic manipulation of infinite relations in paraconsistent databases
inferred← citeshttps://doi.org/10.1080/00207169508804361openalex-snapshot
A paraconsistent relational data model
inferred← citeshttps://doi.org/10.1109/nafips.2008.4531248openalex-snapshot
Handling disjunctions in open world relational databases
inferred← citeshttps://doi.org/10.1145/1410308.1410316openalex-snapshot
Explicit and default negation in databases and logic programs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0505014openalex-snapshot
Interval Neutrosophic Sets and Logic: Theory and Applications in Computing
inferred← citeshttps://doi.org/10.57709/1397210openalex-snapshot
A Novel Stable Model Computation Approach for General Dedcutive Databases
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.