On the public citation graph
HARP: A tableau-based theorem prover
0 signed · 107 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.
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.
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-69391-5_19openalex-snapshot
Proof Search for Unprovable Formulas
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/978-94-017-2794-5openalex-snapshot
Proof Methods for Modal and Intuitionistic Logics
inferredcites →https://doi.org/10.1016/0004-3702(82)90011-xopenalex-snapshot
Completely non-clausal theorem proving
inferredcites →https://doi.org/10.1016/0004-3702(82)90024-8openalex-snapshot
A comparative study of several proof procedures
inferredcites →https://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50034-9openalex-snapshot
The Logic of Frames
inferredcites →https://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1016/s0049-237x(08)71538-6openalex-snapshot
Surface Semantics: Definition and Its Motivation
inferredcites →https://doi.org/10.1073/pnas.49.6.828openalex-snapshot
A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
inferredcites →https://doi.org/10.1145/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1305/ndjfl/1093887933openalex-snapshot
A tableau system for propositional S5.
inferredcites →https://doi.org/10.1305/ndjfl/1093894722openalex-snapshot
Tableau methods of proof for modal logics.
inferredcites →https://doi.org/10.2307/2183653openalex-snapshot
Logic: Techniques of Formal Reasoning.
inferredcites →https://doi.org/10.2307/2214318openalex-snapshot
Information, Deduction, and the A Priori
inferredcites →https://doi.org/10.2307/2268091openalex-snapshot
K. Jaakko J. Hintikka. Distributive normal forms in the calculus of predicates. Acta philosophica fennica, no. 6. Helsinki1953, 71 pp. With separate sheet of Corrections.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11524564_5openalex-snapshot
Applications of Description Logics: State of the Art and Research Challenges
inferred← citeshttps://doi.org/10.1007/11551263_2openalex-snapshot
Description Logics in Ontology Applications
inferred← citeshttps://doi.org/10.1007/11554554_2openalex-snapshot
Description Logics in Ontology Applications
inferred← citeshttps://doi.org/10.1007/11554554_24openalex-snapshot
Proof Output and Transformation for Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_8openalex-snapshot
Proof Simplification for Model Generation and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_13openalex-snapshot
Integration of Equality Reasoning into the Disconnection Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_1openalex-snapshot
Reasoning with Expressive Description Logics: Theory and Practice
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_8openalex-snapshot
A Model Generation Based Theorem Prover MGTP for First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_20openalex-snapshot
Model Generation with Boolean Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45683-x_6openalex-snapshot
R-UNSEARCHMO: A Refinement on UNSEARCHMO
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_11openalex-snapshot
Practical Reasoning for Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_30openalex-snapshot
A Confluent Connection Calculus
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_83openalex-snapshot
Tactical theorem proving in program verification
inferred← citeshttps://doi.org/10.1007/3-540-54487-9_62openalex-snapshot
Towards an efficient tableau proof procedure for multiple-valued logics
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_120openalex-snapshot
Resolution and path dissolution in multiple-valued logics
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_35openalex-snapshot
Automating most parts of hardware proofs in HOL
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_188openalex-snapshot
An improved method for adding equality to free variable semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_51openalex-snapshot
Semantic tableaux with ordering restrictions
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_45openalex-snapshot
On the modal logic K plus theories
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_95openalex-snapshot
The tableau-based theorem prover 3 T A P Version 4.0
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_69openalex-snapshot
Reasoning with preorders and dynamic sorts using free variable tableaux
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_57openalex-snapshot
Completeness for linear regular negation normal form inference systems
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_14openalex-snapshot
Hyper Tableau — The Next Generation
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_24openalex-snapshot
Simplification A General Constraint Propagation Technique for Propositional and Modal Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-25931-2_17openalex-snapshot
Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_45openalex-snapshot
Some Techniques for Branch-Saturation in Free-Variable Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-30597-2_1openalex-snapshot
Introduction to Inconsistency Tolerance
inferred← citeshttps://doi.org/10.1007/978-3-540-45062-7_38openalex-snapshot
Probable Consistency Checking for Sets of Propositional Clauses
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_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/bf00156916openalex-snapshot
Are tableaux an improvement on truth-tables?
inferred← citeshttps://doi.org/10.1007/bf00244357openalex-snapshot
Interest driven suppositional reasoning
inferred← citeshttps://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
inferred← citeshttps://doi.org/10.1007/bf00881950openalex-snapshot
A tableau prover for domain minimization
inferred← citeshttps://doi.org/10.1007/bf00881952openalex-snapshot
Tableau-based theorem provers: Systems and implementations
inferred← citeshttps://doi.org/10.1007/bf01383880openalex-snapshot
Structuring and automating hardware proofs in a higher-order theorem-proving environment
inferred← citeshttps://doi.org/10.1007/bfb0014310openalex-snapshot
Free variable tableaux for a many sorted logic with preorders
inferred← citeshttps://doi.org/10.1007/bfb0023433openalex-snapshot
Tableau-based theorem proving and synthesis of λ-terms in the intuitionistic logic
inferred← citeshttps://doi.org/10.1007/bfb0027413openalex-snapshot
Ordered tableaux: Extensions and applications
inferred← citeshttps://doi.org/10.1007/bfb0055916openalex-snapshot
Optimising propositional modal satisfiability for description logic subsumption
inferred← citeshttps://doi.org/10.1007/s10115-003-0125-6openalex-snapshot
Logical Comparison of Inconsistent Perspectives using Scoring Functions
inferred← citeshttps://doi.org/10.1007/s10817-006-9048-8openalex-snapshot
The Disconnection Tableau Calculus
inferred← citeshttps://doi.org/10.1007/s10817-007-9077-yopenalex-snapshot
Optimizing Terminological Reasoning for Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/s10817-019-09533-zopenalex-snapshot
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90036-uopenalex-snapshot
A truncation technique for clausal analytic tableaux
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90089-2openalex-snapshot
On the relative merits of path dissolution and the method of analytic tableaux
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.001openalex-snapshot
Linearity and regularity with negation normal form
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00070-9openalex-snapshot
EXPtime tableaux for ALC
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00026-9openalex-snapshot
Depth-first proof search without backtracking for free-variable clausal tableaux
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferred← citeshttps://doi.org/10.1023/a:1015063215934openalex-snapshot
Evaluating Optimized Decision Procedures for Propositional Modal K (m) Satisfiability
inferred← citeshttps://doi.org/10.1080/09528138908953702openalex-snapshot
OSCAR: a general theory of rationality
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.239openalex-snapshot
Practical reasoning for very expressive description logics
inferred← citeshttps://doi.org/10.1093/logcom/9.3.267openalex-snapshot
Optimizing description logic subsumption
inferred← citeshttps://doi.org/10.1093/oso/9780198537618.003.0004openalex-snapshot
Designing a Theorem Prover
inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferred← citeshttps://doi.org/10.1109/hol.1991.596284openalex-snapshot
Integrating A First-order Automatic prover In The HOL Environment
inferred← citeshttps://doi.org/10.1109/ismvl.1991.130735openalex-snapshot
Improving tableau deductions in multiple-valued logics
inferred← citeshttps://doi.org/10.1142/s0218213006002552openalex-snapshot
IMPLEMENTING THE MODEL EVOLUTION CALCULUS
inferred← citeshttps://doi.org/10.1145/74540.74584openalex-snapshot
Employing path dissolution to shorten tableaux proofs
inferred← citeshttps://doi.org/10.1145/96877.96894openalex-snapshot
Reexamining intractability of tableau methods
inferred← citeshttps://doi.org/10.1145/99412.99436openalex-snapshot
An approach to tableau inferencing with “hardwired” heuristics
inferred← citeshttps://doi.org/10.1155/2014/702326openalex-snapshot
Optimised ExpTime Tableaux for 𝒮ℋℐ𝒩 over Finite Residuated Lattices
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.2307/421141openalex-snapshot
1998 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3233/fi-1994-2135openalex-snapshot
ADAPTING CLASSICAL INFERENCE TECHNIQUES TO MULTIPLE-VALUED LOGICS USING SIGNED FORMULAS
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9711106openalex-snapshot
Generic Automatic Proof Tools
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.