A reduction-based theorem prover for 3-valued logic
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
A reduction-based theorem prover for 3-valued logic
|
| Id. |
44778839 |
| Idioma |
eng
|
| Titulo |
A reduction-based theorem prover for 3-valued logic |
| Autor(es) |
Aguilera Venegas, G.
Ojeda Aciego, Manuel
Guzmán, I. P. de
|
| Localización |
http://dialnet.unirioja.es/servlet/oaiart?codigo=2864856
(Revista) ISSN 1134-5632
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to improve efficiency. In our opinion, this filtering is the key of the TAS methodology which, as shown in this paper, allows the method to be extremely adaptable, because switching to different kinds of logic is possible without having to redesign the whole prover.
|
| Palabras clave |
Lógica multivaluada
|
| Tipo de recurso |
text (article)
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
free |
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] Mathware & soft computing, ISSN 1134-5632, Vol. 4, Nº. 2, 1997, pags. 99-127
|
| Fecha de contribución |
24-jun-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
