On the public citation graph
SATCHMORE: SATCHMO with RElevancy
0 signed · 60 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-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/bf00246025openalex-snapshot
Schubert's Steamroller problem: Formulations and solutions
inferredcites →https://doi.org/10.1007/bf00881955openalex-snapshot
Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1007/bfb0013613openalex-snapshot
The near-Horn approach to disjunctive logic programming
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)90033-2openalex-snapshot
A fixpoint semantics for disjunctive logic programs
inferredcites →https://doi.org/10.1016/b978-0-12-450010-5.50022-0openalex-snapshot
Circumscription and Disjunctive Logic Programming
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferred← citeshttps://doi.org/10.1006/inco.1999.2863openalex-snapshot
Efficient Model Generation through Compilation
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
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-45683-x_6openalex-snapshot
R-UNSEARCHMO: A Refinement on UNSEARCHMO
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_23openalex-snapshot
Generating Minimal Herbrand Models Step by Step
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_3openalex-snapshot
Disjunctive Logic Program = Horn Program + Control Program
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/3-540-63104-6_16openalex-snapshot
Lemma matching for a PTTP-based top-down theorem prover
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/3-540-63104-6_22openalex-snapshot
Constructing a normal form for Property Theory
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_14openalex-snapshot
Hyper Tableau — The Next Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf02947117openalex-snapshot
Eliminating redundant search space on backtracking for forward chaining theorem proving
inferred← citeshttps://doi.org/10.1007/bf02948883openalex-snapshot
I-SATCHMORE: An improvement ofA-SATCHMORE
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/bfb0026833openalex-snapshot
Goal-directed query processing in disjunctive logic databases
inferred← citeshttps://doi.org/10.1007/bfb0027401openalex-snapshot
MGTP: A model generation theorem prover — Its advanced features and applications —
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
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/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/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104562openalex-snapshot
ATWGNNS: Graph simplified representation and learning of logical formula for premise selection
inferred← citeshttps://doi.org/10.1016/j.ins.2022.11.128openalex-snapshot
Fully reusing clause deduction algorithm based on standard contradiction separation rule
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00368-5openalex-snapshot
A relevance restriction strategy for automated deduction
inferred← citeshttps://doi.org/10.1016/s0169-023x(00)00016-1openalex-snapshot
Minimal model generation for refined answering of generalized queries in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00116-1openalex-snapshot
Model generation and state generation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1023/a:1005851801356openalex-snapshot
Satchmo - The Compiling and Functional Variants
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.1023/a:1006376231563openalex-snapshot
Ordered Semantic Hyper-Linking
inferred← citeshttps://doi.org/10.1023/a:1017594402123openalex-snapshot
I-SATCHMO: An Improvement of SATCHMO
inferred← citeshttps://doi.org/10.1023/a:1020109502432openalex-snapshot
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1023/a:1020512924736openalex-snapshot
Ordered Semantic Hyper Tableaux
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185840openalex-snapshot
Binding propagation techniques for the optimization of bound disjunctive queries
inferred← citeshttps://doi.org/10.1613/jair.573openalex-snapshot
Cooperation between Top-Down and Bottom-Up Theorem Provers
inferred← citeshttps://doi.org/10.4995/thesis/10251/6023openalex-snapshot
Resolución SL*: Un paradigma basado en resolución lineal para la demostración automática
inferred← citeshttps://doi.org/10.5121/csit.2015.50600openalex-snapshot
Computer Science & Information Technology ( CS & IT )
inferred← citeshttps://doi.org/10.5121/csit.2015.50608openalex-snapshot
Diagnosing Learner Errors on Arabic Closed-Class Items
inferred← citeshttps://doi.org/10.5121/ijaia.2015.6301openalex-snapshot
Supporting Language Learners with the Meanings of Closed Class Items
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.