An abstract machine for the execution of DeLP programs

Autores
Stankevicius, Alejandro G.; García, Alejandro Javier
Año de publicación
2004
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
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/22505

id SEDICI_4ace4a8756a3b3b69f7affb63779b720
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22505
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling An abstract machine for the execution of DeLP programsStankevicius, Alejandro G.García, Alejandro JavierCiencias InformáticasARTIFICIAL INTELLIGENCEIntelligent agentsknowledge representation and reasoningdefeasible argumentationabstract machinesDefeasible 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.Eje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI)2004info: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/22505enginfo: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-10-15T10:47:42Zoai:sedici.unlp.edu.ar:10915/22505Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:47:42.935SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv An abstract machine for the execution of DeLP programs
title An abstract machine for the execution of DeLP programs
spellingShingle An abstract machine for the execution of DeLP programs
Stankevicius, Alejandro G.
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
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 An abstract machine for the execution of DeLP programs
dc.creator.none.fl_str_mv Stankevicius, Alejandro G.
García, Alejandro Javier
author Stankevicius, Alejandro G.
author_facet Stankevicius, Alejandro G.
García, Alejandro Javier
author_role author
author2 García, Alejandro Javier
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
topic Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
knowledge representation and reasoning
defeasible argumentation
abstract machines
dc.description.none.fl_txt_mv 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.
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2004
dc.date.none.fl_str_mv 2004
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/22505
url http://sedici.unlp.edu.ar/handle/10915/22505
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_ 1846063903389253632
score 13.22299