On the public citation graph

Extending resolution for model construction

https://doi.org/10.1007/bfb0018439
0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bfb0012853openalex-snapshot
Solving disequations in equational theories
inferredcites →https://doi.org/10.1007/bfb0012877openalex-snapshot
Some tools for an inference laboratory (ATINF)
inferredcites →https://doi.org/10.1007/bfb0035864openalex-snapshot
Some tools for an inference laboratory (ATINF)
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferredcites →https://doi.org/10.1090/conm/029openalex-snapshot
Automated Theorem Proving: After 25 Years
inferredcites →https://doi.org/10.1090/conm/029/05openalex-snapshot
Open Questions Solved with the Assistance of AURA
inferredcites →https://doi.org/10.1145/1008902.1008905openalex-snapshot
Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem
inferredcites →https://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
inferredcites →https://doi.org/10.1145/322307.322308openalex-snapshot
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1145/5383.5389openalex-snapshot
Equality-based binary resolution
inferredcites →https://doi.org/10.1145/74540.74585openalex-snapshot
Constrained equational reasoning
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/int.v23:10openalex-snapshot
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.1006/jsco.1999.0361openalex-snapshot
Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria
inferred← citeshttps://doi.org/10.1007/10703163_24openalex-snapshot
On the Complexity of H-Subsumption
inferred← citeshttps://doi.org/10.1007/11532231_30openalex-snapshot
Model Representation via Contexts and Implicit Generalizations
inferred← citeshttps://doi.org/10.1007/11663881_2openalex-snapshot
Equational Constraint Solving Via a Restricted Form of Universal Quantification
inferred← citeshttps://doi.org/10.1007/11853886_15openalex-snapshot
Model Representation over Finite and Infinite Signatures
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_14openalex-snapshot
Extending Decidable Clause Classes via Constraints
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_15openalex-snapshot
Completeness and Redundancy in Constrained Clause Logic
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_7openalex-snapshot
Solving Equational Problems Efficiently
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_14openalex-snapshot
Algorithms on Atomic Representations of Herbrand Models
inferred← citeshttps://doi.org/10.1007/3-540-54507-7_1openalex-snapshot
User-oriented theorem proving with the ATINF graphic proof editor
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_6openalex-snapshot
A method for building models automatically. Experiments with an extension of OTTER
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_4openalex-snapshot
A significant extension of logic programming by adapting model building rules
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/bfb0021973openalex-snapshot
TAS-D++: Syntactic trees transformations for Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/bfb0027015openalex-snapshot
Model generation with existentially quantified variables and constraints
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/s10472-004-9434-zopenalex-snapshot
On Deciding Subsumption Problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00583-2openalex-snapshot
Explicit versus implicit representations of subsets of the Herbrand universe
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00029-4openalex-snapshot
On the complexity of equational problems in CNF
inferred← citeshttps://doi.org/10.1016/s0747-7171(10)80014-8openalex-snapshot
A method for simultaneous search for refutations and models by equational constraint solving
inferred← citeshttps://doi.org/10.1023/a:1005878609884openalex-snapshot
A New Technique for Verifying and Correcting Logic Programs
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510841openalex-snapshot
Increasing the efficiency of automated theorem proving
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.1093/logcom/exm008openalex-snapshot
Model Representation over Finite and Infinite Signatures
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.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.