Busque entre los 167371 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-16T14:36:16Z | |
dc.date.available | 2012-11-16T14:36:16Z | |
dc.date.issued | 1995-10 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/24320 | |
dc.description.abstract | 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 propositional paraconsistent logics. Further developments related to these ideas are also outlined. | en |
dc.format.extent | 416-425 | es |
dc.language | en | es |
dc.subject | Paraconsistent Logics | es |
dc.subject | ARTIFICIAL INTELLIGENCE | es |
dc.subject | Annotated Logics | en |
dc.subject | Thcorem Proving | en |
dc.subject | Matrix Connection Method | en |
dc.title | Matrix proof method in annotated paraconsistent logic | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Kaestner, Celso A. A. | es |
sedici.description.note | Eje: 2do. Workshop sobre aspectos teóricos de la inteligencia artificial | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 1995-10 | |
sedici.relation.event | I Congreso Argentino de Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |