A preliminary approach towards a logic for warrant

Autores
Gómez, Sergio Alejandro; Simari, Guillermo Ricardo
Año de publicación
2014
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
XV Workshop de Agentes y Sistemas Inteligentes
Red de Universidades con Carreras de Informática (RedUNCI)
Materia
Ciencias Informáticas
defeasible logic programming
argumentation
artificial intelligence
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/42422
Acceder
id SEDICI_6b3a8550e68269d1d4049f627c581d2a
oai_identifier_str oai:sedici.unlp.edu.ar:10915/42422
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A preliminary approach towards a logic for warrantGómez, Sergio AlejandroSimari, Guillermo RicardoCiencias Informáticasdefeasible logic programmingargumentationartificial intelligenceWe 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.XV Workshop de Agentes y Sistemas InteligentesRed de Universidades con Carreras de Informática (RedUNCI)2014-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/42422enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:01:23Zoai:sedici.unlp.edu.ar:10915/42422Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:01:24.151SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A preliminary approach towards a logic for warrant
title A preliminary approach towards a logic for warrant
spellingShingle A preliminary approach towards a logic for warrant
Gómez, Sergio Alejandro
Ciencias Informáticas
defeasible logic programming
argumentation
artificial intelligence
title_short A preliminary approach towards a logic for warrant
title_full A preliminary approach towards a logic for warrant
title_fullStr A preliminary approach towards a logic for warrant
title_full_unstemmed A preliminary approach towards a logic for warrant
title_sort A preliminary approach towards a logic for warrant
dc.creator.none.fl_str_mv Gómez, Sergio Alejandro
Simari, Guillermo Ricardo
author Gómez, Sergio Alejandro
author_facet Gómez, Sergio Alejandro
Simari, Guillermo Ricardo
author_role author
author2 Simari, Guillermo Ricardo
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
defeasible logic programming
argumentation
artificial intelligence
topic Ciencias Informáticas
defeasible logic programming
argumentation
artificial intelligence
dc.description.none.fl_txt_mv 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.
XV Workshop de Agentes y Sistemas Inteligentes
Red de Universidades con Carreras de Informática (RedUNCI)
description 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.
publishDate 2014
dc.date.none.fl_str_mv 2014-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/42422
url http://sedici.unlp.edu.ar/handle/10915/42422
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615880616443904
score 13.070432

Publicaciones similares