Bruno Woltzenlogel Paleo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bruno Woltzenlogel Paleo has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- John Slaney
Australian National University
2 shared publications Daniyar Itegulov
ITMO University
1 shared publication- Giselle Reis
Carnegie Mellon University, Doha, Qatar
1 shared publication John Slaney
Australian National University
1 shared publication
Latest Publications
- 16 January 2019
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 29 (8) , 1061-1091
Complexity of translations from resolution to sequent calculus
Resolution and sequent calculus are two well-known formal proof systems. Their differences make them suitable for distinct tasks. Resolution and its variants are very efficient for automated reasoning and are in fact the theoretical basis of many theorem provers. However, being intentionally machine oriented, the resolution calculus is not as natural for human beings and the input problem needs to be pre-processed to clause normal form. Sequent calculus, on the other hand, is a modular formalism that is useful for analysing meta-properties of various logics and is, therefore, popular among proof theorists. The input problem does not need to be pre-processed, and proofs are more detailed. However, proofs also tend to be larger and more verbose. When the worlds of proof theory and automated theorem proving meet, translations between resolution and sequent calculus are often necessary. In this paper, we compare three translation methods and analyse their complexity.
- 16 January 2019
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 29 (8) , 1061-1091
Complexity of translations from resolution to sequent calculus
Resolution and sequent calculus are two well-known formal proof systems. Their differences make them suitable for distinct tasks. Resolution and its variants are very efficient for automated reasoning and are in fact the theoretical basis of many theorem provers. However, being intentionally machine oriented, the resolution calculus is not as natural for human beings and the input problem needs to be pre-processed to clause normal form. Sequent calculus, on the other hand, is a modular formalism that is useful for analysing meta-properties of various logics and is, therefore, popular among proof theorists. The input problem does not need to be pre-processed, and proofs are more detailed. However, proofs also tend to be larger and more verbose. When the worlds of proof theory and automated theorem proving meet, translations between resolution and sequent calculus are often necessary. In this paper, we compare three translation methods and analyse their complexity.
- 14 October 2018
- Published by Springer Nature
- p. 139-158
Para-Disagreement Logics and Their Implementation Through Embedding in Coq and SMT
- 14 October 2018
- Published by Springer Nature
- p. 139-158
Para-Disagreement Logics and Their Implementation Through Embedding in Coq and SMT
- 25 September 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 60 (4) , 527
Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
- 25 September 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 60 (4) , 527
Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
- 11 July 2017
- Published by Springer Nature
- p. 344-356
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
- 11 July 2017
- Published by Springer Nature
- p. 344-356
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
- 24 February 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 60 (2) , 133-156
Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
- 24 February 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 60 (2) , 133-156
Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
- 28 June 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 314-324
Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic
- 28 June 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 314-324
Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic