On the public citation graph
Model elimination without contrapositives and its application to PTTP
0 signed · 54 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.1006/jsco.1993.1058openalex-snapshot
Consolution as a Framework for Comparing Calculi
inferredcites →https://doi.org/10.1007/10817.1573-0670openalex-snapshot
Journal of Automated Reasoning
inferredcites →https://doi.org/10.1007/3-540-52531-9_135openalex-snapshot
A prolog technology theorem prover: A new exposition and implementation in Prolog
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-56454-3_1openalex-snapshot
SLWV — A theorem prover for logic programming
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/978-1-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-322-84222-0openalex-snapshot
Relative Complexities of First Order Calculi
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferredcites →https://doi.org/10.1007/bf00244355openalex-snapshot
A sequent-style model elimination strategy and a positive refinement
inferredcites →https://doi.org/10.1007/bf00244493openalex-snapshot
Challenge problems in elementary calculus
inferredcites →https://doi.org/10.1007/bf00244944openalex-snapshot
Non-Horn clause logic programming without contrapositives
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/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1007/bfb0018990openalex-snapshot
A model elimination calculus with built-in theories
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/0743-1066(92)90038-5openalex-snapshot
A comparison of three PROLOG extensions
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0743-1066(85)80003-0openalex-snapshot
N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
inferredcites →https://doi.org/10.1145/49093.1058124openalex-snapshot
Book review: Automated Reasoning: 33 Basic Research Problems by Larry Wos (Prentice Hall 1988)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/11562931_33openalex-snapshot
The Need for Ancestor Resolution When Answering Queries in Horn Clause Logic
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_15openalex-snapshot
Lemma Generalization and Non-unit Lemma Matching for Model Elimination
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-57802-1_8openalex-snapshot
Theory reasoning in first order calculi
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_57openalex-snapshot
Protein: A PROver with a Theory Extension INterface
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_35openalex-snapshot
Link deletion in model elimination
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_97openalex-snapshot
Optimizing proof search in model elimination
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_18openalex-snapshot
An abductive framework for negation in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_42openalex-snapshot
DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover
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-63255-7_25openalex-snapshot
DisLoP: Towards a disjunctive logic programming system
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_45openalex-snapshot
Restart tableaux with selection function
inferred← citeshttps://doi.org/10.1007/3-540-63614-5_58openalex-snapshot
Renaming a set of non-horn clauses
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/bf02950403openalex-snapshot
Renaming a set of non-Horn clauses
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0027413openalex-snapshot
Ordered tableaux: Extensions and applications
inferred← citeshttps://doi.org/10.1007/bfb0054788openalex-snapshot
Knowledge representation with logic programs
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50021-7openalex-snapshot
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.11.001openalex-snapshot
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00042-2openalex-snapshot
Computing answers with model elimination
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00007-6openalex-snapshot
Non-Horn clause logic programming
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/s0743-1066(99)00074-6openalex-snapshot
An abductive approach to disjunctive logic programming
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.1023/a:1005812703468openalex-snapshot
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion
inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0031openalex-snapshot
Calculi for Disjunctive Logic Programming
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.