On the public citation graph

Logic machine architecture: Kernel functions

0 signed · 43 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-10009-1_17openalex-snapshot

Hyperparamodulation: A refinement of paramodulation

inferredcites →https://doi.org/10.1007/3-540-10009-1_19openalex-snapshot

Data structures and control architecture for implementation of theorem-proving programs

inferredcites →https://doi.org/10.1007/3-540-10009-1_7openalex-snapshot

Variable elimination and chaining in a resolution-based prover for inequalities

inferredcites →https://doi.org/10.1016/0898-1221(75)90019-xopenalex-snapshot

An implementation of hyper-resolution

inferredcites →https://doi.org/10.1016/0898-1221(82)90053-0openalex-snapshot

Experiments with resolution-based theorem-proving algorithms

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

An Evaluation of an Implementation of Qualified Hyperresolution

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-16780-3_122openalex-snapshot

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

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

Paths to high-performance automated theorem proving

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

ITP at argonne national laboratory

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

Negative paramodulation

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

Algorithms, Datastructures, and other Issues in Efficient Automated Deduction

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

Liss — The logic inference search system

inferred← citeshttps://doi.org/10.1007/3-540-55425-4_6openalex-snapshot

Experiments with Roo, a parallel automated deduction system

inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_2openalex-snapshot

A Portable Environment for Research in Automated Reasoning

inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_4openalex-snapshot

EKL—A Mathematically Oriented Proof Checker

inferred← citeshttps://doi.org/10.1007/978-3-642-96868-6_128openalex-snapshot

Logic Machine Architecture

inferred← citeshttps://doi.org/10.1007/978-3-642-96964-5openalex-snapshot

Catalogue of Artificial Intelligence Tools

inferred← citeshttps://doi.org/10.1007/978-4-431-68144-1_7openalex-snapshot

An Application of Term Rewriting Systems for Functional Programming

inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_5openalex-snapshot

Implementation Issues of Logic Programming Languages

inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_9openalex-snapshot

Hardware Architectures for Logic Programming

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

Automated Reasoning and Bledsoe’s Dream for the Field

inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_6openalex-snapshot

Developing Deduction Systems: The Toolbox Style

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

The problem of choosing the inference rule to employ

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

An overview of automated reasoning and related fields

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

Experiments with discrimination-tree indexing and path indexing for term retrieval

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

Schubert's Steamroller problem: Formulations and solutions

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

Exploitation of parallel processing for implementing high-performance deduction systems

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

Some obstacles to the automation of reasoning, and the problem of redundant information

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

Automatic theorem proving. II

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

Logic machine architecture: Inference mechanisms

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

Controlling redundancy in large search spaces: Argonne-style theorem proving through the years

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

Otter - The CADE-13 Competition Incarnations

inferred← citeshttps://doi.org/10.1080/00029890.1985.11971545openalex-snapshot

AUTOMATED REASONING

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

Formal verification of fault tolerance using theorem-proving techniques

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

A Graph-Theoretic Approach for Timing Analysis and its Implementation

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

AUTOMATED REASONING: REAL USES AND POTENTIAL USES

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

The Practical Verification System Project

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

Components of verification technology

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

Position paper to be presented at "Verification workshop III (verkshop III)" to be held in Watsonville, CA. Feb. 18--21, 1985

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

Automated theorem proving: mapping logic into AI

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

PVS - design for a practical verification system

inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/917openalex-snapshot

Interactive theorem provers: issues faced as a user and tackled as a developer

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.