Diferencia entre revisiones de «A formally verified proof in PVS of the strong completeness theorem of propositional SLD-resolution»
| Línea 10: | Línea 10: | ||
|- | |- | ||
| '''Description:''' | | '''Description:''' | ||
| − | | This theory presents a proof in PVS of the Strong Completeness of SLD | + | | This theory presents a proof in PVS of the Strong Completeness of SLD-Resolution for the propositional logic. We have formalized the propositional logic programming and we have proof the equivalence between the differents semantics of the logic programs. We also transform the previous specifications of Propositional Logic into their respective executable specifications by using refinements. Finally, we verify several refutation algorithms based on breadth search, depth search and depth iterative search. |
|- | |- | ||
| '''Code:''' | | '''Code:''' | ||
Revisión del 12:30 2 jun 2010
| Title: | A formally verified proof in PVS of the strong completeness theorem of propositional SLD-resolution. |
| Authors: | José A. Alonso, María J. Hidalgo, Francisco J. Martín y José L. Ruiz Reina. |
| Date: | 2001-2003. |
| Description: | This theory presents a proof in PVS of the Strong Completeness of SLD-Resolution for the propositional logic. We have formalized the propositional logic programming and we have proof the equivalence between the differents semantics of the logic programs. We also transform the previous specifications of Propositional Logic into their respective executable specifications by using refinements. Finally, we verify several refutation algorithms based on breadth search, depth search and depth iterative search. |
| Code: | You can find the PVS theories in ... |
| Documentation: | Papers and documents related with this work: |
