On the public citation graph

Compilative constructive negation in constraint logic programs

https://doi.org/10.1007/bfb0017473
0 signed · 40 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-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/978-94-010-0526-5_18openalex-snapshot
Language and Equality Theory in Logic Programming
inferredcites →https://doi.org/10.1007/bf01185404openalex-snapshot
What is failure? An approach to constructive negation
inferredcites →https://doi.org/10.1007/bfb0014975openalex-snapshot
Intensional negation of logic programs: Examples and implementation techniques
inferredcites →https://doi.org/10.1007/bfb0022561openalex-snapshot
The inverse of fitting's functional
inferredcites →https://doi.org/10.1016/0304-3975(92)90287-popenalex-snapshot
Equivalence-preserving first-order unfold/fold transformation systems
inferredcites →https://doi.org/10.1016/0743-1066(85)90014-7openalex-snapshot
A deterministic prolog fixpoint semantics
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(88)90013-1openalex-snapshot
Complete logic programs with domain-closure axiom
inferredcites →https://doi.org/10.1016/0743-1066(90)90023-xopenalex-snapshot
A transformational approach to negation in logic programming
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1991.151657openalex-snapshot
Constructive negation for constraint logic programming
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0009openalex-snapshot
SLS-Resolution without Floundering

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11680093_5openalex-snapshot
An Algorithm for Local Variable Elimination in Normal Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_28openalex-snapshot
Elimination of Negation in a Logical Framework
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_19openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_9openalex-snapshot
How to Incorporate Negation in a Prolog Compiler?
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_5openalex-snapshot
Constructive Intensional Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_20openalex-snapshot
Implementation Results in Classical Constructive Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_25openalex-snapshot
Soundness and Completeness of an “Efficient” Negation for Prolog
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_4openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/s00354-008-0053-9openalex-snapshot
Implementing Constructive Intensional Negation
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90026-4openalex-snapshot
The s-semantics approach: Theory and applications
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.037openalex-snapshot
Elimination of Local Variables from Definite Logic Programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.039openalex-snapshot
S-semantics for logic programming: A retrospective look
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00092-1openalex-snapshot
Constructive negation by pruning
inferred← citeshttps://doi.org/10.1017/s1471068417000035openalex-snapshot
αCheck: A mechanized metatheory model checker
inferred← citeshttps://doi.org/10.1051/ita/1997310504111openalex-snapshot
Négation constructive et axiomatique interne
inferred← citeshttps://doi.org/10.1145/1244002.1244284openalex-snapshot
Implementing type-based constructive negation
inferred← citeshttps://doi.org/10.1145/1273920.1273931openalex-snapshot
Mechanized metatheory model-checking
inferred← citeshttps://doi.org/10.1145/967900.968194openalex-snapshot
Constructive negation by bottom-up computation of literal answers
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2178openalex-snapshot
Simplifying Negative Goals Using Typed Existence Properties
inferred← citeshttps://doi.org/10.7551/mitpress/4304.003.0034openalex-snapshot
The Relative Complement Problem for Higher-Order Patterns
inferred← citeshttps://doi.org/10.7551/mitpress/4316.003.0062openalex-snapshot
Compiling Intensional Sets in CLP
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.