On the public citation graph

Simplifying and generalizing formulae in tableaux. Pruning the search space and building models

https://doi.org/10.1007/bfb0027423
0 signed · 30 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.1006/jsco.1997.0114openalex-snapshot
Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
inferredcites →https://doi.org/10.1007/3-540-56732-1openalex-snapshot
Resolution Methods for the Decision Problem
inferredcites →https://doi.org/10.1007/3-540-58156-1_6openalex-snapshot
A method for building models automatically. Experiments with an extension of OTTER
inferredcites →https://doi.org/10.1007/3-540-59338-1_26openalex-snapshot
Generating finite counter examples with semantic tableaux
inferredcites →https://doi.org/10.1007/3-540-59338-1_34openalex-snapshot
Model building and interactive theory discovery
inferredcites →https://doi.org/10.1007/3-540-60983-0_4openalex-snapshot
A significant extension of logic programming by adapting model building rules
inferredcites →https://doi.org/10.1007/3-540-61208-4_10openalex-snapshot
Minimal model generation with positive unit hyper-resolution tableaux
inferredcites →https://doi.org/10.1007/3-540-61377-3_35openalex-snapshot
Decision procedures using model building techniques
inferredcites →https://doi.org/10.1007/3-540-61630-6_1openalex-snapshot
Hyper tableaux
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_10openalex-snapshot
Empirical Explorations of the Geometry-Theorem Proving Machine
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1007/bfb0018439openalex-snapshot
Extending resolution for model construction
inferredcites →https://doi.org/10.1007/bfb0019355openalex-snapshot
Using resolution for deciding solvable classes and building finite models
inferredcites →https://doi.org/10.1007/bfb0027423openalex-snapshot
Simplifying and generalizing formulae in tableaux. Pruning the search space and building models
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferredcites →https://doi.org/10.1093/logcom/3.1.3openalex-snapshot
A Tableaux Method for Systematic Simultaneous Search for Refutations and Models using Equational Problems
inferredcites →https://doi.org/10.1093/logcom/6.2.173openalex-snapshot
Hyperresolution and automated model building
inferredcites →https://doi.org/10.1145/321420.321428openalex-snapshot
Automatic Theorem Proving With Renamable and Semantic Resolution
inferredcites →https://doi.org/10.1145/322307.322308openalex-snapshot
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
inferredcites →https://doi.org/10.3233/fi-1993-182-406openalex-snapshot
Deciding Clause Classes by Semantic Clash Resolution

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-46508-1_4openalex-snapshot
Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_9openalex-snapshot
A Deduction Method Complete for Refutation and Finite Satisfiability
inferred← citeshttps://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot
Automated Model Building
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_11openalex-snapshot
Massively Parallel Reasoning
inferred← citeshttps://doi.org/10.1007/bfb0095043openalex-snapshot
Integrating reactive and reflective reasoning by generating rational models
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50027-8openalex-snapshot
Resolution Decision Procedures
inferred← citeshttps://doi.org/10.1023/a:1006291616338openalex-snapshot
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
showing the first 9 of 10 · page through all 10
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.