On the public citation graph

A Prolog technology theorem prover

0 signed · 97 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-3-642-81955-1_32openalex-snapshot

Linear Resolution with Selection Function

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

The occur-check problem in Prolog

inferredcites →https://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot

Linear resolution with selection function

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

The technology chess program

inferredcites →https://doi.org/10.1016/0004-3702(76)90021-7openalex-snapshot

Refutation graphs

inferredcites →https://doi.org/10.1109/tc.1976.1674614openalex-snapshot

A Hole in Goal Trees: Some Guidance from Resolution Theory

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

A Simplified Format for the Model Elimination Theorem-Proving Procedure

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

An Implementation of the Model Elimination Proof Procedure

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-15199-0_18openalex-snapshot

A PROLOG environment for developing and reasoning about data types

inferred← citeshttps://doi.org/10.1007/3-540-16042-6_7openalex-snapshot

PROLOG-based inductive theorem proving

inferred← citeshttps://doi.org/10.1007/3-540-16780-3_103openalex-snapshot

Abstraction using generalization functions

inferred← citeshttps://doi.org/10.1007/3-540-16780-3_122openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/3-540-45744-5_24openalex-snapshot

NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics

inferred← citeshttps://doi.org/10.1007/3-540-46695-9_21openalex-snapshot

PTTP+GLiDeS: Guiding Linear Deductions with Semantics

inferred← citeshttps://doi.org/10.1007/3-540-47922-8_6openalex-snapshot

Clue as a Testbed for Automated Theorem Proving

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-48317-9_6openalex-snapshot

A Survey of Automated Deduction

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

Automatic acquisition of search guiding heuristics

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

An examination of the prolog technology theorem-prover

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-54594-8_72openalex-snapshot

The LILOG inference engine

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

The TPTP problem library

inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_11openalex-snapshot

The Power of Partial Evaluation

inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_5openalex-snapshot

OBJ as a Theorem Prover with Applications to Hardware Verification

inferred← citeshttps://doi.org/10.1007/978-1-4899-2471-1_7openalex-snapshot

Attribute Grammar Approach to Knowledge-Based System Building — Application to Fault Diagnosis

inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot

Parallel Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_17openalex-snapshot

Übersetzung logischer Programmiersprachen

inferred← citeshttps://doi.org/10.1007/978-3-662-40145-3_3openalex-snapshot

An Introduction to Automated Deduction

inferred← citeshttps://doi.org/10.1007/978-3-663-01522-2_4openalex-snapshot

Applications

inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_9openalex-snapshot

Natural Language Presentation and Combination of Automatically Generated Proofs

inferred← citeshttps://doi.org/10.1007/978-94-009-3931-8_5openalex-snapshot

A Theorem Prover as a Fault Diagnostic Tool

inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_2openalex-snapshot

METEORs: High Performance Theorem Provers using Model Elimination

inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_4openalex-snapshot

A Connection Calculus for Handling Incomplete Information

inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_10openalex-snapshot

Implementing Semantic Tableaux

inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_3openalex-snapshot

First-Order Tableau Methods

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

Parthenon: A parallel theorem prover for non-horn clauses

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

An overview of automated reasoning and related fields

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

Schubert's Steamroller problem: Formulations and solutions

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

A new methodology for query answering in default logics via structure-oriented theorem proving

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

Parallelization of deduction strategies: An analytical study

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

METEOR: Exploring model elimination theorem proving

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

A full theorem-prover under uncertainty

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

Avoiding duplicate proofs with the foothold refinement

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

Near-Horn Prolog and the ancestry family of procedures

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

The application of automated reasoning to questions in mathematics and logic

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

On the complexities of non-Horn Clause logic programming

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

Compiling a default reasoning system into Prolog

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

SATCHMO: A theorem prover implemented in Prolog

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

PARTHENON: A parallel theorem prover for non-horn clauses

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

An introduction to automated deduction

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

Disjunctive logic programming, constructivity and strong negation

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

Logic-algebraic method for a class of knowledge based systems

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

Semantics of nonmonotonic reasoning in logic programming

inferred← citeshttps://doi.org/10.1007/s10817-015-9334-4openalex-snapshot

Semantically-Guided Goal-Sensitive Reasoning: Model Representation

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(91)90049-popenalex-snapshot

Logic and artificial intelligence

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

A semantic backward chaining proof system

inferred← citeshttps://doi.org/10.1016/0164-1212(89)90022-8openalex-snapshot

PLEASE: Executable specifications for incremental software development

inferred← citeshttps://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot

A quantitative approach to logical inference

inferred← citeshttps://doi.org/10.1016/0304-3975(87)90016-8openalex-snapshot

Automatic inductive theorem proving using prolog

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(84)90004-9openalex-snapshot

Equality, types, modules, and (why not?) generics for logic programming

inferred← citeshttps://doi.org/10.1016/0743-1066(88)90005-2openalex-snapshot

Clausal intuitionistic logic I. fixed-point semantics

inferred← citeshttps://doi.org/10.1016/0743-1066(89)90017-4openalex-snapshot

A computable semantics for general logic programs

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(94)00030-aopenalex-snapshot

Depth-bounded bottom-up evaluation of logic programs

inferred← citeshttps://doi.org/10.1016/0950-5849(88)90134-6openalex-snapshot

Attribute grammar based theorem prover

inferred← citeshttps://doi.org/10.1016/0950-5849(90)90004-bopenalex-snapshot

Attribute-grammar interpreter for inexact reasoning

inferred← citeshttps://doi.org/10.1016/b978-012443875-0/50021-5openalex-snapshot

Petri Nets in Knowledge Verification and Validation of Rule-Based Expert Systems

inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00092-7openalex-snapshot

Prolog technology for default reasoning: proof theory and compilation techniques

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70661-5openalex-snapshot

Introduction to the Theory of Logic Programming

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

The TPTP Problem Library

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

A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion

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

An early report on ENCOMPASS

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

PARTHENON: a parallel theorem prover for nonHorn clauses

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

Computing answers in default logic

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

If Prolog is the Answer, What is the Question? or What it Takes to Support AI Programming Paradigms

inferred← citeshttps://doi.org/10.1111/j.1467-8640.1987.tb00176.xopenalex-snapshot

Expressiveness and tractability in knowledge representation and reasoning1

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

Logical Basis for the Automation of Reasoning: Case Studies

inferred← citeshttps://doi.org/10.1145/12808.12833openalex-snapshot

Automated theorem proving: mapping logic into AI

inferred← citeshttps://doi.org/10.1145/151333.151377openalex-snapshot

Shortest path by approximation in logic programs

inferred← citeshttps://doi.org/10.1145/154630.154640openalex-snapshot

Tutorial on specialisation of logic programs

inferred← citeshttps://doi.org/10.1145/44326.44337openalex-snapshot

Please: a language combining imperative and logic programming

inferred← citeshttps://doi.org/10.1145/98949.99153openalex-snapshot

Strategies for deductive databases

inferred← citeshttps://doi.org/10.1147/rd.363.0361openalex-snapshot

STORK and PENGUIN: Logic programming systems using general clauses and defaults

inferred← citeshttps://doi.org/10.1147/rd.366.0965openalex-snapshot

Knowledge in operation

inferred← citeshttps://doi.org/10.3115/976744.976777openalex-snapshot

Abductive explanation of dialogue misunderstandings

inferred← citeshttps://doi.org/10.48550/arxiv.1705.11040openalex-snapshot

End-to-End Differentiable Proving

inferred← citeshttps://doi.org/10.48550/arxiv.2101.02690openalex-snapshot

Theorem Proving and Algebra

inferred← citeshttps://doi.org/10.5555/218355.218360openalex-snapshot

The repair of speech act misunderstandings by abductive inference

inferred← citeshttps://doi.org/10.5555/55823.55857openalex-snapshot

An early report on encompass

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.