Matrix proof method in annotated paraconsistent logic
The matrix connection method (MCM) is an alternative procedure for theorem proving than the usual resolution technique. We already have used the MCM for finding models in a real-time knowledge-based system generator. In this paper, we adapt the MCM to the particular case of sorne annotated propositi...
Guardado en:
| Autor principal: | Kaestner, Celso A. A. |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
1995
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24320 |
| Aporte de: |
Ejemplares similares
-
Residuated lattices as an algebraic semantics for paraconsistent nelson's logic
por: Busaniche, M., et al. -
Residuated lattices as an algebraic semantics for paraconsistent nelson's logic
por: Busaniche, Manuela
Publicado: (2009) -
Effective prover for minimal inconsistency logic
por: Neto, Adolfo Gustavo Serra Seca, et al.
Publicado: (2006) -
Paraconsistent logic consistency, contradiction and negation /
por: Carnielli, Walter A. (Walter Alexandre)
Publicado: (2016) -
Logical properties in defeasible logic programming -a preliminary report
por: Stankevicius, Alejandro G., et al.
Publicado: (2002)