On the public citation graph
MGTP: A model generation theorem prover — Its advanced features and applications —
0 signed · 25 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/3-540-55602-8_167openalex-snapshot
Experiments in automated deduction with condensed detachment
inferredcites →https://doi.org/10.1007/3-540-55602-8_180openalex-snapshot
Embedding negation as failure into a model generation theorem prover
inferredcites →https://doi.org/10.1007/3-540-63494-0_54openalex-snapshot
A new design and implementation of progol by bottom-up computation
inferredcites →https://doi.org/10.1007/bf00881947openalex-snapshot
Controlled integration of the cut rule into connection tableau calculi
inferredcites →https://doi.org/10.1007/bf03037407openalex-snapshot
The Alexander Method — A technique for the processing of recursive axioms in deductive databases
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1007/bfb0012852openalex-snapshot
A resolution calculus for modal logics
inferredcites →https://doi.org/10.1016/0169-023x(90)90017-8openalex-snapshot
Query evaluation in recursive databases: bottom-up and top-down reconciled
inferredcites →https://doi.org/10.1093/comjnl/33.6.494openalex-snapshot
Design of the Kernel Language for the Parallel Inference Machine
inferredcites →https://doi.org/10.1145/6012.15399openalex-snapshot
Magic sets and other strange ways to implement logic programs (extended abstract)
inferredcites →https://doi.org/10.4153/cjm-1989-017-0openalex-snapshot
Quasigroup Identities and Mendelsohn Designs
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-44957-4_19openalex-snapshot
Model Generation Theorem Proving with Finite Interval Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_6openalex-snapshot
A Decidable CLDS for Some Propositional Resource Logics
inferred← citeshttps://doi.org/10.1007/3-540-46148-5_25openalex-snapshot
Towards Semantic Goal-Directed Forward Reasoning in Resolution
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_37openalex-snapshot
System Description: E- KRHyper
inferred← citeshttps://doi.org/10.1007/978-3-642-35101-3_41openalex-snapshot
A Delayed Splitting Bottom-Up Procedure for Model Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_32openalex-snapshot
SCSat: A Soft Constraint Guided SAT Solver
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
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.29007/r5m4openalex-snapshot
Efficient Rule-Matching for Hyper-Tableaux
inferred← citeshttps://doi.org/10.5282/ubm/epub.14895openalex-snapshot
Variations on a Theme: A Bibliography on Approaches to Theorem Proving Inspired From Satchmo
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.