On the public citation graph

Aggregation and negation-as-failure

https://doi.org/10.1007/bf03037222
0 signed · 37 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-60043-4_78openalex-snapshot
Partial order programming (Revisited)
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01543479openalex-snapshot
Formalizing a logic for logic programming
inferredcites →https://doi.org/10.1007/bf03037339openalex-snapshot
Towards an efficient evaluation of recursive aggregates in deductive databases
inferredcites →https://doi.org/10.1007/bf03038308openalex-snapshot
Partial deduction of logic programs wrt well-founded semantics
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(98)00003-xopenalex-snapshot
Relationlog: A typed extension to Datalog with sets and tuples
inferredcites →https://doi.org/10.1016/s0743-1066(98)10012-2openalex-snapshot
Set constructors, finite sets, and logical semantics
inferredcites →https://doi.org/10.1016/s0743-1066(99)00005-9openalex-snapshot
Subset-logic programs and their implementation
inferredcites →https://doi.org/10.1023/a:1005952908693openalex-snapshot
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
inferredcites →https://doi.org/10.1145/103140.103141openalex-snapshot
A rule-based language with functions and sets
inferredcites →https://doi.org/10.1145/113413.113427openalex-snapshot
Minimum and maximum predicates in logic programming
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/137097.137852openalex-snapshot
Monotonic aggregation in deductive databases
inferredcites →https://doi.org/10.1145/137097.137854openalex-snapshot
The well-founded semantics of aggregation
inferredcites →https://doi.org/10.1145/28659.28662openalex-snapshot
Sets and negation in a logic data base language (LDL1)
inferredcites →https://doi.org/10.1145/298514.298572openalex-snapshot
Stable models and non-determinism in logic programs with negation
inferredcites →https://doi.org/10.3233/fi-1995-2233openalex-snapshot
A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: I. STRONG PROPERTIES
inferredcites →https://doi.org/10.3233/fi-1995-2234openalex-snapshot
A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: II. WEAK PROPERTIES
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0027openalex-snapshot
Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10720076_2openalex-snapshot
Knowledge Representation Using High-Level Non-monotonic Reasoning
inferred← citeshttps://doi.org/10.1007/11681960_29openalex-snapshot
Modality Argumentation Programming
inferred← citeshttps://doi.org/10.1007/3-540-45153-6_22openalex-snapshot
Stratified Partial-Order Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-46564-2_14openalex-snapshot
High-Level Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_4openalex-snapshot
Semantics of Partial-Order Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-72308-8openalex-snapshot
Graph Structures for Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-72308-8_4openalex-snapshot
Creative Composition Problem: A Knowledge Graph Logical-Based AI Construction and Optimization Solution
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00044-0openalex-snapshot
A general theory of confluent rewriting systems for logic programming and its applications
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00005-9openalex-snapshot
Subset-logic programs and their implementation
inferred← citeshttps://doi.org/10.1017/s1471068403001881openalex-snapshot
Applications of intuitionistic logic in Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s1471068419000450openalex-snapshot
ASP-Core-2 Input Language Format
inferred← citeshttps://doi.org/10.1155/2018/4157030openalex-snapshot
Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.13140/2.1.3855.4561openalex-snapshot
Declarative and Computational Properties of Logic Programs with Aggregates.
inferred← citeshttps://doi.org/10.2200/s00648ed1v01y201505dtm041openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4596openalex-snapshot
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
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.