On the public citation graph

Automated deduction - CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings

0 signed · 145 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11425274_19openalex-snapshot
Duality in Knowledge Compilation Techniques
inferred← citeshttps://doi.org/10.1007/11524564_5openalex-snapshot
Applications of Description Logics: State of the Art and Research Challenges
inferred← citeshttps://doi.org/10.1007/11527695_5openalex-snapshot
Resolve and Expand
inferred← citeshttps://doi.org/10.1007/11548133_24openalex-snapshot
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing
inferred← citeshttps://doi.org/10.1007/11554554_17openalex-snapshot
The Space Efficiency of OSHL
inferred← citeshttps://doi.org/10.1007/11559306_9openalex-snapshot
An Efficient Decision Procedure for UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/11591191_17openalex-snapshot
Recursive Path Orderings Can Also Be Incremental
inferred← citeshttps://doi.org/10.1007/11591191_24openalex-snapshot
Monotone AC-Tree Automata
inferred← citeshttps://doi.org/10.1007/11618027_1openalex-snapshot
A Proof-Theoretic Approach to Hierarchical Math Library Organization
inferred← citeshttps://doi.org/10.1007/11618027_2openalex-snapshot
An Exploration in the Space of Mathematical Knowledge
inferred← citeshttps://doi.org/10.1007/11618027_6openalex-snapshot
A Tough Nut for Mathematical Knowledge Management
inferred← citeshttps://doi.org/10.1007/11618027_9openalex-snapshot
A Generic Modular Data Structure for Proof Attempts Alternating on Ideas and Granularity
inferred← citeshttps://doi.org/10.1007/11757283_6openalex-snapshot
Building Efficient Decision Procedures on Top of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11805618_5openalex-snapshot
Propositional Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_25openalex-snapshot
Proof Development with ΩMEGA: √2 Is Irrational
inferred← citeshttps://doi.org/10.1007/978-3-319-00293-4_25openalex-snapshot
A Tableau Method with Optimal Complexity for Deciding the Description Logic SHIQ
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_12openalex-snapshot
Verifying Livelock Freedom on Parameterized Rings and Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_4openalex-snapshot
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_6openalex-snapshot
A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata
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-24730-2_27openalex-snapshot
Automatic Verification of Time Sensitive Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_36openalex-snapshot
Liveness with Incomprehensible Ranking
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_12openalex-snapshot
Using Automated Theorem Provers to Certify Auto-generated Aerospace Software
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_13openalex-snapshot
argo-lib: A Generic Platform for Decision Procedures
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-25984-8_4openalex-snapshot
Improved Modular Termination Proofs Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_5openalex-snapshot
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_6openalex-snapshot
Redundancy Notions for Paramodulation with Non-monotonic Orderings
inferred← citeshttps://doi.org/10.1007/978-3-540-27769-9_13openalex-snapshot
Exploring Relational Structures Via ${\mathcal{F\!LE}}$
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_1openalex-snapshot
Termination by Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_13openalex-snapshot
CPoint: Dissolving the Author’s Dilemma
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_16openalex-snapshot
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_8openalex-snapshot
Classifying Differential Equations on the Web
inferred← citeshttps://doi.org/10.1007/978-3-540-28633-2_7openalex-snapshot
Answer Set Computation Based on a Minimal Model Generation Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_18openalex-snapshot
Verification by Network Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_11openalex-snapshot
A General Theorem on Termination of Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_36openalex-snapshot
Unsound Theorem Proving
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-30221-6_2openalex-snapshot
Ωmega: Computer Supported Mathematics
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-30476-0_42openalex-snapshot
Synthesis of State Feedback Controllers for Parameterized Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30482-1_32openalex-snapshot
Verifying a File System Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_3openalex-snapshot
Orderings for Innermost Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_33openalex-snapshot
Proof-Producing Congruence Closure
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_14openalex-snapshot
Description Logics as Ontology Languages for the Semantic Web
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-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_2openalex-snapshot
Some Reflections on Proof Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_20openalex-snapshot
Natural Language Proof Explanation
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_24openalex-snapshot
Formal Software Development in MAYA
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_2openalex-snapshot
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_27openalex-snapshot
Can a Higher-Order and a First-Order Theorem Prover Cooperate?
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_11openalex-snapshot
Improving Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_2openalex-snapshot
Disproving False Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_5openalex-snapshot
Congruence Closure with Integer Offsets
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_12openalex-snapshot
A Tableau Algorithm for Reasoning about Concepts and Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_9openalex-snapshot
Verification of the Redecoration Algorithm for Triangular Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_22openalex-snapshot
Symmetry and Completeness in the Analysis of Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_44openalex-snapshot
Validating High-Level Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_10openalex-snapshot
Combining Equational Tree Automata over AC and ACI Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_4openalex-snapshot
Finer Is Better: Abstraction Refinement for Rewriting Approximations
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_16openalex-snapshot
The Complexity of Conjunctive Query Answering in Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_43openalex-snapshot
Certifying a Tree Automata Completion Checker
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_5openalex-snapshot
On Automating the Calculus of Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_12openalex-snapshot
Generalized Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-540-72586-2_160openalex-snapshot
Description Logic Representation for Requirement Specification
inferred← citeshttps://doi.org/10.1007/978-3-540-72982-2_12openalex-snapshot
$\mathcal{ALC}^{u}_{\mathbb{P}}$ : An Integration of Description Logic and General Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-73086-6_26openalex-snapshot
Alternative Aggregates in Mizar
inferred← citeshttps://doi.org/10.1007/978-3-540-73086-6_6openalex-snapshot
Biform Theories in Chiron
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_2openalex-snapshot
Orderings and Constraints: Theory and Practice of Proving Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_28openalex-snapshot
Integrating Verification, Testing, and Learning for Cryptographic Protocols
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_18openalex-snapshot
Handling Polymorphism in Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_20openalex-snapshot
SRASS - A Semantic Relevance Axiom Selection System
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_6openalex-snapshot
Optimized Reasoning in Description Logics Using Hypertableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_4openalex-snapshot
TPTP, TSTP, CASC, etc.
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_39openalex-snapshot
ATP Cross-Verification of the Mizar MPTP Challenge Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76298-0_33openalex-snapshot
Instance Migration in Heterogeneous Ontology Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_40openalex-snapshot
Verifying Parameterized taDOM+ Lock Managers
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_22openalex-snapshot
A Space-Efficient Probabilistic Simulation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-87891-9_10openalex-snapshot
Model Checking of Control-User Component-Based Parametrised Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-89737-8_2openalex-snapshot
On Automated Testing of Description Logic Reasoners
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_38openalex-snapshot
Rigid Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-01907-4_15openalex-snapshot
Composing Modular Ontologies with Distributed Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02138-1_4openalex-snapshot
Verification of Parameterized Systems with Combinations of Abstract Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-02614-0_28openalex-snapshot
Spreadsheet Interaction with Frames: Exploring a Mathematical Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_6openalex-snapshot
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_4openalex-snapshot
Combining Equational Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-04277-5_47openalex-snapshot
Connectionist Models for Formal Knowledge Adaptation
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_9openalex-snapshot
How to Tackle Integer Weighted Automata Positivity
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_29openalex-snapshot
Algorithmic Verification with Multiple and Nested Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-13977-2_4openalex-snapshot
Testing First-Order Logic Axioms in Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_25openalex-snapshot
A Decidable Class of Nested Iterated Schemata
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_9openalex-snapshot
Sledgehammer: Judgement Day
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_55openalex-snapshot
Dynamic Cutoff Detection in Parameterized Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-15034-0_2openalex-snapshot
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_22openalex-snapshot
Automated Multiparameterised Verification by Cut-Offs
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_35openalex-snapshot
On Symmetries and Spotlights – Verifying Parameterised Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-17358-5_3openalex-snapshot
Artifact-Centric Choreographies
inferred← citeshttps://doi.org/10.1007/978-3-642-17796-5_2openalex-snapshot
Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_14openalex-snapshot
The OpenTheory Standard Theory Library
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_8openalex-snapshot
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_9openalex-snapshot
πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_51openalex-snapshot
A More Efficient BDD-Based QBF Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_8openalex-snapshot
Characterizing Conclusive Approximations by Logical Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_2openalex-snapshot
Automatic Proof and Disproof in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_13openalex-snapshot
Modular SMT Proofs for Fast Reflexive Checking Inside Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-27534-0_11openalex-snapshot
A Fuzzy Logic Based Approach to Expressing and Reasoning with Uncertain Knowledge on the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_2openalex-snapshot
Security Protocol Verification: Symbolic and Computational Models
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_4openalex-snapshot
Parametric Verification of Address Space Separation
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_20openalex-snapshot
Rewriting Approximations for Properties Verification over CCS Specifications
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-29485-3_9openalex-snapshot
Nuprl as Logical Framework for Automating Proofs in Category Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_20openalex-snapshot
Rewriting Induction + Linear Arithmetic = Decision Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_25openalex-snapshot
From Linear Temporal Logic Properties to Rewrite Propositions
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_21openalex-snapshot
Nominal Completion for Rewrite Systems with Binders
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_24openalex-snapshot
More SPASS with Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_34openalex-snapshot
Efficient Checking of Link-Reversal-Based Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_12openalex-snapshot
Invariant Generation for Parametrized Systems Using Self-reflection
inferred← citeshttps://doi.org/10.1007/978-3-642-33158-9_1openalex-snapshot
Reasoning and Query Answering in Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_22openalex-snapshot
Equational Abstraction Refinement for Certified Tree Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_28openalex-snapshot
All for the Price of Few
inferred← citeshttps://doi.org/10.1007/978-3-642-35975-0_9openalex-snapshot
Storing and Querying Fuzzy Knowledge in the Semantic Web Using FiRE
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
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/978-3-642-39799-8_66openalex-snapshot
PARTY Parameterized Synthesis of Token Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_15openalex-snapshot
Understanding Resolution Proofs through Herbrand’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_16openalex-snapshot
Result Certification of Static Program Analysers with Automated Theorem Provers
inferred← citeshttps://doi.org/10.1007/s10472-009-9155-4openalex-snapshot
A new methodology for developing deduction methods
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.artint.2013.07.006openalex-snapshot
Complexity issues related to propagation completeness
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103519openalex-snapshot
Paracoherent answer set computation
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.013openalex-snapshot
Mechanising the Alphabetised Relational Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.068openalex-snapshot
Justifying Equality
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.011openalex-snapshot
Translation of resolution proofs into short first-order proofs without choice axioms
inferred← citeshttps://doi.org/10.1016/j.ic.2016.04.002openalex-snapshot
A space-efficient simulation algorithm on probabilistic automata
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.06.005openalex-snapshot
Symbol different term rewrite systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.026openalex-snapshot
Parameterized model checking of networks of timed automata with Boolean guards
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00132-6openalex-snapshot
Abstracting cryptographic protocols with tree automata
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00023-3openalex-snapshot
Computer proofs about finite and regular sets: the unifying concept of subvariance
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00034-8openalex-snapshot
Hyperresolution for guarded formulae
inferred← citeshttps://doi.org/10.1017/s0960129511000156openalex-snapshot
A pluralist approach to the formalisation of mathematics
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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.