Diferencia entre revisiones de «A formally verified prover for the ALC description logic (in PVS)»

De WikiGLC
Saltar a: navegación, buscar
Línea 15: Línea 15:
 
|-
 
|-
 
| '''Code:'''  
 
| '''Code:'''  
| You can find the PVS theories [http://www.cs.us.es/~mjoseh/pub/alc.tgz here].
+
| You can find the PVS theories
 +
* [http://www.cs.us.es/~mjoseh/pub/TeoriasPVS/Version_PVS-3.2/alc.tgz Version PVS-3.2].
 +
* [http://www.cs.us.es/~mjoseh/pub/TeoriasPVS/Version_PVS-4.2/alc.tgz Version PVS-4.2].
 
|-
 
|-
 
| '''Documentation:'''
 
| '''Documentation:'''

Revisión del 12:12 7 oct 2010

Title: A formally verified prover for the ALC description logic.
Authors: José A. Alonso, María J. Hidalgo, Francisco J. Martín and José L. Ruiz Reina.
Date: 2005-2007
Description: The developed work consist of two phases:
  1. A PVS specification of a prover for the ALC description logic, as well as the proofs of its termination, soundness and completeness. We use the previous formalization of the well--foundedness of the multiset relation induced by a well-founded relation to prove the termination and the completeness of the ALC prover.
  2. The construction of a formally verified generic tableau-based algorithm for checking satisfiability of ALC-concepts, from the previous generic framework. We do it using a methodology of refinements to transfer the properties from the framework to the algorithm. We also obtain some verified reasoners from the algorithm by a process of instantiation.
Code: You can find the PVS theories
Documentation: Papers and reports related with this work: