On the public citation graph

Procedural interpretation of non-horn logic programs

https://doi.org/10.1007/bfb0012837
0 signed · 33 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/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot
Linear resolution with selection function
inferredcites →https://doi.org/10.1016/0020-0190(82)90035-7openalex-snapshot
An extension to linear resolution with selection function
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of 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/3-540-52753-2_55openalex-snapshot
The semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-57287-2_61openalex-snapshot
A uniform framework for Deductive Database derivation strategies
inferred← citeshttps://doi.org/10.1007/978-1-4615-6245-0_4openalex-snapshot
Uncertainty in Intelligent Databases
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/978-3-662-02711-0_3openalex-snapshot
Answers for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf00248321openalex-snapshot
Weak Generalized Closed World Assumption
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01530824openalex-snapshot
DWAM ? A WAM model extension for disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01543473openalex-snapshot
Generalized disjunctive well-founded semantics for logic programs
inferred← citeshttps://doi.org/10.1007/bfb0023438openalex-snapshot
Computing answers for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90018-7openalex-snapshot
Parsing as non-Horn deduction
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90012-mopenalex-snapshot
Generalized Closed World Assumption is II02-Complete
inferred← citeshttps://doi.org/10.1016/0304-3975(51)90005-9openalex-snapshot
The semantics of incomplete databases as an expression of preferences
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90006-nopenalex-snapshot
Semantics of Horn and disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90214-zopenalex-snapshot
Paraconsistent disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/b978-0-12-450010-5.50022-0openalex-snapshot
Circumscription and Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.036openalex-snapshot
On reasoning about structural equality in XML: a description logic approach
inferred← citeshttps://doi.org/10.1109/69.88001openalex-snapshot
Combining multiple knowledge bases
inferred← citeshttps://doi.org/10.1109/ismvl.1990.122644openalex-snapshot
Paraconsistent disjunctive deductive databases
inferred← citeshttps://doi.org/10.1145/298514.298562openalex-snapshot
Backward chaining evaluation in stratified disjunctive theories
inferred← citeshttps://doi.org/10.3233/fi-1994-201236openalex-snapshot
SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION
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.