On the public citation graph
Using resolution for deciding solvable classes and building finite models
0 signed · 36 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.1002/malq.19890350109openalex-snapshot
On Different Concepts of Resolution
inferredcites →https://doi.org/10.1007/978-3-642-74052-7_14openalex-snapshot
Implication Algorithms for Classes of Horn Clauses
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1016/0168-0072(89)90053-5openalex-snapshot
Maslov's inverse method and decidable classes
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
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.1999.2863openalex-snapshot
Efficient Model Generation through Compilation
inferred← citeshttps://doi.org/10.1006/inco.2000.2915openalex-snapshot
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
inferred← citeshttps://doi.org/10.1006/jsco.1997.0114openalex-snapshot
Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
inferred← citeshttps://doi.org/10.1006/jsco.1999.0360openalex-snapshot
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_4openalex-snapshot
Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_18openalex-snapshot
Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas
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-56992-8_10openalex-snapshot
Model building by resolution
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_5openalex-snapshot
The search efficiency of theorem proving strategies
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_24openalex-snapshot
Constraint propagation in model generation
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_35openalex-snapshot
Decision procedures using model building techniques
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_48openalex-snapshot
Computational representations of herbrand models using grammars
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_44openalex-snapshot
Comparing computational representations of Herbrand models
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_5openalex-snapshot
MACE4 and SEM: A Comparison of Finite Model Generators
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_19openalex-snapshot
Resolution and the Decision Problem
inferred← citeshttps://doi.org/10.1007/bf00247667openalex-snapshot
Constructing finite algebras with FALCON
inferred← citeshttps://doi.org/10.1007/bfb0027423openalex-snapshot
Simplifying and generalizing formulae in tableaux. Pruning the search space and building models
inferred← citeshttps://doi.org/10.1007/s00500-011-0779-zopenalex-snapshot
On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50027-8openalex-snapshot
Resolution Decision Procedures
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00016-6openalex-snapshot
Extracting models from clause sets saturated under semantic refinements of the resolution rule
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.1093/jigpal/6.1.17openalex-snapshot
Decision procedures and model building in equational clause logic
inferred← citeshttps://doi.org/10.1109/lics.1999.782625openalex-snapshot
Working with arms: Complexity results on atomic representations of Herbrand models
inferred← citeshttps://doi.org/10.1145/221270.221605openalex-snapshot
Using resolution for extending KL-ONE-type languages
inferred← citeshttps://doi.org/10.22028/d291-25703openalex-snapshot
Resolution-based decision procedures for subclasses of first-order logic
inferred← citeshttps://doi.org/10.3233/fi-1997-30105openalex-snapshot
Tree Automata and Automated Model Building
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.