On the public citation graph
Embedding complex decision procedures inside an interactive theorem prover
0 signed · 56 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_114openalex-snapshot
Minimizing the number of clauses by renaming
inferredcites →https://doi.org/10.1007/978-1-4613-9455-6openalex-snapshot
A Basis for Theoretical Computer Science
inferredcites →https://doi.org/10.1007/bf00247825openalex-snapshot
Eliminating duplication with the hyper-linking strategy
inferredcites →https://doi.org/10.1007/bf01531077openalex-snapshot
Solving propositional satisfiability problems
inferredcites →https://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1007/bfb0060623openalex-snapshot
The mathematical language AUTOMATH, its usage, and some of its extensions
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(82)90011-xopenalex-snapshot
Completely non-clausal theorem proving
inferredcites →https://doi.org/10.1016/0743-1066(89)90009-5openalex-snapshot
Algorithms for testing the satisfiability of propositional formulae
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50016-7openalex-snapshot
Prolegomena to a Theory of Mechanized Formal Reasoning
inferredcites →https://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1016/s0747-7171(86)80028-1openalex-snapshot
A Structure-preserving Clause Form Translation
inferredcites →https://doi.org/10.1016/s0957-4174(97)83785-2openalex-snapshot
Role of reformulation in the automatic design of satisfiability procedures
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/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/322203.322204openalex-snapshot
Reasoning About Recursively Defined Data Structures
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/359545.359570openalex-snapshot
An algorithm for reasoning about equality
inferredcites →https://doi.org/10.1145/77600.77617openalex-snapshot
Nonclausal deduction in first-order temporal logic
inferredcites →https://doi.org/10.1287/ijoc.6.4.423openalex-snapshot
A Computational Study of Satisfiability Algorithms for Propositional Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/https://dx.doi.org/10.6028/nist.ir.7268openalex-snapshot
Workshop on the Evaluation of a Tactical Decision Aid Display
inferred← citeshttps://doi.org/10.1006/inco.1999.2850openalex-snapshot
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)
inferred← citeshttps://doi.org/10.1007/3-540-46238-4_8openalex-snapshot
Applying the Davis-Putnam procedure to non-clausal formulas
inferred← citeshttps://doi.org/10.1007/3-540-57292-9_36openalex-snapshot
Proving formulas through reduction to decidable classes
inferred← citeshttps://doi.org/10.1007/3-540-57292-9_37openalex-snapshot
Building and executing proof strategies in a formal metatheory
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-61511-3_115openalex-snapshot
Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
inferred← citeshttps://doi.org/10.1007/978-1-4020-5571-3_11openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1007/978-1-4471-3207-3_24openalex-snapshot
From Propositional Deciders to First Order Deciders: a Structured Approach to the Decision Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_13openalex-snapshot
Local Search for Checking Satisfiability of Formulas with Trigonometric Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_37openalex-snapshot
Entailment vs. Verification for Partial-Assignment Satisfiability and Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_4openalex-snapshot
SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-36668-3_15openalex-snapshot
A Stochastic Non-CNF SAT Solver
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-74621-8_2openalex-snapshot
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
inferred← citeshttps://doi.org/10.1007/s10817-005-9002-1openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.065openalex-snapshot
TSAT++: an Open Platform for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1023/a:1005877613942openalex-snapshot
Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem
inferred← citeshttps://doi.org/10.1023/a:1008248208102openalex-snapshot
An Architecture for Planning in Embedded Systems
inferred← citeshttps://doi.org/10.1023/a:1012380814999openalex-snapshot
A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics
inferred← citeshttps://doi.org/10.1080/08839519408945447openalex-snapshot
MRG: BUILDING PLANNERS FOR REAL-WORLD COMPLEX APPLICATIONS
inferred← citeshttps://doi.org/10.1134/s0361768812010033openalex-snapshot
Programming for modular reconfigurable robots
inferred← citeshttps://doi.org/10.1504/ijaac.2011.042855openalex-snapshot
The problem of sensor placement for triangulation-based localisation
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13553openalex-snapshot
New Encoding Methods for SAT-Based Temporal Planning
inferred← citeshttps://doi.org/10.1613/jair.4697openalex-snapshot
ITSAT: An Efficient SAT-Based Temporal Planner
inferred← citeshttps://doi.org/10.3233/978-1-58603-929-5-781openalex-snapshot
SAT Techniques for Modal and Description Logics
inferred← citeshttps://doi.org/10.3233/aic-130584openalex-snapshot
European collaboration on automated reasoning
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04225openalex-snapshot
Are You Satisfied by This Partial Assignment?
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0306035openalex-snapshot
A Transformational Decision Procedure for Non-Clausal Propositional Formulas
inferred← citeshttps://doi.org/10.70675/48e3d1fbz6773z4afcz9cb8za12943935e0eopenalex-snapshot
Formal verification at design stage of diagnosis related properties for discrete event and real-time systems
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.