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

De WikiGLC
Saltar a: navegación, buscar
Línea 18: Línea 18:
 
|-
 
|-
 
| '''Documentation:'''
 
| '''Documentation:'''
| [http://www.cs.us.es/~mjoseh/pub/Proving_termination_with_multiset_orderings_in_PVS.pdf Proving termination with multiset orderings in PVS: theory, methodology and applications]
+
| Papers and reports related with this work:
 +
* [http://www.cs.us.es/~jalonso/publicaciones/2007-TPHOLs.pdf A formally verified prover for the ALC description logic].
 +
* [http://www.cs.us.es/~jalonso/publicaciones/2007-TPHOLs.pdf A formally verified prover for the ALC description logic].
 +
* [http://www.cs.us.es/~jalonso/publicaciones/2007-TPHOLs.pdf A formally verified prover for the ALC description logic].
 
|}
 
|}

Revisión del 11:02 2 jun 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. This theory is 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. In this theory we develop 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 in ...
Documentation: Papers and reports related with this work: