/barrelfish-master/usr/eclipseclp/Opium/demo/ |
H A D | expert_system.pl | 16 fact:Goal. label 30 fact: sheba gives milk. label 31 fact: sheba eats meat. label
|
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | project.pl | 23 % fact one usually wants just the keys or just the values, but you can 29 % (In fact this operation is msort/2 and should be available somewhere.)
|
H A D | trees.pl | 96 % In fact this routine is perfectly happy constructing either tree given
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | umsterm.tex | 96 \index{fact} 98 A fact or {\it unit clause} is a term of the form: 105 A fact may be considered to be a rule whose body is always {\it true}. 184 i.e. a compound term with the functor {\it :-/2}, or only a fact.
|
H A D | prolog.tex | 482 The simplest form of a clause is the {\em fact}. 488 Syntactically, a fact is just a structure (or an atom) 510 Note that a fact is equivalent to a clause where the body is {\tt true}: 543 % In fact, syntactically, the {\tt ':-'} and {\tt ','} used in 775 %Partial data structures are in fact a very 819 %and the append can be encoded with a simple fact: 1016 %clause (rule or fact) & if statement / one arm of nondeterministic case
|
H A D | eplex.tex | 415 solver setup. In fact it can be imposed anytime before 444 variables in the list. \Note{In fact, with the integer 461 In this case, \verb'A1' and \verb'A2' are now integers. In fact, notice 467 inform the external solver to treat those variables as integers (in fact
|
H A D | programanalysis.tex | 147 executing the goal. In fact in the above example the profiler was
|
H A D | hybrid.tex | 420 fact counter-productive for variables that will be explicitly labelled 489 In fact in this simple example we gain nothing by including the {\tt 735 In fact the {\tt eplex} solver is performing domain propagation, just
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsterm.tex | 189 \item[Fact\index{fact}] 190 A fact or \aboutidx{unit clause}\index{clause!unit} is a term of the form: 198 A fact may be considered to be a rule whose body is always \about{true}. 308 (i.e., a compound term with the functor \predspec{:-/2}), or only a fact.
|
H A D | umsstring.tex | 142 If used like this, an atom is in fact {\em indivisible} and there should
|
H A D | extsuspend.tex | 136 However, when we already have all variables available, we can in fact 328 As a matter of fact, it does not matter if we put the new
|
H A D | umsintro.tex | 286 %%when a fact {\it p(a)} exists, the goal
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/ |
H A D | puzzle_bool.pl | 39 boolean expression (and in fact is so by SICStus Prolog's bool:sat) and in L
|
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | icsymbolic.tex | 130 (and are in fact implemented via) their counterparts in
|
H A D | introduction.tex | 41 In fact the simplest implementation of any constraint is to suspend it
|
H A D | ic.tex | 462 variable when it is in fact the term \texttt{+(X1,+(X2,+(...)))} 994 This reflects the fact that the variable's ranges could possibly 996 It also reflects he fact that 1184 Records the fact that the named event has happened. 1240 Note that the lower bound of X is still five despite the fact that X
|
/barrelfish-master/usr/eclipseclp/documents/mpslib/ |
H A D | eclipse.tex | 36 is not constant. The latter is caused by the fact that personal
|
/barrelfish-master/lib/openssl-1.0.0d/util/ |
H A D | mkerr.pl | 63 fact if any error or function codes have been added/removed.
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | kb.pl | 505 % fact 845 % fact 1543 % fact 1553 % fact 2262 % fact
|
H A D | heaps.pl | 180 just a merge sort, where we can exploit the fact that the tops
|
/barrelfish-master/doc/008-tracing/ |
H A D | Tracing.tex | 204 the fact that it solves a very similar task. 418 arise come from the fact that it is possible that Bfscope flushes in the middle 518 analyzing the network stack, the fact that memory has been allocated (a single 767 inside of Barrelfish; This stems from the fact that if you do not want to
|
/barrelfish-master/usr/skb/programs/ |
H A D | bridge_fake_bigfish.pl | 15 % fact the same version of bigfish. It does so by evaluating a few
|
H A D | irq_routing_new.pl | 45 % This fact links the hpet_comp controller labels with the hpet_comp facts 652 % queries the hpet_comp fact to determine which are useable
|
/barrelfish-master/lib/tommath/ |
H A D | tommath.tex | 169 When we think of long-hand arithmetic such as addition or multiplication we rarely consider the fact that we instinctively 214 various cryptographic journals, can render algorithms such as RSA and Diffie-Hellman more efficient. In fact, several 228 In fact the library discussed within this text has already been used to form a polynomial basis library\footnote{See \url{http://poly.libtomcrypt.org} for more details.}. 262 the fact that the two integer inputs may be of differing magnitudes. As a result the implementation is not as simple 1058 will not contribute to the precision of the result. In fact, through subsequent operations more leading zero digits would 1197 fact the alias for $b$ is carried through into the second ``for'' loop to clear the excess digits. This optimization 2056 an algorithm despite the fact it arises often in other algorithms. The algorithm is setup much like the lower level algorithm s\_mp\_add since 2398 algorithm benefits from the fact that in twos complement arithmetic $a \mbox{ (mod }2^b\mbox{)}$ is the same as $a$ AND $2^b - 1$. 2485 The importance of the multiplier algorithms is for the most part driven by the fact that certain popular public key algorithms are based on modular 2698 $241 \cdot 576$ is in fact [all...] |
/barrelfish-master/usr/eclipseclp/documents/megalog/ |
H A D | multiuser-sec.tex | 282 therefore recovery is unnecessary. In actual fact temporary relations
|