On the public citation graph
Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
0 signed · 69 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-16492-8_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-16780-3_125openalex-snapshot
Causes for events: Their computation and applications
inferredcites →https://doi.org/10.1007/3-540-52885-7_76openalex-snapshot
A complete semantic back chaining proof system
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/978-3-642-76274-1_1openalex-snapshot
Problems and Promises of Computational Logic
inferredcites →https://doi.org/10.1007/bf00244355openalex-snapshot
A sequent-style model elimination strategy and a positive refinement
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/bf01531174openalex-snapshot
A prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation
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.1016/0004-3702(89)90067-2openalex-snapshot
An algorithm to compute circumscription
inferredcites →https://doi.org/10.1016/0004-3702(92)90030-2openalex-snapshot
Linear resolution for consequence finding
inferredcites →https://doi.org/10.1016/0004-3702(93)90015-4openalex-snapshot
Interpretation as abduction
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.1016/0304-3975(51)90010-2openalex-snapshot
An efficient strategy for non-Horn deductive databases
inferredcites →https://doi.org/10.1016/0743-1066(90)90043-5openalex-snapshot
Refutation search for Horn sets by a subgoal-extraction method
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1109/tsmc.1987.4309027openalex-snapshot
A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
inferredcites →https://doi.org/10.1109/tsmc.1987.4309056openalex-snapshot
A Probabilistic Causal Model for Diagnostic Problem Solving Part II: Diagnostic Strategy
inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00319.xopenalex-snapshot
Explanation and prediction: an architecture for default and abductive reasoning
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
inferredcites →https://doi.org/10.1145/321526.321527openalex-snapshot
A Simplified Format for the Model Elimination Theorem-Proving Procedure
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.1145/73721.73737openalex-snapshot
On the power of Alexander templates
inferredcites →https://doi.org/10.2307/2272384openalex-snapshot
J. A. Robinson. Automatic deduction with hyper-resolution. International journal of computer mathematics, vol. 1 no. 3 (1965), pp. 227–234.
inferredcites →https://doi.org/10.3115/982023.982034openalex-snapshot
A logic for semantic interpretation
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11814771_11openalex-snapshot
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
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-55602-8_191openalex-snapshot
Tactic-based theorem proving and knowledge-based forward chaining: An experiment with Nuprl and Ontic
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_44openalex-snapshot
An efficient abductive reasoning system based on program analysis
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_18openalex-snapshot
Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_9openalex-snapshot
Lemmas: Generation, Selection, Application
inferred← citeshttps://doi.org/10.1007/978-3-642-13840-9_6openalex-snapshot
Discovering Rules by Meta-level Abduction
inferred← citeshttps://doi.org/10.1007/978-94-015-9558-2_12openalex-snapshot
The Growth of Mathematical Knowledge: An Open World View
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/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf02948883openalex-snapshot
I-SATCHMORE: An improvement ofA-SATCHMORE
inferred← citeshttps://doi.org/10.1007/bf03037185openalex-snapshot
Incorporating top-down information into bottom-up hypothetical reasoning
inferred← citeshttps://doi.org/10.1007/bf03037320openalex-snapshot
A-SATCHMORE: SATCHMORE with availability checking
inferred← citeshttps://doi.org/10.1007/bf03037473openalex-snapshot
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
inferred← citeshttps://doi.org/10.1007/bfb0054270openalex-snapshot
On the relationship between non-horn magic sets and relevancy testing
inferred← citeshttps://doi.org/10.1007/bfb0057448openalex-snapshot
Acquisition of useful lemma-knowledge in automated reasoning
inferred← citeshttps://doi.org/10.1007/s10817-019-09515-1openalex-snapshot
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
inferred← citeshttps://doi.org/10.1007/s11390-007-9062-2openalex-snapshot
An Improvement of Herbrand's Theorem and Its Application to Model Generation Theorem Proving
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00046-xopenalex-snapshot
Clause trees: a tool for understanding and implementing resolution in automated reasoning
inferred← citeshttps://doi.org/10.1023/a:1006143621319openalex-snapshot
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
inferred← citeshttps://doi.org/10.1023/a:1018940713446openalex-snapshot
State‐saving transformations for efficient bottom‐up evaluation of logic programs and rule‐based systems
inferred← citeshttps://doi.org/10.1023/a:1018950727018openalex-snapshot
Lemma and cut strategies for propositional model elimination
inferred← citeshttps://doi.org/10.1023/a:1018998610179openalex-snapshot
A propositional theorem prover to solve planning and other problems
inferred← citeshttps://doi.org/10.1023/a:1020109502432openalex-snapshot
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1998.tb00188.xopenalex-snapshot
The scope of logic: deduction, abduction, analogy
inferred← citeshttps://doi.org/10.1145/3551357.3551383openalex-snapshot
User Guided Abductive Proof Generation for Answer Set Programming Queries
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.122.5_832openalex-snapshot
A Proposal of a Method of Reactive Scheduling for the Delivery Scheduling Problem
inferred← citeshttps://doi.org/10.1613/jair.573openalex-snapshot
Cooperation between Top-Down and Bottom-Up Theorem Provers
inferred← citeshttps://doi.org/10.3233/aic-1994-7203openalex-snapshot
Knowledge-Base Evolution for Product and Production Planning
inferred← citeshttps://doi.org/10.3233/fi-1999-391207openalex-snapshot
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi
inferred← citeshttps://doi.org/10.48550/arxiv.2209.07948openalex-snapshot
User Guided Abductive Proof Generation for Answer Set Programming Queries (Extended Version)
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.