A Prototype Theorem Prover

In this chapter we present a prototype implementation of the systems \(\mathrm{ SC} _{\mathcal{ ALC} }\) and \(\mathrm{ SC} _{\mathcal{ ALCQ} }\). We choose to implement the Sequent Calculi because they represent a first step towards a ND implementations. The prototype theorem prover was implemented in Maude (Clavel et al. (2009) Maude manual (version 2.4). Technical Report, SRI International). So in Sect. 8.1 we present the Maude System and language and in Sect. 8.2 we describe the prototype implementation.

[1]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[2]  Alberto Verdejo,et al.  Deduction, Strategies, and Rewriting , 2007, STRATEGIES@IJCAR.