An abstract machine for the execution of DeLP programs

Defeasible Logic Programming (DeLP) is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Within the field of Logic Programming, most of the implementations o...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Stankevicius, Alejandro G., García, Alejandro Javier
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2004
Materias:
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22505
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22505
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
spellingShingle Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
Stankevicius, Alejandro G.
García, Alejandro Javier
An abstract machine for the execution of DeLP programs
topic_facet Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
description Defeasible Logic Programming (DeLP) is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Within the field of Logic Programming, most of the implementations of Prolog and its variants are based on an abstract machine defined by D. Warren (nowadays known as WAM, standing for Warren’s Abstract Machine), that sits between the program and the actual hardware executing it. This separation of concerns allows the developer to focus mainly on the aspects related to the language being implemented, and not on the distinctive characteristics of the available hardware. In this paper we summarize how an abstract machine can also help in the context of DeLP, exploring the points of contact between WAM and a particular abstract machine defined for this theory called JAM.
format Objeto de conferencia
Objeto de conferencia
author Stankevicius, Alejandro G.
García, Alejandro Javier
author_facet Stankevicius, Alejandro G.
García, Alejandro Javier
author_sort Stankevicius, Alejandro G.
title An abstract machine for the execution of DeLP programs
title_short An abstract machine for the execution of DeLP programs
title_full An abstract machine for the execution of DeLP programs
title_fullStr An abstract machine for the execution of DeLP programs
title_full_unstemmed An abstract machine for the execution of DeLP programs
title_sort abstract machine for the execution of delp programs
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/22505
work_keys_str_mv AT stankeviciusalejandrog anabstractmachinefortheexecutionofdelpprograms
AT garciaalejandrojavier anabstractmachinefortheexecutionofdelpprograms
AT stankeviciusalejandrog abstractmachinefortheexecutionofdelpprograms
AT garciaalejandrojavier abstractmachinefortheexecutionofdelpprograms
bdutipo_str Repositorios
_version_ 1764820465881186307

Ejemplares similares