Strong properties of circumscriptive logic programming
Dix [7, 5, 6] introduced a method for classifying semantics of normal logic programs. Some of these properties, called strong properties, are adaptations of properties from general nommonotonic theories. We apply this technique to circumscriptive logic programs [8, 9], an extension of traditional lo...
Guardado en:
| Autores principales: | Fillottrani, Pablo Rubén, Simari, Guillermo Ricardo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
1996
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24202 |
| Aporte de: |
Ejemplares similares
-
Weak properties of circumscriptive logic programming
por: Fillottrani, Pablo Rubén, et al.
Publicado: (1997) -
Logical properties in defeasible logic programming -a preliminary report
por: Stankevicius, Alejandro G., et al.
Publicado: (2002) -
Representing generalization relationships in logic programming
por: Fillottrani, Pablo Rubén
Publicado: (2002) -
Ontology merging using belief revision and defeasible logic programming
por: Gómez, Sergio Alejandro, et al.
Publicado: (2012) -
A preliminary approach towards a logic for warrant
por: Gómez, Sergio Alejandro, et al.
Publicado: (2014)