On the public citation graph
Eliminating duplication with the hyper-linking strategy
0 signed · 131 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-52885-7_132openalex-snapshot
Dissolver: A dissolution-based theorem prover
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/978-3-642-81952-0_20openalex-snapshot
Eliminating the Irrelevant from Mechanical Proofs
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/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1145/321021.321023openalex-snapshot
A Mechanical Proof Procedure and its Realization in an Electronic Computer
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321160.321166openalex-snapshot
Theorem-Proving on the Computer
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/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1147/rd.41.0028openalex-snapshot
A Proof Method for Quantification Theory: Its Justification and Realization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse434openalex-snapshot
Automated Theorem Proving
inferred← citeshttps://doi.org/10.1006/ijhc.2002.1007openalex-snapshot
KJ3—a tool assisting formal validation of knowledge-based systems
inferred← citeshttps://doi.org/10.1006/inco.1996.0028openalex-snapshot
Proof Lengths for Equational Completion
inferred← citeshttps://doi.org/10.1007/10721959_16openalex-snapshot
FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure
inferred← citeshttps://doi.org/10.1007/11554554_13openalex-snapshot
Comparing Instance Generation Methods for Automated Reasoning
inferred← citeshttps://doi.org/10.1007/11591191_40openalex-snapshot
Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
inferred← citeshttps://doi.org/10.1007/3-540-36187-1_8openalex-snapshot
Semantic Selection for Resolution in Clause Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_13openalex-snapshot
Integration of Equality Reasoning into the Disconnection Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_22openalex-snapshot
A Tableau Calculus for Combining Non-disjoint Theories
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_23openalex-snapshot
System Description: GrAnDe 1.0
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_10openalex-snapshot
Proof and Model Generation with Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_30openalex-snapshot
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_26openalex-snapshot
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_3openalex-snapshot
A Taxonomy of Theorem-Proving Strategies
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_32openalex-snapshot
A Breadth-First Strategy for Mating Search
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_208openalex-snapshot
Proving equality theorems with hyper-linking
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_19openalex-snapshot
Conditional term rewriting and first-order theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_2openalex-snapshot
Model finding strategies in semantically guided instance-based theorem proving
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-60437-5_17openalex-snapshot
Composing decision procedures: the approach and a case study
inferred← citeshttps://doi.org/10.1007/3-540-61551-2_65openalex-snapshot
Using CSP look-back techniques to solve exceptionally hard SAT instances
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-319-21401-6_1openalex-snapshot
History and Prospects for First-Order Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_8openalex-snapshot
On First-Order Model-Based Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_11openalex-snapshot
What Is Essential Unification?
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_9openalex-snapshot
Advances in Connection-Based Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_20openalex-snapshot
Generalised Handling of Variables in Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_9openalex-snapshot
Integrating Equational Reasoning into Instantiation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_45openalex-snapshot
Some Techniques for Branch-Saturation in Free-Variable Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_6openalex-snapshot
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_32openalex-snapshot
The Model Evolution Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_11openalex-snapshot
Universal Variables in Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_36openalex-snapshot
Proof Systems for Effectively Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_30openalex-snapshot
Logical Engineering with Instance-Based Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_15openalex-snapshot
SMELS: Satisfiability Modulo Equality with Lazy Superposition
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_14openalex-snapshot
Instantiation-Based Automated Reasoning: From Theory to Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_6openalex-snapshot
Instantiation of SMT Problems Modulo Integers
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_10openalex-snapshot
Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_14openalex-snapshot
The Relative Power of Semantics and Unification
inferred← citeshttps://doi.org/10.1007/978-3-7091-9394-5_6openalex-snapshot
Automated Deduction and Integer Programming
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_15openalex-snapshot
Properties and Relations of Tableau and Connection Calculi
inferred← citeshttps://doi.org/10.1007/bf00880011openalex-snapshot
Formal reasoning in intelligent database systems
inferred← citeshttps://doi.org/10.1007/bf00885766openalex-snapshot
Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures
inferred← citeshttps://doi.org/10.1007/bf01014021openalex-snapshot
An autonomous multistrategy theorem proving system using knowledge-based techniques
inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot
Many-valued logic and mixed integer programming
inferred← citeshttps://doi.org/10.1007/bf01530803openalex-snapshot
Embedding complex decision procedures inside an interactive theorem prover
inferred← citeshttps://doi.org/10.1007/s10472-004-9433-0openalex-snapshot
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver
inferred← citeshttps://doi.org/10.1007/s10817-006-9048-8openalex-snapshot
The Disconnection Tableau Calculus
inferred← citeshttps://doi.org/10.1007/s10817-010-9200-3openalex-snapshot
An Instantiation Scheme for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/s10817-012-9263-4openalex-snapshot
SMELS: Satisfiability Modulo Equality with Lazy Superposition
inferred← citeshttps://doi.org/10.1007/s10817-015-9334-4openalex-snapshot
Semantically-Guided Goal-Sensitive Reasoning: Model Representation
inferred← citeshttps://doi.org/10.1007/s10817-016-9384-2openalex-snapshot
Semantically-Guided Goal-Sensitive Reasoning: Inference System and Completeness
inferred← citeshttps://doi.org/10.1007/s10817-022-09628-0openalex-snapshot
Set of Support, Demodulation, Paramodulation: A Historical Perspective
inferred← citeshttps://doi.org/10.1007/s10817-022-09656-wopenalex-snapshot
Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover
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.1007/s13218-010-0002-xopenalex-snapshot
Instance Based Methods—A Brief Overview
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00027-xopenalex-snapshot
A typed resolution principle for deduction with conditional typing theory
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90082-5openalex-snapshot
Problem solving by searching for models with a theorem prover
inferred← citeshttps://doi.org/10.1016/0167-739x(93)90007-copenalex-snapshot
Automated theorem-proving research in the Fifth Generation Computer Systems Project: Model generation theorem provers
inferred← citeshttps://doi.org/10.1016/0303-2647(94)01453-eopenalex-snapshot
A precondition prover for analogy
inferred← citeshttps://doi.org/10.1016/0957-4174(94)00058-4openalex-snapshot
CLXPERT: A rule-based scheduling system
inferred← citeshttps://doi.org/10.1016/j.artint.2007.09.005openalex-snapshot
The model evolution calculus as a first-order DPLL method
inferred← citeshttps://doi.org/10.1016/j.ins.2006.07.027openalex-snapshot
Filter-based resolution principle for lattice-valued propositional logic LP(X)
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.11.001openalex-snapshot
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
inferred← citeshttps://doi.org/10.1016/s0167-9236(98)00044-xopenalex-snapshot
A reduction method for theorem proving based on the partial-instantiation technique
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00317-8openalex-snapshot
Combining Preorder and Postorder Resolution in a Satisfiability Solver
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot
Chapter 1 Knowledge Representation and Classical Logic
inferred← citeshttps://doi.org/10.1023/a:1005802523220openalex-snapshot
The Design of the CADE-13 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1005818927764openalex-snapshot
CLIN-E - Smallest Instance First Hyper-Linking
inferred← citeshttps://doi.org/10.1023/a:1005839531398openalex-snapshot
LINUS - A Link Instantion Prover with Unit Support
inferred← citeshttps://doi.org/10.1023/a:1005866922570openalex-snapshot
Automated Deduction Techniques for Classification in Description Logic Systems
inferred← citeshttps://doi.org/10.1023/a:1005875128672openalex-snapshot
CLIN-S - A Semantically Guided First-Order Theorem Prover
inferred← citeshttps://doi.org/10.1023/a:1005882724254openalex-snapshot
Subgoal Strategies for Solving Board Puzzles
inferred← citeshttps://doi.org/10.1023/a:1005890730317openalex-snapshot
Structuring Resolution Proofs by Introducing New Lemmata
inferred← citeshttps://doi.org/10.1023/a:1006376231563openalex-snapshot
Ordered Semantic Hyper-Linking
inferred← citeshttps://doi.org/10.1023/a:1006469202251openalex-snapshot
Parallelization of a Hyper-Linking–Based Theorem Prover
inferred← citeshttps://doi.org/10.1023/a:1008333430997openalex-snapshot
A Model-Based Diagnosis System for Identifying Faulty Components in Digital Circuits
inferred← citeshttps://doi.org/10.1023/a:1015854101244openalex-snapshot
Partial Instantiation Methods for Inference in First-Order Logic
inferred← citeshttps://doi.org/10.1023/a:1018932114059openalex-snapshot
A taxonomy of parallel strategies for deduction
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/b:amai.0000012873.60775.baopenalex-snapshot
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferred← citeshttps://doi.org/10.1109/icci.1992.227643openalex-snapshot
A self-guided theorem proving system
inferred← citeshttps://doi.org/10.1109/icci.1992.227667openalex-snapshot
Use of unit clauses and clause splitting in automatic deduction
inferred← citeshttps://doi.org/10.1109/icci.1993.315359openalex-snapshot
Improving efficiency of a theorem prover by eliminating redundant unifications using network structures
inferred← citeshttps://doi.org/10.1109/icpads.1996.517599openalex-snapshot
On parallelism of hyper-linking theorem proving: a preliminary report
inferred← citeshttps://doi.org/10.1109/lics.1995.523254openalex-snapshot
Paramodulation without duplication
inferred← citeshttps://doi.org/10.1109/lics.2003.1210045openalex-snapshot
New directions in instantiation-based theorem proving
inferred← citeshttps://doi.org/10.1109/mis.2013.124openalex-snapshot
Model Evolution-Based Theorem Proving
inferred← citeshttps://doi.org/10.1109/skima.2014.7083537openalex-snapshot
GraATP: A graph theoretic approach for Automated Theorem Proving in plane geometry
inferred← citeshttps://doi.org/10.1109/tai.1998.744859openalex-snapshot
KJ3-a tool for proving formal specifications of rule-based expert systems
inferred← citeshttps://doi.org/10.1145/1380572.1380577openalex-snapshot
Flat and one-variable clauses
inferred← citeshttps://doi.org/10.1145/2480759.2480763openalex-snapshot
Instantiation Schemes for Nested Theories
inferred← citeshttps://doi.org/10.29007/89kcopenalex-snapshot
Light-Weight Integration of SAT Solving into First-Order Reasoners – First Experiments
inferred← citeshttps://doi.org/10.29007/r5m4openalex-snapshot
Efficient Rule-Matching for Hyper-Tableaux
inferred← citeshttps://doi.org/10.3233/aic-2010-0464openalex-snapshot
Restricting backtracking in connection calculi
inferred← citeshttps://doi.org/10.3233/fi-1994-2134openalex-snapshot
MODEL FINDING IN SEMANTICALLY GUIDED INSTANCE-BASED THEOREM PROVING
inferred← citeshttps://doi.org/10.3233/fi-1997-3117openalex-snapshot
Formal Verification and Diagnosis of Combinational Circuit Designs with Propositional Logic
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.