On the public citation graph

Near-Horn Prolog and beyond

https://doi.org/10.1007/bf00249353
0 signed · 55 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_112openalex-snapshot
Gracefully adding negation and disjunction to Prolog
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
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/bf00244355openalex-snapshot
A sequent-style model elimination strategy and a positive refinement
inferredcites →https://doi.org/10.1007/bf00244944openalex-snapshot
Non-Horn clause logic programming without contrapositives
inferredcites →https://doi.org/10.1007/bf03037328openalex-snapshot
A Prolog technology theorem prover
inferredcites →https://doi.org/10.1016/0743-1066(84)90029-3openalex-snapshot
N-Prolog: An extension of Prolog with hypothetical implications. I.
inferredcites →https://doi.org/10.1016/0743-1066(92)90038-5openalex-snapshot
A comparison of three PROLOG extensions
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0743-1066(85)80003-0openalex-snapshot
N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
inferredcites →https://doi.org/10.21236/ada185172openalex-snapshot
Near-Horn Prolog.

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-45331-8_7openalex-snapshot
Theorem Proving for Constructive λ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_3openalex-snapshot
Disjunctive Logic Program = Horn Program + Control Program
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_81openalex-snapshot
Case-free programs: An abstraction of definite horn programs
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_121openalex-snapshot
How well are non-horn clauses handled?
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_1openalex-snapshot
SLWV — A theorem prover for logic programming
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_8openalex-snapshot
Theory reasoning in first order calculi
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_15openalex-snapshot
The applicability of logic program analysis and transformation to theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_7openalex-snapshot
Model elimination without contrapositives
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_16openalex-snapshot
Lemma matching for a PTTP-based top-down theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_45openalex-snapshot
Restart tableaux with selection function
inferred← citeshttps://doi.org/10.1007/3-540-63614-5_58openalex-snapshot
Renaming a set of non-horn clauses
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_3openalex-snapshot
Reachability Analysis for the Extension Procedure — A Topological Result —
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_15openalex-snapshot
TMPR for Disjunctive Logic Programming and Usefulness of Strong and Exclusion Negation
inferred← citeshttps://doi.org/10.1007/978-94-017-0464-9_4openalex-snapshot
Goal-Oriented Deductions
inferred← citeshttps://doi.org/10.1007/bf00881843openalex-snapshot
TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferred← citeshttps://doi.org/10.1007/bf01530821openalex-snapshot
Near-Horn Prolog and the ancestry family of procedures
inferred← citeshttps://doi.org/10.1007/bf01530824openalex-snapshot
DWAM ? A WAM model extension for disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf02136172openalex-snapshot
On computing minimal models
inferred← citeshttps://doi.org/10.1007/bf02945765openalex-snapshot
On the complexities of non-Horn Clause logic programming
inferred← citeshttps://doi.org/10.1007/bf02950403openalex-snapshot
Renaming a set of non-Horn clauses
inferred← citeshttps://doi.org/10.1007/bfb0013613openalex-snapshot
The near-Horn approach to disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bfb0038695openalex-snapshot
Modal provability foundations for negation by failure
inferred← citeshttps://doi.org/10.1007/bfb0057462openalex-snapshot
A new abstract logic programming language and its quantifier elimination method for disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90018-7openalex-snapshot
Parsing as non-Horn deduction
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90038-5openalex-snapshot
A comparison of three PROLOG extensions
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50021-7openalex-snapshot
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00042-2openalex-snapshot
Computing answers with model elimination
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00007-6openalex-snapshot
Non-Horn clause logic programming
inferred← citeshttps://doi.org/10.1016/s0129-0657(01)00054-0openalex-snapshot
Neural Networks and Logical Reasoning Systems A Translation Table
inferred← citeshttps://doi.org/10.1023/a:1005077431494openalex-snapshot
Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication
inferred← citeshttps://doi.org/10.1093/jigpal/9.1.83openalex-snapshot
Theorem proving for untyped constructive -calculus: implementation and application
inferred← citeshttps://doi.org/10.1093/logcom/8.2.209openalex-snapshot
Uniform provability in classical logic
inferred← citeshttps://doi.org/10.1093/logcom/exm073openalex-snapshot
Speech Acts, Epistemic Planning and Grice's Maxims
inferred← citeshttps://doi.org/10.1109/lics.1995.523252openalex-snapshot
Uniform proofs and disjunctive logic programming
inferred← citeshttps://doi.org/10.1142/s0129065701000540openalex-snapshot
NEURAL NETWORKS AND LOGICAL REASONING SYSTEMS: A TRANSLATION TABLE
inferred← citeshttps://doi.org/10.1145/1071596.1071599openalex-snapshot
Disjunction and modular goal-directed proof search
inferred← citeshttps://doi.org/10.1184/r1/6492905openalex-snapshot
Theorem Proving via Uniform Proofs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0104021openalex-snapshot
Disjunction and modular goal-directed proof search
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9809014openalex-snapshot
Uniform Provability in Classical Logic
inferred← citeshttps://doi.org/10.4995/thesis/10251/6023openalex-snapshot
Resolución SL*: Un paradigma basado en resolución lineal para la demostración automática
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.