On the public citation graph

Tableau-based theorem provers: Systems and implementations

https://doi.org/10.1007/bf00881952

0 signed · 34 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-52885-7_112openalex-snapshot

A tableaux-based theorem prover for a decidable subset of default logic

inferredcites →https://doi.org/10.1007/3-540-52885-7_78openalex-snapshot

Partheo: A high-performance parallel theorem prover

inferredcites →https://doi.org/10.1007/3-540-55602-8_168openalex-snapshot

Caching and lemmaizing in model elimination theorem provers

inferredcites →https://doi.org/10.1007/3-540-55602-8_188openalex-snapshot

An improved method for adding equality to free variable semantic tableaux

inferredcites →https://doi.org/10.1007/3-540-56944-8_60openalex-snapshot

Non-clausal deductive techniques for computing prime implicants and prime implicates

inferredcites →https://doi.org/10.1007/3-540-58156-1_57openalex-snapshot

Protein: A PROver with a Theory Extension INterface

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

Model elimination without contrapositives

inferredcites →https://doi.org/10.1007/978-94-011-3488-0_2openalex-snapshot

METEORs: High Performance Theorem Provers using Model Elimination

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

Parthenon: A parallel theorem prover for non-horn clauses

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

SETHEO: A high-performance theorem prover

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

HARP: A tableau-based theorem prover

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

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

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

The liberalized ?-rule in free variable semantic tableaux

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

Structuring and automating hardware proofs in a higher-order theorem-proving environment

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

Accelerating tableaux proofs using compact representations

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

OR-parallel theorem proving with random competition

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

Towards first-order deduction based on Shannon graphs

inferredcites →https://doi.org/10.1016/0304-3975(92)90168-fopenalex-snapshot

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

inferredcites →https://doi.org/10.1016/0304-3975(94)90089-2openalex-snapshot

On the relative merits of path dissolution and the method of analytic tableaux

inferredcites →https://doi.org/10.1016/b978-0-444-81641-2.50009-5openalex-snapshot

Hardware-Verification using First Order BDDs††This work has been partly financed by a German national grant, project Automated System Design, SFB No.358

inferredcites →https://doi.org/10.1049/sej.1991.0006openalex-snapshot

Proving properties of a safety-critical system

inferredcites →https://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot

Automated Deduction in Multiple-valued Logics

inferredcites →https://doi.org/10.3233/fi-1993-182-403openalex-snapshot

Tableaux Versus Resolution a Comparison

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-61630-6_4openalex-snapshot

What you always wanted to know about rigid E-unification

inferred← citeshttps://doi.org/10.1007/3-540-61697-7_4openalex-snapshot

Equality elimination for the tableau method

inferred← citeshttps://doi.org/10.1007/978-3-540-76890-6_41openalex-snapshot

Parallelizing Tableaux-Based Description Logic Reasoning

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

A Bibliography on Analytic Tableaux Theorem Proving

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

Elimination of equality via transformation with ordering constraints

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot

Equality Reasoning in Sequent-Based Calculi

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

What You Always Wanted to Know about Rigid E-Unification

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

Automatic verification of requirement specifications

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

DT-an automated theorem prover for multiple-valued first-order predicate logics

inferred← citeshttps://doi.org/10.11606/t.45.2007.tde-04052007-175943openalex-snapshot

"Um provador de teoremas multi-estratégia"

inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot

Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic

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.