On the public citation graph

Non-Horn clause logic programming without contrapositives

0 signed · 99 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-16780-3_122openalex-snapshot

A prolog technology theorem prover: Implementation by an extended prolog compiler

inferredcites →https://doi.org/10.1007/3-540-16780-3_137openalex-snapshot

The illinois prover: A general purpose resolution theorem prover

inferredcites →https://doi.org/10.1007/3-540-16780-3_143openalex-snapshot

ITP at argonne national laboratory

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_23openalex-snapshot

Simple Word Problems in Universal Algebras

inferredcites →https://doi.org/10.1007/bf00244291openalex-snapshot

Non-horn problems

inferredcites →https://doi.org/10.1007/bf03037324openalex-snapshot

The occur-check problem in Prolog

inferredcites →https://doi.org/10.1016/0004-3702(82)90041-8openalex-snapshot

A simplified problem reduction format

inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot

Depth-first iterative-deepening

inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot

Introduction to automata theory, languages and computation

inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot

Symbolic Logic and Mechanical Theorem Proving

inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot

Relationships between nondeterministic and deterministic tape complexities

inferredcites →https://doi.org/10.1090/s0002-9904-1947-08834-0openalex-snapshot

Ternary Boolean algebra

inferredcites →https://doi.org/10.1137/0204036openalex-snapshot

Proving Theorems with the Modification Method

inferredcites →https://doi.org/10.1145/321160.321166openalex-snapshot

Theorem-Proving on the Computer

inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot

A Machine-Oriented Logic Based on the Resolution Principle

inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot

The Concept of Demodulation in Theorem Proving

inferredcites →https://doi.org/10.1145/321526.321527openalex-snapshot

A Simplified Format for the Model Elimination Theorem-Proving Procedure

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-46674-6_15openalex-snapshot

Lemma Generalization and Non-unit Lemma Matching for Model Elimination

inferred← citeshttps://doi.org/10.1007/3-540-48317-9_3openalex-snapshot

A Taxonomy of Theorem-Proving Strategies

inferred← citeshttps://doi.org/10.1007/3-540-49477-4_37openalex-snapshot

Automated Theorem Proving in a Combination of Theories with Disjoint Signatures

inferred← citeshttps://doi.org/10.1007/3-540-52531-9_135openalex-snapshot

A prolog technology theorem prover: A new exposition and implementation in Prolog

inferred← citeshttps://doi.org/10.1007/3-540-52885-7_76openalex-snapshot

A complete semantic back chaining proof system

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-55602-8_168openalex-snapshot

Caching and lemmaizing in model elimination theorem provers

inferred← citeshttps://doi.org/10.1007/3-540-56393-8_19openalex-snapshot

Conditional term rewriting and first-order theorem proving

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-58025-5_59openalex-snapshot

Regular search spaces as a foundation of logic programming

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_14openalex-snapshot

Semantically guided first-order theorem proving using hyper-linking

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_18openalex-snapshot

The TPTP problem library

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_5openalex-snapshot

The search efficiency of theorem proving strategies

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_57openalex-snapshot

Protein: A PROver with a Theory Extension INterface

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_7openalex-snapshot

Model elimination without contrapositives

inferred← citeshttps://doi.org/10.1007/3-540-61532-6_32openalex-snapshot

On semantic resolution with lemmaizing and contraction

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-63614-5_58openalex-snapshot

Renaming a set of non-horn clauses

inferred← citeshttps://doi.org/10.1007/978-0-585-27366-2_2openalex-snapshot

Adaptive Inference

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-319-21401-6_1openalex-snapshot

History and Prospects for First-Order Automated Deduction

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-011-3488-0_14openalex-snapshot

PTTP and Linked Inference

inferred← citeshttps://doi.org/10.1007/bf00244355openalex-snapshot

A sequent-style model elimination strategy and a positive refinement

inferred← citeshttps://doi.org/10.1007/bf00247825openalex-snapshot

Eliminating duplication with the hyper-linking strategy

inferred← citeshttps://doi.org/10.1007/bf00249353openalex-snapshot

Near-Horn Prolog and beyond

inferred← citeshttps://doi.org/10.1007/bf00297245openalex-snapshot

A prolog technology theorem prover: Implementation by an extended prolog compiler

inferred← citeshttps://doi.org/10.1007/bf00880011openalex-snapshot

Formal reasoning in intelligent database systems

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/bf00881901openalex-snapshot

Bounded-overhead caching for definite-clause theorem proving

inferred← citeshttps://doi.org/10.1007/bf00881946openalex-snapshot

METEOR: Exploring model elimination theorem proving

inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot

Model elimination without contrapositives and its application to PTTP

inferred← citeshttps://doi.org/10.1007/bf00881955openalex-snapshot

Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction

inferred← citeshttps://doi.org/10.1007/bf01014021openalex-snapshot

An autonomous multistrategy theorem proving system using knowledge-based techniques

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/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/bf03037173openalex-snapshot

Linear objects: Logical processes with built-in inheritance

inferred← citeshttps://doi.org/10.1007/bf03037315openalex-snapshot

On semantic resolution with lemmaizing and contraction and a formal treatment of caching

inferred← citeshttps://doi.org/10.1007/bfb0012848openalex-snapshot

Term rewriting: Some experimental results

inferred← citeshttps://doi.org/10.1007/bfb0012873openalex-snapshot

A goal directed theorem prover

inferred← citeshttps://doi.org/10.1007/s10817-009-9143-8openalex-snapshot

The TPTP Problem Library and Associated Infrastructure

inferred← citeshttps://doi.org/10.1007/s10817-017-9407-7openalex-snapshot

The TPTP Problem Library and Associated Infrastructure

inferred← citeshttps://doi.org/10.1016/0004-3702(89)90011-8openalex-snapshot

Refinements to depth-first iterative-deepening search in automatic theorem proving

inferred← citeshttps://doi.org/10.1016/0004-3702(92)90044-xopenalex-snapshot

A semantic backward chaining proof system

inferred← citeshttps://doi.org/10.1016/0004-3702(94)00027-xopenalex-snapshot

A typed resolution principle for deduction with conditional typing theory

inferred← citeshttps://doi.org/10.1016/0004-3702(94)90082-5openalex-snapshot

Problem solving by searching for models with a theorem prover

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90168-fopenalex-snapshot

A Prolog technology theorem prover: a new exposition and implementation in Prolog

inferred← citeshttps://doi.org/10.1016/0743-1066(91)90008-dopenalex-snapshot

Automated theorem proving and logic programming: a natural symbiosis

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-0-08-057115-7.50028-5openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/b978-0-08-057115-7.50031-5openalex-snapshot

inferred← citeshttps://doi.org/10.1016/b978-0-934613-67-5.50017-4openalex-snapshot

A Survey of Automated Deduction11This is an enlarged version of a survey talk given by Woody Bledsoe at the Sixth National Conference on Artificial Intelligence, Seattle, Washington, July 16, 1987.

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/b978-1-4832-0774-2.50010-xopenalex-snapshot

Planning, Acting, and Learning in a Dynamic Domain

inferred← citeshttps://doi.org/10.1016/j.eswa.2005.04.013openalex-snapshot

A multi-agent framework for distributed theorem proving

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.1016/s0169-023x(97)00026-8openalex-snapshot

Top-down query processing in indefinite stratified databases

inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80136-8openalex-snapshot

Term rewriting: Some experimental results

inferred← citeshttps://doi.org/10.1023/a:1005806324129openalex-snapshot

The TPTP Problem Library

inferred← citeshttps://doi.org/10.1023/a:1005866922570openalex-snapshot

Automated Deduction Techniques for Classification in Description Logic Systems

inferred← citeshttps://doi.org/10.1023/a:1005878609884openalex-snapshot

A New Technique for Verifying and Correcting Logic Programs

inferred← citeshttps://doi.org/10.1023/a:1006376231563openalex-snapshot

Ordered Semantic Hyper-Linking

inferred← citeshttps://doi.org/10.1023/a:1006469202251openalex-snapshot

Parallelization of a Hyper-Linking–Based Theorem Prover

inferred← citeshttps://doi.org/10.1093/logcom/8.2.209openalex-snapshot

Uniform provability in classical logic

inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot

Automated Deduction in Multiple-valued Logics

inferred← citeshttps://doi.org/10.1109/12.53608openalex-snapshot

On the equivalence of cost functions in the design of circuits by cost-table

inferred← citeshttps://doi.org/10.1109/12.53609openalex-snapshot

Experimental results on subgoal reordering

inferred← citeshttps://doi.org/10.1109/cmpsac.1996.544149openalex-snapshot

Compilation of disjunctive logic programs using an extended WAM

inferred← citeshttps://doi.org/10.1109/lics.1995.523254openalex-snapshot

Paramodulation without duplication

inferred← citeshttps://doi.org/10.1142/9789812813411_0041openalex-snapshot

Subsumption, a Sometimes Undervalued Procedure

inferred← citeshttps://doi.org/10.1142/s0129065701000540openalex-snapshot

NEURAL NETWORKS AND LOGICAL REASONING SYSTEMS: A TRANSLATION TABLE

inferred← citeshttps://doi.org/10.21236/ada185172openalex-snapshot

Near-Horn Prolog.

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

inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0031openalex-snapshot

Calculi for Disjunctive Logic Programming

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.