Filters








4,634 Hits in 4.1 sec

Efficient Groundness Analysis in Prolog [article]

Jacob M. Howe, Andy King
2002 arXiv   pre-print
In this paper, a variety of issues pertaining to the efficient Prolog implementation of groundness analysis are investigated, focusing on the domain of definite Boolean functions, Def.  ...  The analysis can be implemented straightforwardly in Prolog and the use of a non-ground representation results in an efficient, scalable tool which does not require widening to be invoked, even on the  ...  The paper also explains how Prolog can be used to implement a particularly efficient Def -based groundness analysis.  ... 
arXiv:cs/0201012v1 fatcat:guqmyamo6za6rclc54dy2vvgiu

Efficient groundness analysis in Prolog

JACOB M. HOWE, ANDY KING
2002 Theory and Practice of Logic Programming  
This is the published version of the paper. This version of the publication may differ from the final published version. Permanent repository link: http://openaccess.city.ac.uk/1701/ Link to published version: http://dx.
doi:10.1017/s1471068402001485 fatcat:g2jknlpwfzbqbhu3wiw5nix6hi

Global flow analysis as a practical compilation tool

M.V Hermenegildo, R Warren, S.K Debray
1992 The Journal of Logic Programming  
mode inference system developed for SB-Prolog.  ...  This paper addresses the issue of the practicality of global flow analysis in logic program compilation, in terms of speed of the analysis, precision, and usefulness of the information obtained.  ...  used on the various Prolog stacks during the analysis of that path can be reclaimed relatively efficiently.  ... 
doi:10.1016/0743-1066(92)90053-6 fatcat:6tqrbunei5apln74ve3k6k25dm

Efficient Negation Using Abstract Interpretation [chapter]

Susana Muñoz, Juan José Moreno, Manuel Hermenegildo
2001 Lecture Notes in Computer Science  
the efficiency point of view.  ...  The method makes use of information provided by a global analysis of the source code.  ...  In particular, from the analysis point of view, the groundness analysis has been performed using the domain and algorithms described in [14] .  ... 
doi:10.1007/3-540-45653-8_33 fatcat:aqy2qqujtnawzpfbu2kemo4gcm

Analyzing logic programs using "prop"-ositional logic programs and a magic wand

Michael Codish, Bart Demoen
1995 The Journal of Logic Programming  
The main contribution is in the ease in which a highly efficient implementation of the analysis is obtained.  ...  We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain Prop.  ...  In this paper, we describe an efficient and simple implementation of a semantic-based groundness analysis for logic programs. The analysis we implement is not new.  ... 
doi:10.1016/0743-1066(95)00064-x fatcat:bo76kcttpfejncilrxj5uqsbyy

Efficient Data Structures for Inductive Logic Programming [chapter]

Nuno Fonseca, Ricardo Rocha, Rui Camacho, Fernando Silva
2003 Lecture Notes in Computer Science  
The work presented in this paper has been partially supported by project APRIL (Project POSI/SRI/40749/2001) and funds granted to LIACC through the Programa de Financiamento Plurianual, Fundação para a  ...  shows that in the prolog module the number of calls increased only for the assert, recorda, numbervars, copy term, and ground predicates.  ...  On the other hand, ILP is a non-classical Prolog application because it uses large sets of ground facts and requires storing a large search tree.  ... 
doi:10.1007/978-3-540-39917-9_10 fatcat:jobfcmnplfhldhuxk7bdkko2mm

Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules

Henning Christiansen
2009 Journal of Applied Logic  
Abduction with integrity constraints is one example of hypothesis-based reasoning which can be implemented directly in Prolog and CHR with a straightforward use of available and efficiently implemented  ...  Substitutions, grounding and renaming substitutions are defined as usual.  ...  high efficiency. • A straightforward meta-interpreter implementation of abductive logic programs with ground abducibles.  ... 
doi:10.1016/j.jal.2008.10.004 fatcat:vci2qqbucjawdje55gc6cxw2ge

Experimental Evaluation of a Caching Technique for ILP [chapter]

Nuno Fonseca, Vitor Santos Costa, Fernando Silva, Rui Camacho
2003 Lecture Notes in Computer Science  
The work presented in this paper has been partially supported by project APRIL (Project POSI/SRI/40749/2001) and funds granted to LIACC through the Programa de Financiamento Plurianual, Fundação para a  ...  shows that in the prolog module the number of calls increased only for the assert, recorda, numbervars, copy term, and ground predicates.  ...  On the other hand, ILP is a non-classical Prolog application because it uses large sets of ground facts and requires storing a large search tree.  ... 
doi:10.1007/978-3-540-24580-3_22 fatcat:5azqjbucbrb5lkuzg3qbdy47iu

Declarative programming for verification

Michael Leuschel
2008 Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08  
More precisely, we present insights gained and lessons learned while implementing animators and model checkers in Prolog for various specification languages, ranging from process algebras such as CSP to  ...  In summary, the co-routines allowed a much more straightforward and still efficient translation of the operational semantics rules into Prolog.  ...  To model the functional aspect of CSP-M, we have mainly used the non-ground representation [34, 21] , i.e., representing a variable in the CSP-M specification by a Prolog variable.  ... 
doi:10.1145/1389449.1389450 dblp:conf/ppdp/Leuschel08 fatcat:f55xkcbjaral7lytcr6odnmsee

Source-to-source optimizing transformations of Prolog programs based on abstract interpretation [article]

Francois Gobert, Baudouin Le Charlier
2007 arXiv   pre-print
The way a Prolog code is written - e.g., the order of clauses, the order of literals in a clause, the use of cuts or negations - influences its efficiency.  ...  Making a Prolog program more efficient by transforming its source code, without changing its operational semantics, is not an obvious task.  ...  In the second specification, input X is a ground term, T is any term, and TEff is a ground list.  ... 
arXiv:0710.5895v1 fatcat:ah2w4udym5dk5kh5n7kjpzzpei

Prolog for Verification, Analysis and Transformation Tools

Michael Leuschel
2020 Electronic Proceedings in Theoretical Computer Science  
This article examines the use of the Prolog language for writing verification, analysis and transformation tools.  ...  The article shows the usefulness of a few key Prolog features. In particular, it discusses how to deal with negation at the level of the object programs being verified or analysed.  ...  There are still a few aspects of verification and analysis which are difficult to implement efficiently in Prolog.  ... 
doi:10.4204/eptcs.320.6 fatcat:4ptzbt4pyfcirbfq6r7luzt6uq

Efficient Tabling of Structured Data Using Indexing and Program Transformation [chapter]

Christian Theil Have, Henning Christiansen
2012 Lecture Notes in Computer Science  
General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications  ...  of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain. • You may freely distribute the URL identifying the publication in  ...  This work is supported by the project "Logic-statistic modelling and analysis of biological sequence data" funded by the NABIIT program under the Danish Strategic Research Council.  ... 
doi:10.1007/978-3-642-27694-1_8 fatcat:pjzjxjwd3vczbm7mqxxowb2gwm

Analyzing logic programs with dynamic scheduling

Kim Marriott, María José García de la Banda, Manuel Hermenegildo
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
arguments are sufRciently instantiated to allow the cali to run efficiently.  ...  Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule.  ...  The tests where performed with Sicstus Prolog 2.1, which is an efficient implementation of Prolog with a rich set of suspensión primitives.  ... 
doi:10.1145/174675.177883 dblp:conf/popl/MarriottBH94 fatcat:gdj52htaonchjikjnwneoa2i6u

XSB: A system for efficiently computing well-founded semantics [chapter]

Prasad Rao, Konstantinos Sagonas, Terrance Swift, David S. Warren, Juliana Freire
1997 Lecture Notes in Computer Science  
The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB [19] .  ...  Performance results indicate that the overhead of delay and simplification to Prolog --or tabled --evaluations is minimal.  ...  A detailed analysis of the performance of XSB can be found in [18] .  ... 
doi:10.1007/3-540-63255-7_33 fatcat:7iin72b67rfd3e3r6enjgi7ix4

The Succinct Solver Suite [chapter]

Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl
2004 Lecture Notes in Computer Science  
The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic.  ...  A number of transformation strategies, mainly automatic, have been studied aiming on the one hand to increase the efficiency of the solving process, and on the other hand to increase the ease with which  ...  Experiments with our analysis of Discretionary Ambients [5] have shown that reordering of conjuncts in preconditions may significantly improve the efficiency of solving otherwise identical clauses.  ... 
doi:10.1007/978-3-540-24730-2_21 fatcat:73akyuongrdz5gjba3xm53j44u
« Previous Showing results 1 — 15 out of 4,634 results