Wielemaker, J. SWI-Prolog Reference Manual. University of Amsterdam, The Netherlands, http://www.swi.psy.uva.nl/usr/jan/SWI-Prolog/Manual/Title.html, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
AQL: an Alignment Based Language for Querying String.. - Grahne, Hakli, Nykänen.. (1998) (Correct)
....version of the parts of the program simulating the automata and measuring the execution time using di#erent predicates and input strings. It turned out that the automaton based simulation of Alignment Declarations was slightly faster than evaluating the predicates in compiled SWI Prolog [29], encoding strings as Prolog lists. In general, the e#ciency of the string predicates in AQL correspond to brute force pattern matching. The main benefits of AQL lie in its simplicity compared to embedded programming languages, and its expressive power well beyond the LIKE operator of SQL and ....
Wielemaker, J. SWI-Prolog Reference Manual. University of Amsterdam, The Netherlands, http://www.swi.psy.uva.nl/usr/jan/SWI-Prolog/Manual/Title.html, 1997.
A Concurrent Logic Programming Model of the Web - Davison, al. (1998) (4 citations) (Correct)
....isd 4 builds the isdown command string with the built in concat atom 2 and invokes it as a process using open 3. Unfortunately, this latter feature is not available in any concurrent LP language we examined, and so we were forced to test this code in SWI Prolog, version 2.1. 0 [14]. get chars 3 incrementally reads in isdown s output and passes it to get result 3 which pulls off the terminating result value and converts it to a more informative Result term. set stop 3 is: mode setstop( setstop( ok, setstop( err( setstop(stop, StopFile) ....
J. Wielemaker, SWI-Prolog Reference Manual, Dept. of Social Science Informatics (SWI), Amsterdam, The Netherlands, 1998. Available at ftp://swi.psy.uva.nl/pub/SWI-Prolog/.
AQL: an Alignment Based Language for Querying String.. - Grahne, Hakli, Nykänen.. (1998) (Correct)
....version of the parts of the program simulating the automata and measuring the execution time using different predicates and input strings. It turned out that the automaton based simulation of Alignment Declarations was slightly faster than evaluating the predicates in compiled SWI Prolog [29], encoding strings as Prolog lists. In general, the efficiency of the string predicates in AQL correspond to brute force pattern matching. The main benefits of AQL lie in its simplicity compared to embedded programming languages, and its expressive power well beyond the LIKE operator of SQL and ....
Wielemaker, J. SWI-Prolog Reference Manual. University of Amsterdam, The Netherlands, http://www.swi.psy.uva.nl/usr/jan/SWI-Prolog/Manual/Title.html, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC