Cited in
(25)- Logic for Programming, Artificial Intelligence, and Reasoning
- Ceres in intuitionistic logic
- A tableaux-based decision procedure for multi-parameter propositional schemata
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
- Reducing redundancy in cut-elimination by resolution
- Extension without cut
- On the form of witness terms
- CERES: An analysis of Fürstenberg's proof of the infinity of primes
- System description: GAPT 2.0
- Schematic refutations of formula schemata
- Proof Transformation by CERES
- Understanding Resolution Proofs through Herbrand’s Theorem
- Extraction of expansion trees
- Shred
- GAPT
- ProofTool
- Scavenger
- Describing proofs by short tautologies
- Schematic cut elimination and the ordered pigeonhole principle
- Herbrand-confluence
- A Clausal Approach to Proof Analysis in Second-Order Logic
- Complexity of translations from resolution to sequent calculus
- System Description: The Proof Transformation System CERES
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
- CERES in higher-order logic
This page was built for software: CERES
