Intelligent Systems Lab, Sicstus Prolog User's Manual, SICS, Kista, Sweden, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....cation. In contrast with the generate and test implementation, Boolean values are now substituted by a term V alue ListOfGates, and the gates behaviors is as described above. To implement the set operations, we resorted to the ordsets library for operations over sorted lists of SICStus Prolog [15]. Of all the approaches in this paper, it turns out that this is the most ecient one. This is as expected, since with this approach only one pass in the circuit is needed to extract the information needed to compute all the faults for all the output vectors. This method can be extended to handle ....

Programming Systems Group of the Swedish Institute of Computer Science. Sicstus prolog user's manual, 1995.

....uni cation. In contrast with the generate and test implementation, Boolean values are now substituted by a term V alue ListOfGates, and the gates behaviors is as described above. To implement the set operations, we resorted to the ordsets library for operations over sorted lists of SICStus Prolog [14]. Of all the approaches in this paper, it turns out that this is the most ecient one. This is as expected, since with this approach only one pass in the circuit is needed to extract the information needed to compute all the faults for all the output vectors. This method can be extended to handle ....

Programming Systems Group of the Swedish Institute of Computer Science. Sicstus prolog user's manual, 1995.

.... logic, we addressed the problem of differential diagnosis of digital circuits with a 0 1 Boolean solver (the extra 6 values were propagated to the output, by analogy with the demons approach taken in [6] but with choice points to cope with the different possibilities) implemented in SICStus [11]. The basic constraints not , and (with an arbitrary number of inputs) and xor were modelled as user defined constraints and the others (e.g. or and nand ) modelled in terms of the basic ones. To implement the solver, not only was necessary to adapt the truth tables of the usual Boolean ....

Programming Systems Group of the Swedish Institute of Computer Science. SICStus Prolog User's Manual, 1995.

....with local search both before and during search. 14 Chapter 3 Implementation The solver is divided into two parts: the algorithms which implement the search and a library that handles the representation of constraints. Both the algorithms and the library are implemented in SICStus Prolog [13]. 3.1 The library The library handles representation of constraints, variables and domains and consistency validation functions needed by the algorithms. The constraint language that the library handles is described in Appendix A and derives from Beologic salesPLUS. 3.1.1 Representation ....

Programming Systems Group. SICStus Prolog User's Manual. SICS, 1995.

....define the identifiers through which their attributes can be accessed. Thus the instances of a class share a common structure. The attributes themselves, however, are mutable and thus not shared among the instances. Some object oriented languages such as CLOS, Objective Caml and SICStus Objects [SIC96] allow to define initial values of attributes such that instances share attributes at creation time, while other languages such as Smalltalk, C and Java leave initialization up to initialization methods which are called constructors in C and Java. Attributes can change over time. Sometimes ....

Intelligent Systems Laboratory, SICS, PO Box 1263, 164 28 Kista, Sweden. SICStus Prolog User's Manual, Release 3 #5, October 1996.

....to verify existing programs, and to assist in writing new programs. As a byproduct, we also show how programs can be proven to be free from occur check and floundering. 1 Introduction Delay declarations are provided in several logic programming languages to allow for more user defined control [7, 8, 18] as opposed to the standard left to right selection rule. An atom in a query is selected for resolution only if its arguments are instantiated to a specified degree. In this paper we present a method of ensuring termination of programs with delay declarations. As far as possible, we translate the ....

....approach than generating multiple versions of each predicate [18] is an ongoing discussion [6] b) The block declarations declare that certain arguments of an atom must be non variable before that atom can be selected. Insufficiently instantiated atoms are delayed. As demonstrated in SICStus [8], block declarations can be efficiently implemented; the test whether the arguments are non variable has negligible impact on performance. Termination clearly depends on the instantiation of the arguments of the query. For example, the append predicate has infinitely many answers when called with ....

[Article contains additional citation context not shown here]

Intelligent Systems Laboratory, SICS, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User's Manual, 1997. http://www.sics.se/isl/sicstus/sicstus toc.html.

....for built ins can be omitted completely; and proving termination. For all of the above, we show that under realistic assumptions, block declarations, which declare that certain arguments of an atom must be at least non variable before that atom can be selected, are sufficient. In SICStus [2], block declarations are efficiently implemented; the instantiation test has hardly any impact on performance. Thus such constructs are the most frequently used delay declarations in practice. For arithmetic built ins, we exploit that for numbers, being non variable implies being ground, and show ....

....exploits that a program does not use any speculative bindings, by ensuring that no atom ever delays. In this latter case, any method for showing termination for programs without delay declarations can be applied. 2 Preliminaries We use the notation of [1, 3] For the examples we use SICStus [2] notation. We recall some important notions. A syntactic object is called linear if every variable occurs in it at most University of Kent at Canterbury, Canterbury, CT2 7NF, United Kingdom, j.g.smaus ukc.ac.uk, telephone xx44 1227 827553, fax xx44 1227 762811. y Jan Georg Smaus was ....

Intelligent Systems Laboratory, SICS, PO Box 1263, S-164 28 Kista, Sweden. SICStus Prolog User's Manual, 1995.

No context found.

Intelligent Systems Laboratory. SICStus Prolog User's Manual. PO Box 1263, SE-164 29 Kista, Sweden, October 2003.

....crucial in obtaining a correct and efficient program. In recent years, one of the most popular ways of defining control is via suspension mechanisms which delay the selection of an atom in a goal until some condition is satisfied. Such mechanisms include the block declarations of SICStus Prolog [7] and the DELAY declarations of Godel [6] These mechanisms are used to define dynamic selection rules with the two main aims of enhancing performance through coroutining and ensuring termination. In practise, however, these two aims are not complementary and it is often the case that termination, ....

....due to unification and the calculation of the depth bound, but these costs could be minimised through careful implementation. We have naively implemented and tested some sample programs and some of the preliminary results are given below. The experiments have been carried out in SICStus Prolog [7] on a Sparc 4. Program Goal Length Time(s) for P [fGg Time(s) for sdr(P ) fGg P G of list L one solution all solutions one solution all solutions 8 queens qn( 0.4 6.8 0.3 5.3 permsort ps(L, 10 6.8 1 0.7 0.7 permsort ps( L) 8 1.7 10.5 2.6 10.8 quicksort qs(L, 4000 3.7 4.5 4.8 6.0 ....

Intelligent Systems Laboratory, SICS, PO Box 1263, S-164 28 Kista, Sweden. SICStus Prolog User's Manual, 1995.

No context found.

Intelligent Systems Lab, Sicstus Prolog User's Manual, SICS, Kista, Sweden, 2002.

No context found.

Intelligent Systems Laboratory, SICS, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User's Manual, 1997. http://www.sics.se/isl/sicstus/sicstus toc.html.

No context found.

Intelligent Systems Laboratory. SICStus Prolog User's Manual. PO Box 1263, SE-164 29 Kista, Sweden, October 2003.

No context found.

Intelligent Systems Laboratory, Swedish Institute of Computer Science. (Oct 1996) SICStus Prolog User's Manual. URL: http://www.sics.se/isl/sicstus/sicstus toc.html

No context found.

Intelligent Systems Laboratory (1995), SICStus Prolog User's Manual, SICS.

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