Busque entre los 156529 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-02T12:38:11Z | |
dc.date.available | 2012-11-02T12:38:11Z | |
dc.date.issued | 1999-10 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/23508 | |
dc.description.abstract | The objective of this paper is to study a practical approach to deal with non-termination in de nite clause grammars. We focus on two problems, loop and cyclic structure detection and representation, maintaining a tight balance between practical e ciency and operational completeness. In order to guarantee the validity of our conclusions, we rst map our study to a common situated framework, where the e ectiveness of each approach will be examined and, later, compared by running experiments. | en |
dc.language | en | es |
dc.subject | Control structures | es |
dc.subject | Definite Clause Grammars | en |
dc.subject | Cyclic Derivations | en |
dc.subject | Cyclic Structures | en |
dc.title | Dealing with non-termination in DCGs | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Vilares Ferro, M. | es |
sedici.creator.person | Cabrero Souto, D. | es |
sedici.creator.person | Alonso Pardo, M.A. | es |
sedici.description.note | Eje: Teoría | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2001-10 | |
sedici.relation.event | V Congreso Argentino de Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |