Efficient negation using abstract interpretation
Data(s) |
2001
|
---|---|
Resumo |
While negation has been a very active área of research in logic programming, comparatively few papers have been devoted to implementation issues. Furthermore, the negation-related capabilities of current Prolog systems are limited. We recently presented a novel method for incorporating negation in a Prolog compiler which takes a number of existing methods (some modified and improved by us) and uses them in a combined fashion. The method makes use of information provided by a global analysis of the source code. Our previous work focused on the systematic description of the techniques and the reasoning about correctness and completeness of the method, but provided no experimental evidence to evalúate the proposal. In this paper, we report on an implementation, using the Ciao Prolog system preprocessor, and provide experimental data which indicates that the method is not only feasible but also quite promising from the efficiency point of view. In addition, the tests have provided new insight as to how to improve the proposal further. Abstract interpretation techniques are shown to offer important improvements in this application. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
eng |
Publicador |
Facultad de Informática (UPM) |
Relação |
http://oa.upm.es/14377/1/HERME_ARC_2001-1.pdf http://link.springer.com/chapter/10.1007%2F3-540-45653-8_33?LI=true |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
Logic for Programming, Artificial Intelligence, and Reasoning | 8th International Conference, LPAR 2001 | December 3-7, 2001 | Havana, Cuba |
Palavras-Chave | #Informática |
Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |