A preliminary approach towards a logic for warrant

We extend Defeasible Logic Programming for it to be able to warrant complex logical formulas. We show how negation, conjunction, disjunction and implication of ground literals can be tested for warrant. We show a running scenario to test the suitability of the approach.

Guardado en:
Detalles Bibliográficos
Autores principales: Gómez, Sergio Alejandro, Simari, Guillermo Ricardo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2014
Materias:
Ciencias Informáticas
defeasible logic programming
argumentation
artificial intelligence
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/42422
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
Descripción
Sumario:We extend Defeasible Logic Programming for it to be able to warrant complex logical formulas. We show how negation, conjunction, disjunction and implication of ground literals can be tested for warrant. We show a running scenario to test the suitability of the approach.

Ejemplares similares