On the public citation graph

Strict completion of Logic Programs

https://doi.org/10.1007/bf03037151
0 signed · 35 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/3-540-16492-8_109openalex-snapshot
Completeness of the SLDNF-resolution for a class of logic programs
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf02432149openalex-snapshot
Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions
inferredcites →https://doi.org/10.1016/0743-1066(84)90023-2openalex-snapshot
Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
inferredcites →https://doi.org/10.1016/0743-1066(85)90018-4openalex-snapshot
Negation as failure. II
inferredcites →https://doi.org/10.1016/0743-1066(86)90004-xopenalex-snapshot
A basis for deductive database systems II
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(89)90020-4openalex-snapshot
A completeness theorem for SLDNF resolution
inferredcites →https://doi.org/10.1016/0743-1066(89)90022-8openalex-snapshot
Signed data dependencies in logic programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50015-9openalex-snapshot
Logic Programming
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
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/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1142/s0129054190000126openalex-snapshot
RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALS

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1113openalex-snapshot
Negation as Instantiation
inferred← citeshttps://doi.org/10.1007/3-540-45635-x_27openalex-snapshot
Proving Correctness and Completeness of Normal Programs — A Declarative Approach
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_68openalex-snapshot
Soundness and completeness versus lifting property
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_18openalex-snapshot
A paraconsistent semantics with contradiction support detection
inferred← citeshttps://doi.org/10.1007/978-3-031-16767-6_8openalex-snapshot
On Correctness of Normal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_6openalex-snapshot
Some Proof Theory of First Order Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_8openalex-snapshot
A Survey of Paraconsistent Semantics for Logic Programs
inferred← citeshttps://doi.org/10.1007/bf01185404openalex-snapshot
What is failure? An approach to constructive negation
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90287-popenalex-snapshot
Equivalence-preserving first-order unfold/fold transformation systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00153-aopenalex-snapshot
Bottom-up evaluation and query optimization of well-founded models
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90041-eopenalex-snapshot
Tight, consistent, and computable completions for unrestricted logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00118-2openalex-snapshot
Completeness of SLDNF-resolution for nonfloundering queries
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80024-4openalex-snapshot
A Proof-Theoretic Framework for Logic Programming
inferred← citeshttps://doi.org/10.1017/s147106840500253xopenalex-snapshot
Proving correctness and completeness of normal programs – a declarative approach
inferred← citeshttps://doi.org/10.1017/s1471068421000077openalex-snapshot
On Signings and the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1017/s1471068425100239openalex-snapshot
On Systematic Construction of Correct Logic Programs
inferred← citeshttps://doi.org/10.1109/icci.1992.227704openalex-snapshot
What is failure? or: constructive negation by fail answers
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0207091openalex-snapshot
An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0501043openalex-snapshot
Proving Correctness and Completeness of Normal Programs - a Declarative Approach
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.