On the public citation graph
On generating small clause normal forms
0 signed · 65 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-58216-9_30openalex-snapshot
On the value of antiprenexing
inferredcites →https://doi.org/10.1007/3-540-61511-3_103openalex-snapshot
On the practical value of different definitional translations to normal form
inferredcites →https://doi.org/10.1007/3-540-61511-3_75openalex-snapshot
SPASS & FLOTTER version 0.42
inferredcites →https://doi.org/10.1007/3-540-63104-6_7openalex-snapshot
Integration of automated and interactive theorem proving in ILF
inferredcites →https://doi.org/10.1007/978-3-322-84222-0openalex-snapshot
Relative Complexities of First Order Calculi
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/bf00881919openalex-snapshot
A note on assumptions about Skolem functions
inferredcites →https://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1016/0747-7171(92)90009-sopenalex-snapshot
An optimality result for clause form translation
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(86)80028-1openalex-snapshot
A Structure-preserving Clause Form Translation
inferredcites →https://doi.org/10.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferredcites →https://doi.org/10.1145/3149.214118openalex-snapshot
On the efficiency of subsumption algorithms
inferredcites →https://doi.org/10.7939/r3nz8146jopenalex-snapshot
An Erratum for Some Errata to Automated Theorem Proving Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722086_7openalex-snapshot
MSPASS: Modal Reasoning by Translation and First-Order Resolution
inferred← citeshttps://doi.org/10.1007/11527695_15openalex-snapshot
Clause Form Conversions for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_12openalex-snapshot
Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_82openalex-snapshot
Comparing SAT Encodings for Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_12openalex-snapshot
Splitting through New Proposition Symbols
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_21openalex-snapshot
First-Order Atom Definitions Extended
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_34openalex-snapshot
System Description: Spass Version 1.0.0
inferred← citeshttps://doi.org/10.1007/978-0-387-34347-1_13openalex-snapshot
Resolution Based Explanations for Reasoning in the Description Logic ALC
inferred← citeshttps://doi.org/10.1007/978-3-030-58790-1_12openalex-snapshot
From Discourse to Logic with Stanford CoreNLP and Treebank Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-79942-7_3openalex-snapshot
Knowledge Acquisition from Natural Language with Treebank Semantics and $$\mathcal{F}\textsc {lora}$$-2
inferred← citeshttps://doi.org/10.1007/978-3-031-60878-0_10openalex-snapshot
Dot-to-Dot Semantic Representation
inferred← citeshttps://doi.org/10.1007/978-3-319-11271-8_11openalex-snapshot
A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-23392-5_17openalex-snapshot
On the Deduction Problem in Gödel and Product Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_25openalex-snapshot
Effective Normalization Techniques for HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-48506-5_13openalex-snapshot
Expanding Gödel Logic with Truth Constants and the Equality, Strict Order, Delta Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-99283-9_10openalex-snapshot
Hyperresolution for Propositional Product Logic with Truth Constants
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_3openalex-snapshot
Mechanised Reasoning and Model Generation for Extended Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_36openalex-snapshot
The CADE ATP System Competition
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_38openalex-snapshot
System Description: Spass Version 3.0
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_18openalex-snapshot
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-27534-0_14openalex-snapshot
On the Satisfiability and Validity Problems in the Propositional Gödel Logic
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_18openalex-snapshot
Automated Theorem Proving in High-Quality Software Design
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_11openalex-snapshot
Deduction-Based Software Component Retrieval
inferred← citeshttps://doi.org/10.1007/s10009-022-00682-yopenalex-snapshot
SMT solving for the validation of B and Event-B models
inferred← citeshttps://doi.org/10.1007/s10601-008-9055-yopenalex-snapshot
A solver for QBFs in negation normal form
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50007-2openalex-snapshot
Normal Form Transformations
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50008-4openalex-snapshot
Computing Small Clause Normal Forms
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferred← citeshttps://doi.org/10.1016/j.fss.2007.10.001openalex-snapshot
Binary resolution over complete residuated Stone lattices
inferred← citeshttps://doi.org/10.1016/j.fss.2018.09.008openalex-snapshot
Hyperresolution for Gödel logic with truth constants
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.005openalex-snapshot
Mechanising first-order temporal resolution
inferred← citeshttps://doi.org/10.1016/j.jal.2007.07.003openalex-snapshot
Efficiently checking propositional refutations in HOL theorem provers
inferred← citeshttps://doi.org/10.1023/a:1006285423991openalex-snapshot
The CADE-15 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1006393501098openalex-snapshot
The CADE-16 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1011917032470openalex-snapshot
An Algorithm for Dual Transformation in First-Order Logic
inferred← citeshttps://doi.org/10.1108/17427370710863112openalex-snapshot
SCAFOS: linking sensor data to context‐aware applications using abstract events
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2007.00310.xopenalex-snapshot
Using Patterns to Explain Inferences in
inferred← citeshttps://doi.org/10.1142/s0218488524500296openalex-snapshot
A DPLL Procedure with Dichotomous Branching for Propositional Product Logic
inferred← citeshttps://doi.org/10.1145/3551349.3556938openalex-snapshot
Tseitin or not Tseitin? The Impact of CNF Transformations on Feature-Model Analyses
inferred← citeshttps://doi.org/10.22028/d291-25703openalex-snapshot
Resolution-based decision procedures for subclasses of first-order logic
inferred← citeshttps://doi.org/10.31219/osf.io/kb6g8openalex-snapshot
Automated Deduction in Propositional Product Logic
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.3390/math12233805openalex-snapshot
A Proof Calculus for Automated Deduction in Propositional Product Logic
inferred← citeshttps://doi.org/10.48456/tr-620openalex-snapshot
Middleware support for context-awareness in distributed sensor-driven systems
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
inferred← citeshttps://doi.org/10.70675/3a17c566z3288z4b15z8333ze08d71d24d7aopenalex-snapshot
Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq
inferred← citeshttps://doi.org/10.70675/986030f6z24bbz4abfzba76z5d465c669cacopenalex-snapshot
Évaluation de la fiabilité des systèmes modélisés par arbres de défaillances grâce aux techniques de satisfiabilité
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.