On the public citation graph

An overview of automated reasoning and related fields

0 signed · 115 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.1002/9781119281313.ch2openalex-snapshot
Functional Programming
inferredcites →https://doi.org/10.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferredcites →https://doi.org/10.1007/3-540-09541-1_40openalex-snapshot
Recursive programs as functions in a first order theory
inferredcites →https://doi.org/10.1007/3-540-10009-1_17openalex-snapshot
Hyperparamodulation: A refinement of paramodulation
inferredcites →https://doi.org/10.1007/3-540-10009-1_27openalex-snapshot
How to prove algebraic inductive hypotheses without induction
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_19openalex-snapshot
The Linked Inference Principle, II: The User’s Viewpoint
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_2openalex-snapshot
A Portable Environment for Research in Automated Reasoning
inferredcites →https://doi.org/10.1007/978-1-4612-4476-9_7openalex-snapshot
The Use of a Formal Simulator to Verify a Simple Real Time Control Program
inferredcites →https://doi.org/10.1007/978-1-4613-8997-2_30openalex-snapshot
The Stanford Cart and the CMU Rover
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-0346-0145-0_26openalex-snapshot
Introducing Institutions
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_1openalex-snapshot
The Prehistory and Early History of Automated Deduction
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_1openalex-snapshot
Automated Theorem Proving 1965–1970
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-011-3488-0_5openalex-snapshot
MJRTY—A Fast Majority Vote Algorithm
inferredcites →https://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1007/bf03037327openalex-snapshot
Efficient Prolog memory management for flexible control strategies
inferredcites →https://doi.org/10.1007/bf03037328openalex-snapshot
A Prolog technology theorem prover
inferredcites →https://doi.org/10.1007/bfb0000049openalex-snapshot
Solving open questions with an automated theorem-proving program
inferredcites →https://doi.org/10.1007/bfb0000052openalex-snapshot
Logic machine architecture: Kernel functions
inferredcites →https://doi.org/10.1007/bfb0014790openalex-snapshot
Towards automatic error recovery in robot programs
inferredcites →https://doi.org/10.1007/bfb0031371openalex-snapshot
Metamorphosis grammars
inferredcites →https://doi.org/10.1007/bfb0060637openalex-snapshot
Paramodulation and set of support
inferredcites →https://doi.org/10.1016/0004-3702(74)90009-5openalex-snapshot
A man-machine theorem-proving system
inferredcites →https://doi.org/10.1016/0004-3702(80)90003-xopenalex-snapshot
Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks
inferredcites →https://doi.org/10.1016/0004-3702(80)90015-6openalex-snapshot
Prolegomena to a theory of mechanized formal reasoning
inferredcites →https://doi.org/10.1016/0004-3702(80)90049-1openalex-snapshot
An investigation into the goals of research in automatic theorem proving as related to mathematical reasoning
inferredcites →https://doi.org/10.1016/0004-3702(81)90014-xopenalex-snapshot
An experimental program transformation and synthesis system
inferredcites →https://doi.org/10.1016/0004-3702(82)90026-1openalex-snapshot
Using slots and modifiers in logic grammars for natural language
inferredcites →https://doi.org/10.1016/0004-3702(84)90054-7openalex-snapshot
A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains
inferredcites →https://doi.org/10.1016/0010-4485(82)90174-9openalex-snapshot
Logic programming: a computing tool for the architect of the future
inferredcites →https://doi.org/10.1016/0020-0190(79)90063-2openalex-snapshot
A mechanical proof of the termination of Takeuchi's function
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0167-6423(85)90009-7openalex-snapshot
Verifying the unification algorithm in LCF
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1016/0898-1221(79)90044-0openalex-snapshot
Metamathematical extensibility for theorem verifiers and proof-checkers
inferredcites →https://doi.org/10.1016/0898-1221(82)90057-8openalex-snapshot
A programming logic
inferredcites →https://doi.org/10.1016/b978-0-444-86440-6.50006-2openalex-snapshot
AIMING FOR KNOWLEDGE INFORMATION PROCESSING SYSTEMS
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50027-1openalex-snapshot
CONSULTATION SYSTEMS FOR PHYSICIANS
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50028-3openalex-snapshot
MODEL DESIGN IN THE PROSPECTOR CONSULTANT SYSTEM FOR MINERAL EXPLORATION**This work was supported in part by the Office of Resource Analysis of the U.S. Geological Survey under Contract No. 14-08-0001-15985, and in part by the Nonrenewable Resources Section of the National Science Foundation under…
inferredcites →https://doi.org/10.1016/b978-0-934613-12-5.50010-0openalex-snapshot
PROOF CHECKING THE RSA PUBLIC KEY ENCRYPTION ALGORITHM11The research reported here was supported by National Science Foundation Grant MCS-8202943 and Office of Naval Research Contract N00014-81-K-0634.
inferredcites →https://doi.org/10.1016/b978-0-934613-12-5.50017-3openalex-snapshot
Program Developments: Formal Explanations of Implementations Author's Present Address: David S. Wile, USC/Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, CA 90291.
inferredcites →https://doi.org/10.1016/b978-0-934613-12-5.50034-3openalex-snapshot
Kestrel Institute
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0628714-5openalex-snapshot
Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I
inferredcites →https://doi.org/10.1109/mp.1983.6499635openalex-snapshot
Robotics: Challenges to present-day technology: Robots must be produced in great numbers with more advanced capabilities, and we must lose our fear that they are taking over our jobs
inferredcites →https://doi.org/10.1109/tc.1976.1674696openalex-snapshot
Problems and Experiments for and with Automated Theorem-Proving Programs
inferredcites →https://doi.org/10.1109/tc.1983.1676328openalex-snapshot
Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques
inferredcites →https://doi.org/10.1109/tpami.1983.4767366openalex-snapshot
Model-Based Three-Dimensional Interpretations of Two-Dimensional Images
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1111/j.1749-6632.1984.tb16516.xopenalex-snapshot
Some Expert Systems Need Common Sense
inferredcites →https://doi.org/10.1137/0212016openalex-snapshot
The Equivalence of Two Semantic Definitions: A Case Study in LCF
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving
inferredcites →https://doi.org/10.1145/1010832.1010838openalex-snapshot
A verified encrypted packet interface
inferredcites →https://doi.org/10.1145/1464052.1464109openalex-snapshot
The unit preference strategy in theorem proving
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.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/356914.356917openalex-snapshot
Program Transformation Systems
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/357084.357090openalex-snapshot
A Deductive Approach to Program Synthesis
inferredcites →https://doi.org/10.1145/357195.357197openalex-snapshot
Experience with the SETL Optimizer
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359131.359136openalex-snapshot
Algorithm = logic + control
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/362637.362651openalex-snapshot
Symbolic integration
inferredcites →https://doi.org/10.1145/390016.808472openalex-snapshot
An interactive program verification system
inferredcites →https://doi.org/10.1145/512760.512773openalex-snapshot
A Metalanguage for interactive proof in LCF
inferredcites →https://doi.org/10.1145/567446.567461openalex-snapshot
On proving inductive properties of abstract data types
inferredcites →https://doi.org/10.1145/647004.711875openalex-snapshot
Database Management, Knowledge Base Management, and Expert System Development in PROLOG
inferredcites →https://doi.org/10.1145/647004.711880openalex-snapshot
Can Drawing Be Liberated From the Von Neumann Style?
inferredcites →https://doi.org/10.1145/647004.711883openalex-snapshot
Computer-Assisted Circuit Evaluation in PROLOG for VLSI
inferredcites →https://doi.org/10.1145/800017.800534openalex-snapshot
Pattern driven lazy reduction
inferredcites →https://doi.org/10.1145/800087.802789openalex-snapshot
A constructive alternative to axiomatic data type definitions
inferredcites →https://doi.org/10.1145/800228.806939openalex-snapshot
Prolog - the language and its implementation compared with Lisp
inferredcites →https://doi.org/10.1145/828.1882openalex-snapshot
A Mechanical Proof of the Unsolvability of the Halting Problem
inferredcites →https://doi.org/10.1177/027836498200100403openalex-snapshot
Symbolic Error Analysis and Robot Planning
inferredcites →https://doi.org/10.1177/027836498300200402openalex-snapshot
Planning Collision- Free Motions for Pick-and-Place Operations
inferredcites →https://doi.org/10.1305/ndjfl/1093870311openalex-snapshot
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
inferredcites →https://doi.org/10.1515/zwf-1986-811227openalex-snapshot
Building Expert Systems
inferredcites →https://doi.org/10.1609/aimag.v4i1.382openalex-snapshot
The Current State of AI: One Man's Opinion
inferredcites →https://doi.org/10.21236/ada006898openalex-snapshot
FOL: A Proof Checker for First-order Logic
inferredcites →https://doi.org/10.21236/ada096042openalex-snapshot
Logic Programming in LISP.
inferredcites →https://doi.org/10.21236/adb145741openalex-snapshot
A Technique for Proving Specifications are Multilevel Secure
inferredcites →https://doi.org/10.2307/2003018openalex-snapshot
Logic Machines and Diagrams
inferredcites →https://doi.org/10.48456/tr-20openalex-snapshot
On using Edinburgh LCF to prove the correctness of a parsing algorithm
inferredcites →https://doi.org/10.5555/800032.800668openalex-snapshot
Formal Design Verification of Digital Systems
inferredcites →https://doi.org/10.5555/800129.804214openalex-snapshot
Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra
inferredcites →https://doi.org/10.6028/nbs.ir.82-2479openalex-snapshot
An overview of artificial intelligence and robotics Volume II - Robotics

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cjce.5450700425openalex-snapshot
An expert system for selecting a vapour‐liquid contactor
inferred← citeshttps://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot
Automated Model Building
inferred← citeshttps://doi.org/10.1007/978-3-030-25001-0_6openalex-snapshot
Mathematical Proofs and Scientific Discovery
inferred← citeshttps://doi.org/10.1007/978-3-031-23161-2_300700openalex-snapshot
Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-33898-4_3openalex-snapshot
Opportunities and Challenges of AI-Driven Customer Service
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1007/s10817-022-09620-8openalex-snapshot
Larry Wos: Visions of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/s11225-022-09996-zopenalex-snapshot
Beishui Liao, Thomas Ågotnes, Yi N. Wang, (eds.), Dynamics, Uncertainty and Reasoning, vol. 4 of Logic in Asia: Studia Logica Library, Springer, Singapore, 2019, pp. 207+xii; ISBN: 978-981-13-7793-8 (Softcover) 117,69 €, ISBN: 978-981-13-7790-7 (Hardcover) 160,49 €, ISBN: 978-981-13-7791-4 (eBook)…
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90044-2openalex-snapshot
Limited reasoning in first-order knowledge bases
inferred← citeshttps://doi.org/10.1016/b978-0-934613-31-6.50021-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50007-8openalex-snapshot
KNOWLEDGE REPRESENTATION AND REASONING11This review draws heavily from work done with Ron Brachman. I also thank Jim des Rivières, Bart Selman, and John Tsotsos. for helping with an earlier version of the document. Financial support was received from the Natural Sciences and Engineering Research…
inferred← citeshttps://doi.org/10.1109/iske60036.2023.10481258openalex-snapshot
Active Deduction Heuristic Algorithm of Standard Contradiction Separation Rule Based on Reinforcement Learning
inferred← citeshttps://doi.org/10.1142/2196#t=tocopenalex-snapshot
Machine Proofs in Geometry: Automated Production of Readable Proofs for Geometry Theorems
inferred← citeshttps://doi.org/10.1613/jair.3126openalex-snapshot
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
inferred← citeshttps://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide
inferred← citeshttps://doi.org/10.2172/822573openalex-snapshot
OTTER 3.3 reference manual.
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.