On the public citation graph
FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure
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.1007/3-540-48660-7_30openalex-snapshot
A Confluent Connection Calculus
inferredcites →https://doi.org/10.1007/3-540-56992-8_10openalex-snapshot
Model building by resolution
inferredcites →https://doi.org/10.1007/3-540-61377-3_35openalex-snapshot
Decision procedures using model building techniques
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
inferredcites →https://doi.org/10.1007/3-540-69778-0_14openalex-snapshot
Hyper Tableau — The Next Generation
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/978-94-017-0437-3openalex-snapshot
Automated Deduction — A Basis for Applications
inferredcites →https://doi.org/10.1007/bf00247825openalex-snapshot
Eliminating duplication with the hyper-linking strategy
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1016/0004-3702(95)00046-1openalex-snapshot
Experimental results on the crossover point in random 3-SAT
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1090/psapm/015/0170497openalex-snapshot
Eliminating the irrelevant from mechanical proofs
inferredcites →https://doi.org/10.1093/jigpal/7.2.217openalex-snapshot
Pruning the search space and extracting more models in tableaux
inferredcites →https://doi.org/10.1093/logcom/6.2.173openalex-snapshot
Hyperresolution and automated model building
inferredcites →https://doi.org/10.1109/lics.1999.782625openalex-snapshot
Working with arms: Complexity results on atomic representations of Herbrand models
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.5445/ir/107599openalex-snapshot
Integration und Uniformierung von Methoden des tableaubasierten Theorembeweisens [online]
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.1007/11532231_29openalex-snapshot
The Model Evolution Calculus with Equality
inferred← citeshttps://doi.org/10.1007/11554554_13openalex-snapshot
Comparing Instance Generation Methods for Automated Reasoning
inferred← citeshttps://doi.org/10.1007/11757283_6openalex-snapshot
Building Efficient Decision Procedures on Top of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11811220_12openalex-snapshot
Hyper Tableaux — The Third Version
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_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_21openalex-snapshot
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
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-32254-2_15openalex-snapshot
Living Books, Automated Deduction and Other Strange Things
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-73580-9_15openalex-snapshot
Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to 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-73595-3_35openalex-snapshot
Encoding First Order Proofs in SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-29449-5_2openalex-snapshot
Boolean Formulas of Simple Conceptual Graphs ( $\mathcal{SGBF}$ )
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-642-37651-1_15openalex-snapshot
First-Order Resolution Methods for Modal Logics
inferred← citeshttps://doi.org/10.1007/s10472-009-9143-8openalex-snapshot
Constructing infinite models represented by tree automata
inferred← citeshttps://doi.org/10.1007/s10817-004-2041-1openalex-snapshot
Living Book ? Deduction, Slicing, and Interaction
inferred← citeshttps://doi.org/10.1007/s10817-006-9048-8openalex-snapshot
The Disconnection Tableau Calculus
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-017-9408-6openalex-snapshot
Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
inferred← citeshttps://doi.org/10.1007/s10817-017-9434-4openalex-snapshot
Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
inferred← citeshttps://doi.org/10.1007/s13218-010-0002-xopenalex-snapshot
Instance Based Methods—A Brief Overview
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.entcs.2008.04.081openalex-snapshot
Encoding First Order Proofs in SMT
inferred← citeshttps://doi.org/10.1016/j.ic.2007.03.003openalex-snapshot
Generalizing DPLL and satisfiability for equalities
inferred← citeshttps://doi.org/10.1016/j.jal.2007.07.008openalex-snapshot
Applying automated deduction to natural language understanding
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.031openalex-snapshot
Model Evolution with equality — Revised and implemented
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.026openalex-snapshot
A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00368-5openalex-snapshot
A relevance restriction strategy for automated deduction
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00034-8openalex-snapshot
Hyperresolution for guarded formulae
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:1015736313131openalex-snapshot
The IJCAR ATP System Competition
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:1020109502432openalex-snapshot
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1023/a:1020512924736openalex-snapshot
Ordered Semantic Hyper Tableaux
inferred← citeshttps://doi.org/10.1023/a:1022976016809openalex-snapshot
Automated Deduction Techniques for the Management of Personalized Documents
inferred← citeshttps://doi.org/10.1023/b:jlli.0000024731.26883.86openalex-snapshot
Computational Semantics in Discourse: Underspecification, Resolution, and Inference
inferred← citeshttps://doi.org/10.1023/b:jlli.0000024788.38738.bbopenalex-snapshot
Inference and Computational Semantics
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.1142/s0218213006002552openalex-snapshot
IMPLEMENTING THE MODEL EVOLUTION CALCULUS
inferred← citeshttps://doi.org/10.1145/2503887.2503892openalex-snapshot
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
inferred← citeshttps://doi.org/10.1145/2685328.2685332openalex-snapshot
On the projection problem in active knowledge bases with incomplete information
inferred← citeshttps://doi.org/10.1613/jair.1353openalex-snapshot
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03275openalex-snapshot
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
inferred← citeshttps://doi.org/10.5282/ubm/epub.14895openalex-snapshot
Variations on a Theme: A Bibliography on Approaches to Theorem Proving Inspired From Satchmo
inferred← citeshttps://doi.org/10.5555/777092.777190openalex-snapshot
Inference methods for a pseudo-boolean satisfiability solver
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.