On the public citation graph

What is failure? An approach to constructive negation

https://doi.org/10.1007/bf01185404
0 signed · 74 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_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-55844-6_151openalex-snapshot
Fully declarative logic programming
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/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1007/bf03037151openalex-snapshot
Strict completion of Logic Programs
inferredcites →https://doi.org/10.1016/0020-0190(91)90012-7openalex-snapshot
A simple fixed point characterization of three-valued stable model semantics
inferredcites →https://doi.org/10.1016/0304-3975(89)90106-0openalex-snapshot
A sound and complete semantics for a version of negation as failure
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(89)90022-8openalex-snapshot
Signed data dependencies in logic programs
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/0743-1066(93)90033-dopenalex-snapshot
Proof method of partial correctness and weak completeness for normal logic programs
inferredcites →https://doi.org/10.1016/0743-1066(93)90041-eopenalex-snapshot
Tight, consistent, and computable completions for unrestricted logic programs
inferredcites →https://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1016/s0743-1066(97)00073-3openalex-snapshot
Tabulated resolution for the well-founded semantics
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferredcites →https://doi.org/10.1109/lics.1991.151657openalex-snapshot
Constructive negation for constraint 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/151634.151635openalex-snapshot
Finite representation of infinite query answers
inferredcites →https://doi.org/10.3233/fi-1990-13404openalex-snapshot
Well-Founded Semantics Coincides with Three-Valued Stable Semantics1
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/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
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/11680093_9openalex-snapshot
A Transformational Semantics of Static Embedded Implications of Normal Logic Programs
inferred← citeshttps://doi.org/10.1007/11780274_29openalex-snapshot
A Functorial Framework for Constraint Normal Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45635-x_25openalex-snapshot
Semantics of Normal Logic Programs with Embedded Implications
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-46584-7_9openalex-snapshot
How to Incorporate Negation in a Prolog Compiler?
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_5openalex-snapshot
Logic Program Specialisation
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_10openalex-snapshot
Generalizing extended execution for normal programs
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_5openalex-snapshot
Constructive negation by pruning and optimization higher-order predicates for CLP and CC languages
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_16openalex-snapshot
Towards a complete proof procedure to prove properties of normal logic programs under the completion
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_15openalex-snapshot
Extending constructive negation for partial functions in lazy functional-logic languages
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_2openalex-snapshot
On negation as instantiation
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_5openalex-snapshot
A hierarchy of semantics for normal constraint logic programs
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-031-66676-6_14openalex-snapshot
Specifications are Preferably Amenable to Proof and Animation
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-540-72982-2_1openalex-snapshot
Well-Founded Semantics for Hybrid Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-04581-3_1openalex-snapshot
Hybrid Reasoning with Rules and Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-642-13840-9_12openalex-snapshot
Chess Revision: Acquiring the Rules of Chess Variants through FOL Theory Revision from Examples
inferred← citeshttps://doi.org/10.1007/978-3-642-15543-7_2openalex-snapshot
Hybrid Reasoning with Non-monotonic Rules
inferred← citeshttps://doi.org/10.1007/bf00125368openalex-snapshot
Intensional query answering by partial evaluation
inferred← citeshttps://doi.org/10.1007/bf03037483openalex-snapshot
Constrained partial deduction and the preservation of characteristic trees
inferred← citeshttps://doi.org/10.1007/bf03037598openalex-snapshot
Constructive negation and constraint logic programming with sets
inferred← citeshttps://doi.org/10.1007/bfb0017473openalex-snapshot
Compilative constructive negation in constraint logic programs
inferred← citeshttps://doi.org/10.1007/bfb0054788openalex-snapshot
Knowledge representation with logic programs
inferred← citeshttps://doi.org/10.1007/bfb0056629openalex-snapshot
Constructive negation using typed existence properties
inferred← citeshttps://doi.org/10.1007/s10115-010-0300-5openalex-snapshot
Hybrid rules with well-founded semantics
inferred← citeshttps://doi.org/10.1007/s10485-008-9128-5openalex-snapshot
A Functorial Framework for Constraint Normal Logic Programming
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00044-8openalex-snapshot
Three-valued completion for abductive 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/j.entcs.2005.01.037openalex-snapshot
Elimination of Local Variables from Definite Logic Programs
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.03.001openalex-snapshot
Semantics of structured normal logic programs
inferred← citeshttps://doi.org/10.1016/j.jlap.2013.07.002openalex-snapshot
An extended constraint deductive database: Theory and implementation
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00046-6openalex-snapshot
A necessary condition for Constructive Negation in Constraint Logic Programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)00074-5openalex-snapshot
SLDNFA: An abductive procedure for abductive logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10027-4openalex-snapshot
Constructive negation under the well-founded semantics
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10039-0openalex-snapshot
An algebraic framework for the definition of compositional semantics of normal logic programs
inferred← citeshttps://doi.org/10.1017/s147106840500253xopenalex-snapshot
Proving correctness and completeness of normal programs – a declarative approach
inferred← citeshttps://doi.org/10.1017/s1471068425100239openalex-snapshot
On Systematic Construction of Correct Logic Programs
inferred← citeshttps://doi.org/10.1023/a:1020116927466openalex-snapshot
SLT-Resolution for the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1080/01969722.2016.1276777openalex-snapshot
Extending Query-Subquery Nets for Deductive Databases under the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1093/logcom/7.3.367openalex-snapshot
Regular search spaces and constructive negation
inferred← citeshttps://doi.org/10.1145/1244002.1244284openalex-snapshot
Implementing type-based constructive negation
inferred← citeshttps://doi.org/10.1145/967900.968194openalex-snapshot
Constructive negation by bottom-up computation of literal answers
inferred← citeshttps://doi.org/10.3217/jucs-012-11-1574openalex-snapshot
Constructive Failure in Functional-Logic Programming: From Theory to Implementation
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2178openalex-snapshot
Simplifying Negative Goals Using Typed Existence Properties
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0006031openalex-snapshot
Verifying Termination of General Logic Programs with Concrete Queries
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.