On the public citation graph
Refinement theorems in resolution theory
0 signed · 79 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.1093/comjnl/8.4.351openalex-snapshot
"International Journal of Computer Mathematics"
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321296.321302openalex-snapshot
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
inferredcites →https://doi.org/10.1145/321420.321428openalex-snapshot
Automatic Theorem Proving With Renamable and Semantic Resolution
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
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-10009-1_20openalex-snapshot
A note on resolution: How to get rid of factoring without loosing completeness
inferred← citeshttps://doi.org/10.1007/3-540-46695-9_21openalex-snapshot
PTTP+GLiDeS: Guiding Linear Deductions with Semantics
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_76openalex-snapshot
A complete semantic back chaining proof system
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_171openalex-snapshot
Linear-input subset analysis
inferred← citeshttps://doi.org/10.1007/3-540-55681-8_46openalex-snapshot
Architectures for second generation knowledge based systems
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_55openalex-snapshot
Refinements and extensions of model elimination
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_64openalex-snapshot
A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_24openalex-snapshot
A Short Survey of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-25664-6_20openalex-snapshot
α-Quasi-Lock Semantic Resolution Method for Linguistic Truth-Valued Lattice-Valued Propositional Logic $\mathcal{L}_{V(n\times2)}$ P(x)
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_2openalex-snapshot
Logic Programming in the 1970s
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_6openalex-snapshot
Some Proof Theory of First Order Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_1openalex-snapshot
Automated Theorem Proving 1965–1970
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_26openalex-snapshot
An Interactive Theorem-Proving Program
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
inferred← citeshttps://doi.org/10.1007/978-3-662-40145-3_3openalex-snapshot
An Introduction to Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-7091-8389-2_2openalex-snapshot
Vorbemerkungen zu einer Theorie der Effizienz von Beweisverfahren
inferred← citeshttps://doi.org/10.1007/bf00977256openalex-snapshot
Representations of the language recognition problem for a theorem prover
inferred← citeshttps://doi.org/10.1007/bf01068444openalex-snapshot
A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories
inferred← citeshttps://doi.org/10.1007/bfb0000062openalex-snapshot
Exponential improvement of efficient backtracking
inferred← citeshttps://doi.org/10.1007/bfb0022681openalex-snapshot
An introduction to automated deduction
inferred← citeshttps://doi.org/10.1007/s002360050069openalex-snapshot
RETRPROV A system that looks for axioms
inferred← citeshttps://doi.org/10.1007/s12204-012-1249-1openalex-snapshot
Ideal resolution principle for lattice-valued first-order logic based on lattice implication algebra
inferred← citeshttps://doi.org/10.1016/0004-3702(71)90003-8openalex-snapshot
Extracting information from resolution proof trees
inferred← citeshttps://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot
Linear resolution with selection function
inferred← citeshttps://doi.org/10.1016/0004-3702(81)90015-1openalex-snapshot
Theorem proving with abstraction
inferred← citeshttps://doi.org/10.1016/0004-3702(82)90041-8openalex-snapshot
A simplified problem reduction format
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90044-xopenalex-snapshot
A semantic backward chaining proof system
inferred← citeshttps://doi.org/10.1016/0066-4138(73)90001-3openalex-snapshot
Automatic theorem proving based on resolution
inferred← citeshttps://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90216-3openalex-snapshot
Unrestricted resolution versus N-resolution
inferred← citeshttps://doi.org/10.1016/b978-0-08-091728-3.50009-6openalex-snapshot
Herbrand's Theorem
inferred← citeshttps://doi.org/10.1016/b978-0-08-091728-3.50011-4openalex-snapshot
Semantic Resolution and Lock Resolution
inferred← citeshttps://doi.org/10.1016/b978-0-12-256380-5.50012-8openalex-snapshot
A PREDICATE CALCULUS BASED SEMANTIC NETWORK FOR DEDUCTIVE SEARCHING
inferred← citeshttps://doi.org/10.1016/c2009-0-27773-7openalex-snapshot
Artificial Intelligence: A New Synthesis
inferred← citeshttps://doi.org/10.1016/s0020-0255(72)80012-4openalex-snapshot
Theorem proving with variable-constrained resolution
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80016-5openalex-snapshot
An Introduction to Proof Theory
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1080/18756891.2013.859868openalex-snapshot
α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
inferred← citeshttps://doi.org/10.1109/fskd.2011.6019840openalex-snapshot
α-generalized linear resolution method based on lattice-valued propositional logic LP(X)
inferred← citeshttps://doi.org/10.1109/ifuzzy.2016.8004925openalex-snapshot
An elimination resolution based on propositional logic
inferred← citeshttps://doi.org/10.1109/ifuzzy.2016.8004942openalex-snapshot
General form of α-ordered linear resolution method for lattice-valued logic system with linguistic truth-values
inferred← citeshttps://doi.org/10.1109/iscid.2012.223openalex-snapshot
General Form of Alpha-Linear Resolution Method Based on Lattice-Valued First-Order Logic System
inferred← citeshttps://doi.org/10.1109/iscit.2006.340011openalex-snapshot
A Method Checking the Correctness of Sentence of Formal language Based on Linear Resolution
inferred← citeshttps://doi.org/10.1109/tpami.1981.4767050openalex-snapshot
Deduction Plans: A Basis for Intelligent Backtracking
inferred← citeshttps://doi.org/10.1109/tpami.1985.4767724openalex-snapshot
Intelligent Backtracking in Plan-Based Deduction
inferred← citeshttps://doi.org/10.1137/0201023openalex-snapshot
Compatibility and Complexity of Refinements of the Resolution Principle
inferred← citeshttps://doi.org/10.1145/116825.116833openalex-snapshot
Proving refutational completeness of theorem-proving strategies
inferred← citeshttps://doi.org/10.1145/321592.321603openalex-snapshot
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
inferred← citeshttps://doi.org/10.1145/321607.321618openalex-snapshot
The Unit Proof and the Input Proof in Theorem Proving
inferred← citeshttps://doi.org/10.1145/321694.321706openalex-snapshot
A Unifying View of Some Linear Herbrand Procedures
inferred← citeshttps://doi.org/10.1145/321707.321719openalex-snapshot
An Approach for Finding C -Linear Complete Inference Systems
inferred← citeshttps://doi.org/10.1145/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
inferred← citeshttps://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
inferred← citeshttps://doi.org/10.1145/35043.35046openalex-snapshot
The early years of logic programming
inferred← citeshttps://doi.org/10.1145/356599.356602openalex-snapshot
An Assessment of Techniques for Proving Program Correctness
inferred← citeshttps://doi.org/10.1145/360666.360672openalex-snapshot
State-space problem-reduction, and theorem proving—some relationships
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.109.5_375openalex-snapshot
Fuzzy Linear Resolution
inferred← citeshttps://doi.org/10.17816/2074-0530-67477openalex-snapshot
Deductive logic in solving computer knowledge representation
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1638771/v1openalex-snapshot
Four algorithms for propositional forgetting
inferred← citeshttps://doi.org/10.3233/jifs-161187openalex-snapshot
Multi-ary α-ordered linear minimal resolution method in lattice-valued logic system
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.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
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.