On the public citation graph

Refutational theorem proving for hierarchic first-order theories

https://doi.org/10.1007/bf01190829

0 signed · 106 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.1007/3-540-10856-4_85openalex-snapshot

On the power of algebraic specifications

inferredcites →https://doi.org/10.1007/3-540-52885-7_105openalex-snapshot

On restrictions of ordered paramodulation with simplification

inferredcites →https://doi.org/10.1007/3-540-52885-7_87openalex-snapshot

A resolution principle for clauses with constraints

inferredcites →https://doi.org/10.1007/3-540-53904-2_95openalex-snapshot

Proofs in parameterized specifications

inferredcites →https://doi.org/10.1007/3-540-55034-8openalex-snapshot

A Resolution Principle for a Logic with Restricted Quantifiers

inferredcites →https://doi.org/10.1007/978-94-009-6259-0_4openalex-snapshot

Correspondence Theory

inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot

Automated deduction by theory resolution

inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot

Algebraic Specification

inferredcites →https://doi.org/10.1016/s0076-5392(08)62322-xopenalex-snapshot

1 Elements of Mathematical Logic

inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot

Rewrite-based Equational Theorem Proving with Selection and Simplification

inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot

Constraint logic programming

inferredcites →https://doi.org/10.2307/2314853openalex-snapshot

Elements of Mathematical Logic.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.2002.0536openalex-snapshot

Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)

inferred← citeshttps://doi.org/10.1007/11916277_34openalex-snapshot

Theory Instantiation

inferred← citeshttps://doi.org/10.1007/3-540-48242-3_9openalex-snapshot

Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups

inferred← citeshttps://doi.org/10.1007/3-540-60381-6_1openalex-snapshot

Associative-commutative superposition

inferred← citeshttps://doi.org/10.1007/3-540-61511-3_102openalex-snapshot

Theorem proving in cancellative abelian monoids (extended abstract)

inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_2openalex-snapshot

Hierarchic Superposition Revisited

inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_23openalex-snapshot

On Invariant Synthesis for Parametric Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_9openalex-snapshot

Model Completeness, Covers and Superposition

inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_18openalex-snapshot

A Comprehensive Framework for Saturation Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_23openalex-snapshot

Deciding the Bernays-Schoenfinkel Fragment over Bounded Difference Constraints by Simple Clause Learning over Theories

inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_9openalex-snapshot

Making Theory Reasoning Simpler

inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_1openalex-snapshot

A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_3openalex-snapshot

Symbol Elimination and Applications to Parametric Entailment Problems

inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_27openalex-snapshot

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_10openalex-snapshot

An Efficient Subsumption Test Pipeline for BS(LRA) Clauses

inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_8openalex-snapshot

Symbolic Model Construction for Saturated Constrained Horn Clauses

inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_27openalex-snapshot

Computing Witnesses Using the SCAN Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_2openalex-snapshot

Completeness of Synthesis Under Realizability Assumptions Using Superposition

inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_11openalex-snapshot

Finite Quantification in Hierarchic Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_46openalex-snapshot

AVATAR: The Architecture for First-Order Theorem Provers

inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_14openalex-snapshot

Extensional Crisis and Proving Identity

inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_25openalex-snapshot

Beagle – A Hierarchic Superposition Theorem Prover

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_8openalex-snapshot

On First-Order Model-Based Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-319-25007-6_34openalex-snapshot

Concept Forgetting in $$\mathcal {ALCOI}$$-Ontologies Using an Ackermann Approach

inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_22openalex-snapshot

Predicate Elimination for Preprocessing in First-Order Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_6openalex-snapshot

On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_14openalex-snapshot

The Bernays–Schönfinkel–Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable

inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_1openalex-snapshot

Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_10openalex-snapshot

Modular Proof Systems for Partial Functions with Weak Equality

inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_15openalex-snapshot

Superposition Modulo a Shostak Theory

inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_19openalex-snapshot

Integrating Linear Arithmetic into Superposition Calculus

inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_26openalex-snapshot

An Extension of the Knuth-Bendix Ordering with LPO-Like Properties

inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_31openalex-snapshot

Improved Second-Order Quantifier Elimination in Modal Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_19openalex-snapshot

(LIA) - Model Evolution with Linear Integer Arithmetic Constraints

inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_2openalex-snapshot

Superposition and Model Evolution Combined

inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_5openalex-snapshot

Superposition Modulo Linear Arithmetic SUP(LA)

inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_6openalex-snapshot

Instantiation of SMT Problems Modulo Integers

inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8openalex-snapshot

Logic for Programming, Artificial Intelligence, and Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_22openalex-snapshot

Superposition-Based Analysis of First-Order Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_9openalex-snapshot

Model Evolution with Equality Modulo Built-in Theories

inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_9openalex-snapshot

Superposition Modulo Non-linear Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_17openalex-snapshot

Automatic Generation of Invariants for Circular Derivations in SUP(LA)

inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_28openalex-snapshot

E-Matching with Free Variables

inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_32openalex-snapshot

The TPTP Typed First-Order Form with Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_17openalex-snapshot

A Calculus for Generating Ground Explanations

inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_4openalex-snapshot

Superposition for Bounded Domains

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_15openalex-snapshot

First-Order Resolution Methods for Modal Logics

inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_3openalex-snapshot

Hierarchic Superposition with Weak Abstraction

inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_4openalex-snapshot

Completeness and Decidability Results for First-Order Clauses with Indices

inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_2openalex-snapshot

Combining Superposition and Induction: A Practical Realization

inferred← citeshttps://doi.org/10.1007/bfb0014420openalex-snapshot

Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings

inferred← citeshttps://doi.org/10.1007/bfb0016860openalex-snapshot

Buchberger's algorithm: A constraint-based completion procedure

inferred← citeshttps://doi.org/10.1007/bfb0034801openalex-snapshot

Labelled theorem proving for substructural logics

inferred← citeshttps://doi.org/10.1007/s004500050042openalex-snapshot

Theorembeweisen in hierarchischen bedingten Spezifikationen

inferred← citeshttps://doi.org/10.1007/s10817-010-9214-xopenalex-snapshot

A Combined Superposition and Model Evolution Calculus

inferred← citeshttps://doi.org/10.1007/s10817-015-9344-2openalex-snapshot

A Superposition Calculus for Abductive Reasoning

inferred← citeshttps://doi.org/10.1007/s10817-019-09519-xopenalex-snapshot

Combining Induction and Saturation-Based Theorem Proving

inferred← citeshttps://doi.org/10.1007/s10817-019-09533-zopenalex-snapshot

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice

inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot

Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates

inferred← citeshttps://doi.org/10.1007/s10817-021-09596-xopenalex-snapshot

Model Completeness, Uniform Interpolants and Superposition Calculus

inferred← citeshttps://doi.org/10.1007/s10817-022-09617-3openalex-snapshot

A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column

inferred← citeshttps://doi.org/10.1007/s10817-022-09621-7openalex-snapshot

A Comprehensive Framework for Saturation Theorem Proving

inferred← citeshttps://doi.org/10.1007/s10817-022-09628-0openalex-snapshot

Set of Support, Demodulation, Paramodulation: A Historical Perspective

inferred← citeshttps://doi.org/10.1007/s11786-012-0134-5openalex-snapshot

Superposition as a Decision Procedure for Timed Automata

inferred← citeshttps://doi.org/10.1007/s11786-012-0135-4openalex-snapshot

Superposition Decides the First-Order Logic Fragment Over Ground Theories

inferred← citeshttps://doi.org/10.1016/j.ic.2005.10.002openalex-snapshot

Modular proof systems for partial functions with Evans equality

inferred← citeshttps://doi.org/10.1016/j.jal.2012.01.001openalex-snapshot

The Ackermann approach for modal logic, correspondence theory and second-order reduction

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.jsc.2019.07.021openalex-snapshot

A complete and terminating approach to linear integer solving

inferred← citeshttps://doi.org/10.1109/lics.2019.8785784openalex-snapshot

HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470527openalex-snapshot

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses

inferred← citeshttps://doi.org/10.1109/mis.2013.124openalex-snapshot

Model Evolution-Based Theorem Proving

inferred← citeshttps://doi.org/10.1109/tpami.2022.3140382openalex-snapshot

Learning to Guide a Saturation-Based Theorem Prover

inferred← citeshttps://doi.org/10.1145/2480759.2480763openalex-snapshot

Instantiation Schemes for Nested Theories

inferred← citeshttps://doi.org/10.1145/3437992.3439912openalex-snapshot

A modular Isabelle framework for verifying saturation provers

inferred← citeshttps://doi.org/10.1145/3779416openalex-snapshot

An Abstract Fixed-Point Theorem for Horn Formula Equations

inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16780openalex-snapshot

A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving

inferred← citeshttps://doi.org/10.1613/jair.5481openalex-snapshot

Prime Implicate Generation in Equational Logic

inferred← citeshttps://doi.org/10.17077/etd.qktdxyneopenalex-snapshot

Evolving model evolution

inferred← citeshttps://doi.org/10.22028/d291-25942openalex-snapshot

Superposition and decision procedures back and forth

inferred← citeshttps://doi.org/10.22028/d291-26547openalex-snapshot

Superposition modulo theory

inferred← citeshttps://doi.org/10.29007/k6tpopenalex-snapshot

AVATAR Modulo Theories

inferred← citeshttps://doi.org/10.29007/ndjgopenalex-snapshot

Set of Support for Theory Reasoning

inferred← citeshttps://doi.org/10.29007/sj4lopenalex-snapshot

Automatic Bit- and Memory-Precise Verification of eBPF Code

inferred← citeshttps://doi.org/10.29007/vpxmopenalex-snapshot

Do Portfolio Solvers Harm?

inferred← citeshttps://doi.org/10.29007/w9vgopenalex-snapshot

Hierarchic Superposition Revisited

inferred← citeshttps://doi.org/10.3233/fi-2013-855openalex-snapshot

A Resolution Calculus for First-order Schemata

inferred← citeshttps://doi.org/10.3390/info13120578openalex-snapshot

Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion, and Transfer Axioms under Simple Transformations

inferred← citeshttps://doi.org/10.48550/arxiv.1201.5954openalex-snapshot

A Calculus for Generating Ground Explanations (Technical Report)

inferred← citeshttps://doi.org/10.48550/arxiv.1501.07209openalex-snapshot

Bernays-Schoenfinkel-Ramsey with Simple Bounds is NEXPTIME-complete

inferred← citeshttps://doi.org/10.48550/arxiv.1806.09686openalex-snapshot

Quantifier Elimination for Database Driven Verification

inferred← citeshttps://doi.org/10.48550/arxiv.1904.03776openalex-snapshot

Hierarchic Superposition Revisited

inferred← citeshttps://doi.org/10.48550/arxiv.2107.02333openalex-snapshot

Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)

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.