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:
| Autores principales: | Gómez, Sergio Alejandro, Simari, Guillermo Ricardo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/42422 |
| Aporte de: |
Ejemplares similares
-
An approach for an algebra applied to a defeasible logic programming
por: Budán, Maximiliano Celmo David, et al.
Publicado: (2012) -
Logical properties in defeasible logic programming -a preliminary report
por: Stankevicius, Alejandro G., et al.
Publicado: (2002) -
An approach to handling inconsistent ontology definitions based on the translation of description logics into defeasible logic programming
por: Gómez, Sergio Alejandro, et al.
Publicado: (2006) -
Modelling derivation in defeasible logic programming with perceptron-based neural networks
por: Gómez, Sergio Alejandro
Publicado: (2004) -
Parallel defeasible argumentation
por: García, Alejandro Javier, et al.
Publicado: (2000)