Switch to: References

Add citations

You must login to add citations.
  1. The Higher-Order Prover LEO-II.Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson & Frank Theiß - 2015 - Journal of Automated Reasoning 55 (4):389-404.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Recent Successes with a Meta-Logical Approach to Universal Logical Reasoning.Benzmüller Christoph - 2017 - In Christoph Benzmüller (ed.), Lecture Notes in Computer Science: Formal Methods: Foundations and Applications - 20th Brazilian Symposium SBMF 2017, Recife, Brazil, November 29 - December 1, 2017, Proceedings. Springer. pp. 7-11.
    The quest for a most general framework supporting universal reasoning is very prominently represented in the works of Leibniz. He envisioned a scientia generalis founded on a characteristica universalis, that is, a most universal formal language in which all knowledge about the world and the sciences can be encoded. A quick study of the survey literature on logical formalisms suggests that quite the opposite to Leibniz’ dream has become reality. Instead of a characteristica universalis, we are today facing a very (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Universal Reasoning, Rational Argumentation and Human-Machine Interaction.Benzmüller Christoph - 2017
    Classical higher-order logic, when utilized as a meta-logic in which various other logics can be shallowly embedded, is well suited for realising a universal logic reasoning approach. Universal logic reasoning in turn, as envisioned already by Leibniz, may support the rigorous formalisation and deep logical analysis of rational arguments within machines. A respective universal logic reasoning framework is described and a range of exemplary applications are discussed. In the future, universal logic reasoning in combination with appropriate, controlled forms of rational (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.
    A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be payed to cut-simulation, which may render cut-elimination as a pointless criterion.
    Download  
     
    Export citation  
     
    Bookmark   4 citations