Konstatinos F. Sagonas, Terrance Swift, and David S. Warren. The XSB Programmer's Manual. Version 1.3 (fi). Department of Computer Science, SUNY @ Stony Brook, U.S.A., September 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The following examples illustrate actual behavior that contradicts intuition a loop that should not terminate terminates, while a loop that should terminate does not. We checked the behavior of these examples on UNIX, with the CLP(Q,R) library [18] of SICStus Prolog [31] CLP(R) 19] and XSB [30]. General Framework for Automatic Termination Analysis 25 Example 6.2 Consider the following program. The goal p(1.0) terminates although we would expect it not to terminate. On the other hand the goal q(1.0) does not terminate, although we would expect it to terminate. p(0:0) Gamma : p(X) ....

Konstatinos F. Sagonas, Terrance Swift, and David S. Warren. The XSB Programmer's Manual. Version 1.3 (fi). Department of Computer Science, SUNY @ Stony Brook, U.S.A., September 1993.

....illustrate actual behavior that contradicts intuition of general numerical loops a loop that should not terminate terminates, while a loop that should terminate does not. We checked the behavior of these examples on UNIX, with the CLP(Q,R) library [18] of SICStus Prolog [30] CLP(R) 19] and XSB [29]. 4 Example 3.3 Consider the following program. The goal p(1.0) terminates although we would expect it not to terminate. On the other hand the goal q(1.0) does not terminate, although we would expect it to terminate. p(0:0) Gamma : p(X) Gamma X1 is X=2; p(X1) q(0:0) Gamma : q(X) ....

K. F. Sagonas, T. Swift, and D. S. Warren. The XSB Programmer's Manual. Version 1.3 (fi). Department of Computer Science, SUNY @ Stony Brook, U.S.A., September 1993.

....language. We show that logic programming systems can be as efficient as imperative Research supported by CNPq and Capes, Brasilian Research Councils 1 systems for a wide range of symbolic and scientific applications. We used different prolog based systems, including SICStus Prolog [6] XSB [22], Yap [7] CLP(R) 14] and Aurora [18] and compared to C, a structured language. We focus our studies on programmability, execution times and memory utilisation and show that the use of techniques such as compilation, code specialisation, tabling, constraints and parallelization can improve the ....

Konstantinos F. Sagonas, Terrance Swift, David S. Warren, Juliana Freire, and Prasad Rao. The XSB Programmer's Manual, version 1.8. Technical report, Department of Computer Science, SUNY at Stony Brook, 1998.

....because no variant goals subgoals occur in the derivation. An important fact is that for function free logic programs, in nite loops can be completely avoided by appealing to tabling techniques [4,6,21,22,25,27,28] However, in nite loops with functions remain unresolved even in tabling systems [16]. To our best knowledge, among all existing loop checking mechanisms only two can deal with in nite loops like L 2 . One is called OS check (for OverSize loop check) 17] and the other EVA check (for Extended Variant Atoms loop check) 20] Bruynooghe, De schreye and Martens [5,13,14] presents a ....

K. Sagonas, T. Swift, D. S. Warren, J. Freire and P. Rao, The XSB Programmer's Manual (Version 1.8), Department of Computer Science, SUNY at Stony Brook, 1998. Available from http://www.cs.sunysb.edu/ sbprolog/xsbpage. html.

....illustrate actual behavior that contradicts intuition of general numerical loops a loop that should not terminate terminates, while a loop that should terminate does not. We checked the behavior of these examples on UNIX, with the CLP(Q,R) library [17] of SICStus Prolog [28] CLP(R) 18] and XSB [27]. Example 3.3 Consider the following program. The goal p(1.0) terminates although we would expect it not to terminate. On the other hand the goal q(1.0) does not terminate, although we would expect it to terminate. p(0:0) Gamma : p(X) Gamma X1 is X=2; p(X1) q(0:0) Gamma : q(X) ....

K. F. Sagonas, T. Swift, and D. S. Warren. The XSB Programmer's Manual. Version 1.3 (fi). Department of Computer Science, SUNY @ Stony Brook, U.S.A., September 1993.

....since it allows bottom up evaluation to be incorporated within a top down framework, combining the advantages of both. Although the concept of tabled evaluation of logic programs has been around for a decade (see [8, 9] practical systems based on tabling are only beginning to appear (e.g. [6, 5, 10]) Early experience with these systems suggest that they are indeed practically viable. In particular the XSB system, based on SLG resolution [1] computes in memory deductive database queries about an order of magnitude faster than current semi naive methods, and computes Prolog queries with ....

....improving performance remain to be explored. Efficient organization and manipulation of tables is one such avenue and forms the topic of this paper. When a tabled subgoal is called, a check for the presence of this subgoal in the table is done first. In currently available tabling systems (e.g. [6, 5]) this is done by checking whether a variant of the new goal already exists in the table. We say that two terms t 1 and t 2 are variants of each other if they are identical up to renaming of their variables. Although a variant check is a light weight operation computationally, tabling systems ....

K. Sagonas, T. Swift, and D.S. Warren. The XSB programmer's manual, Version 1.4.2. Technical report, Department of Computer Science, SUNY, Stony Brook, 1995.

No context found.

K. Sagonas, T. Swift, D.S. Warren, J. Freire, and P. Rao. The XSB programmer's manual. Technical report, Department of Computer Science, State University of New York at Stony Brook, 1997. Available at http://www.cs.sunysb.edu/~sbprolog.

No context found.

K. Sagonas, T. Swift, D.S. Warren, J. Freire, and P. Rao. The XSB programmer's manual. Technical report, Department of Computer Science, State University of New York at Stony Brook, 1997. Available at http://www.cs.sunysb.edu/sbprolog.

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