diogo/yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

update to recent ProbLog.

Browse Source
This commit is contained in:
Vitor Santos Costa
2011-06-26 23:13:43 +01:00
parent 8f8e62ea63
commit be345a0387
34 changed files with 9801 additions and 129 deletions
Download Patch File Download Diff File Expand all files Collapse all files

120
packages/ProbLog/problog/ad_converter.yap
View File

@@ -2,8 +2,8 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2010-12-13 18:15:14 +0100 (Mon, 13 Dec 2010) $
% $Revision: 5125 $
% $Date: 2011-04-26 15:48:52 +0200 (Tue, 26 Apr 2011) $
% $Revision: 6371 $
%
% This file is part of ProbLog
% http://dtai.cs.kuleuven.be/problog
@@ -204,24 +204,20 @@
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
:- module(ad_converter,[compile_annotated_disjunction/5,
compile_tunable_annotated_disjunction/5,
proper_annotated_disjunction/1,
proper_tunable_annotated_disjunction/1,
term_expansion_intern_ad/3,
:- module(ad_converter,[term_expansion_intern_ad/4,
op(1149, yfx, <-- ),
op( 550, yfx, :: )
]).
% general yap modules
:- use_module(library(lists),[reverse/2,member/2,append/3]).
:- use_module(library(lists),[reverse/2,member/2,memberchk/2,append/3]).
:- use_module(flags).
:- style_check(all).
:- yap_flag(unknown,error).
:- discontiguous user:ad_intern/2.
:- discontiguous user:(<--)/2, problog:(<--)/2.
:- op( 550, yfx, :: ).
@@ -230,29 +226,43 @@
:- initialization(problog_define_flag(show_ad_compilation,problog_flag_validate_boolean,'show compiled code for ADs',false,annotated_disjunctions)).
:- initialization(problog_define_flag(ad_cpl_semantics,problog_flag_validate_boolean,'use CP-logics semantics for ADs',true,annotated_disjunctions)).
:- initialization(problog_define_flag(ad_sumto1_learning,problog_flag_validate_boolean,'make p_i sum to 1 for learning',true,annotated_disjunctions)).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
term_expansion_intern_ad( (Head<--Body),Module,ad_intern((Head<--Body),ID)) :-
term_expansion_intern_ad( (Head<--Body),Module,Mode,Result) :-
problog_flag(ad_cpl_semantics,AD_CPL_Semantics),
(
proper_tunable_annotated_disjunction(Head)
->
compile_tunable_annotated_disjunction(Head,Body,Facts,Bodies,ID,AD_CPL_Semantics);
compile_tunable_annotated_disjunction(Head,Body,Facts,Bodies,ID,AD_CPL_Semantics,Mode);
(
proper_annotated_disjunction(Head),
compile_annotated_disjunction(Head,Body,Facts,Bodies,ID,AD_CPL_Semantics)
proper_annotated_disjunction(Head,Sum_of_P_in_Head)
->
compile_annotated_disjunction(Head,Body,Facts,Bodies,ID,AD_CPL_Semantics,Mode,Sum_of_P_in_Head);
throw(error(invalid_annotated_disjunction,(Head<--Body)))
)
),
forall(member(F,Facts),(once(problog:term_expansion_intern(F,Module,Atom)),
assertz(problog:Atom))),
forall(member(B,Bodies),assertz(Module:B)),
findall(problog:Atom,(
member(F,Facts),
once(problog:term_expansion_intern(F,Module,Atom))
),Result_Atoms),
(
Mode==lfi_learning
->
findall(Module:myclause(H,B),member((H:-B),Bodies),Result_Bodies);
findall(Module:B,member(B,Bodies),Result_Bodies)
),
append(Result_Atoms,Result_Bodies,Result),
problog_flag(show_ad_compilation,Show_AD_compilation),
(
Show_AD_compilation==true
->
@@ -289,7 +299,7 @@ get_next_unique_id(ID) :-
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
proper_annotated_disjunction(AD) :-
proper_annotated_disjunction(AD,Sum) :-
proper_annotated_disjunction(AD,0.0,Sum),
Sum=<1.
@@ -316,7 +326,7 @@ proper_tunable_annotated_disjunction((X;Y)) :-
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
compile_tunable_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_Semantics) :-
compile_tunable_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_Semantics,Mode) :-
get_next_unique_id(Extra_ID),
(
@@ -325,16 +335,28 @@ compile_tunable_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_S
term_variables(Body,Body_Vars);
Body_Vars=[]
),
convert_a_tunable(Head,Extra_ID,[],Facts,Body_Vars),
convert_b(Head,Body,_NewBody,Extra_ID,[],Bodies,Body_Vars),
reverse(Facts,Facts2),
convert_a_tunable(Head,Extra_ID,[],Facts0,Body_Vars),
problog_flag(ad_sumto1_learning,AD_SumTo1_Learning),
(
AD_SumTo1_Learning==true
->
Facts0=[_|Facts1];
Facts1=Facts0
),
reverse(Facts1,Facts2),
convert_b(Head,Body,_NewBody,Extra_ID,[],Bodies,Body_Vars,Mode,Facts2),
reverse(Bodies,Bodies2).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
compile_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_Semantics) :-
compile_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_Semantics,Mode,ProbSum) :-
get_next_unique_id(Extra_ID),
(
@@ -344,10 +366,20 @@ compile_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_Semantics
Body_Vars=[]
),
convert_a(Head,0.0,_Acc,Extra_ID,[],Facts,Body_Vars),
convert_b(Head,Body,_NewBody,Extra_ID,[],Bodies,Body_Vars),
convert_a(Head,0.0,_Acc,Extra_ID,[],Facts0,Body_Vars),
(
abs(ProbSum-1.0) < 0.0000001
->
Facts0=[_|Facts1];
Facts1=Facts0
),
reverse(Facts1,Facts2),
convert_b(Head,Body,_NewBody,Extra_ID,[],Bodies,Body_Vars,Mode,Facts2),
reverse(Facts,Facts2),
reverse(Bodies,Bodies2).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -365,15 +397,10 @@ convert_a(P::Atom,OldAcc,NewAcc,Extra_ID,OldFacts,[P1::ProbFact|OldFacts],Body_V
ProbFact =.. [NewAtom|NewAllArguments],
(
P=:=0
(P=:=0; OldAcc=:=0)
->
P1 is 0.0 ;
(
OldAcc=:=0
->
P1 is P;
P1 is P/(1-OldAcc)
)
P1 is min(P/(1-OldAcc),1.0)
),
NewAcc is OldAcc+P.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -382,7 +409,7 @@ convert_a(P::Atom,OldAcc,NewAcc,Extra_ID,OldFacts,[P1::ProbFact|OldFacts],Body_V
convert_a_tunable((X;Y),Extra_ID,OldFacts,Facts,Body_Vars) :-
convert_a_tunable(X,Extra_ID,OldFacts,NewFacts,Body_Vars),
convert_a_tunable(Y,Extra_ID,NewFacts,Facts,Body_Vars).
convert_a_tunable(P::Atom,Extra_ID,OldFacts,[P::ProbFact|OldFacts],Body_Vars) :-
convert_a_tunable(t(_)::Atom,Extra_ID,OldFacts,[t(_)::ProbFact|OldFacts],Body_Vars) :-
Atom =.. [Functor|AllArguments],
append(AllArguments,Body_Vars,NewAllArguments),
length(AllArguments,Arity),
@@ -393,10 +420,10 @@ convert_a_tunable(P::Atom,Extra_ID,OldFacts,[P::ProbFact|OldFacts],Body_Vars) :-
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
convert_b((X;Y),OldBody,Body,ExtraID,OldBodies,Bodies,Body_Vars) :-
convert_b(X,OldBody,NewBody,ExtraID,OldBodies,NewBodies,Body_Vars),
convert_b(Y,NewBody,Body,ExtraID,NewBodies,Bodies,Body_Vars).
convert_b(_::Atom,OldBody,NewBody,Extra_ID,OldBodies,[(Atom:-ThisBody)|OldBodies],Body_Vars) :-
convert_b((X;Y),OldBody,Body,ExtraID,OldBodies,Bodies,Body_Vars,Mode,Facts) :-
convert_b(X,OldBody,NewBody,ExtraID,OldBodies,NewBodies,Body_Vars,Mode,Facts),
convert_b(Y,NewBody,Body,ExtraID,NewBodies,Bodies,Body_Vars,Mode,Facts).
convert_b(_::Atom,OldBody,NewBody,Extra_ID,OldBodies,[(Atom:-ThisBody)|OldBodies],Body_Vars,Mode,Facts) :-
Atom =.. [Functor|AllArguments],
append(AllArguments,Body_Vars,NewAllArguments),
@@ -404,8 +431,19 @@ convert_b(_::Atom,OldBody,NewBody,Extra_ID,OldBodies,[(Atom:-ThisBody)|OldBodies
atomic_concat([mvs_fact_,Functor,'_',Arity,'_',Extra_ID],NewFunctor),
ProbFact =.. [NewFunctor|NewAllArguments],
tuple_append(OldBody,ProbFact,ThisBody),
tuple_append(OldBody,problog_not(ProbFact),NewBody).
(
memberchk(_::ProbFact,Facts)
->
tuple_append(OldBody,ProbFact,ThisBody);
ThisBody=OldBody
),
(
Mode==lfi_learning
->
tuple_append(OldBody,\+ProbFact,NewBody);
tuple_append(OldBody,problog_not(ProbFact),NewBody)
).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%

1122
packages/ProbLog/problog/completion.yap Normal file
View File

File diff suppressed because it is too large Load Diff

417
packages/ProbLog/problog/discrete.yap Normal file
View File

@@ -0,0 +1,417 @@
%%% -*- Mode: Prolog; -*-
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2010-12-02 15:20:15 +0100 (Thu, 02 Dec 2010) $
% $Revision: 5043 $
%
% This file is part of ProbLog
% http://dtai.cs.kuleuven.be/problog
%
% ProbLog was developed at Katholieke Universiteit Leuven
%
% Copyright 2009
% Angelika Kimmig, Vitor Santos Costa, Bernd Gutmann
%
% Main authors of this file:
% Bernd Gutmann
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Artistic License 2.0
%
% Copyright (c) 2000-2006, The Perl Foundation.
%
% Everyone is permitted to copy and distribute verbatim copies of this
% license document, but changing it is not allowed. Preamble
%
% This license establishes the terms under which a given free software
% Package may be copied, modified, distributed, and/or
% redistributed. The intent is that the Copyright Holder maintains some
% artistic control over the development of that Package while still
% keeping the Package available as open source and free software.
%
% You are always permitted to make arrangements wholly outside of this
% license directly with the Copyright Holder of a given Package. If the
% terms of this license do not permit the full use that you propose to
% make of the Package, you should contact the Copyright Holder and seek
% a different licensing arrangement. Definitions
%
% "Copyright Holder" means the individual(s) or organization(s) named in
% the copyright notice for the entire Package.
%
% "Contributor" means any party that has contributed code or other
% material to the Package, in accordance with the Copyright Holder's
% procedures.
%
% "You" and "your" means any person who would like to copy, distribute,
% or modify the Package.
%
% "Package" means the collection of files distributed by the Copyright
% Holder, and derivatives of that collection and/or of those files. A
% given Package may consist of either the Standard Version, or a
% Modified Version.
%
% "Distribute" means providing a copy of the Package or making it
% accessible to anyone else, or in the case of a company or
% organization, to others outside of your company or organization.
%
% "Distributor Fee" means any fee that you charge for Distributing this
% Package or providing support for this Package to another party. It
% does not mean licensing fees.
%
% "Standard Version" refers to the Package if it has not been modified,
% or has been modified only in ways explicitly requested by the
% Copyright Holder.
%
% "Modified Version" means the Package, if it has been changed, and such
% changes were not explicitly requested by the Copyright Holder.
%
% "Original License" means this Artistic License as Distributed with the
% Standard Version of the Package, in its current version or as it may
% be modified by The Perl Foundation in the future.
%
% "Source" form means the source code, documentation source, and
% configuration files for the Package.
%
% "Compiled" form means the compiled bytecode, object code, binary, or
% any other form resulting from mechanical transformation or translation
% of the Source form.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Permission for Use and Modification Without Distribution
%
% (1) You are permitted to use the Standard Version and create and use
% Modified Versions for any purpose without restriction, provided that
% you do not Distribute the Modified Version.
%
% Permissions for Redistribution of the Standard Version
%
% (2) You may Distribute verbatim copies of the Source form of the
% Standard Version of this Package in any medium without restriction,
% either gratis or for a Distributor Fee, provided that you duplicate
% all of the original copyright notices and associated disclaimers. At
% your discretion, such verbatim copies may or may not include a
% Compiled form of the Package.
%
% (3) You may apply any bug fixes, portability changes, and other
% modifications made available from the Copyright Holder. The resulting
% Package will still be considered the Standard Version, and as such
% will be subject to the Original License.
%
% Distribution of Modified Versions of the Package as Source
%
% (4) You may Distribute your Modified Version as Source (either gratis
% or for a Distributor Fee, and with or without a Compiled form of the
% Modified Version) provided that you clearly document how it differs
% from the Standard Version, including, but not limited to, documenting
% any non-standard features, executables, or modules, and provided that
% you do at least ONE of the following:
%
% (a) make the Modified Version available to the Copyright Holder of the
% Standard Version, under the Original License, so that the Copyright
% Holder may include your modifications in the Standard Version. (b)
% ensure that installation of your Modified Version does not prevent the
% user installing or running the Standard Version. In addition, the
% modified Version must bear a name that is different from the name of
% the Standard Version. (c) allow anyone who receives a copy of the
% Modified Version to make the Source form of the Modified Version
% available to others under (i) the Original License or (ii) a license
% that permits the licensee to freely copy, modify and redistribute the
% Modified Version using the same licensing terms that apply to the copy
% that the licensee received, and requires that the Source form of the
% Modified Version, and of any works derived from it, be made freely
% available in that license fees are prohibited but Distributor Fees are
% allowed.
%
% Distribution of Compiled Forms of the Standard Version or
% Modified Versions without the Source
%
% (5) You may Distribute Compiled forms of the Standard Version without
% the Source, provided that you include complete instructions on how to
% get the Source of the Standard Version. Such instructions must be
% valid at the time of your distribution. If these instructions, at any
% time while you are carrying out such distribution, become invalid, you
% must provide new instructions on demand or cease further
% distribution. If you provide valid instructions or cease distribution
% within thirty days after you become aware that the instructions are
% invalid, then you do not forfeit any of your rights under this
% license.
%
% (6) You may Distribute a Modified Version in Compiled form without the
% Source, provided that you comply with Section 4 with respect to the
% Source of the Modified Version.
%
% Aggregating or Linking the Package
%
% (7) You may aggregate the Package (either the Standard Version or
% Modified Version) with other packages and Distribute the resulting
% aggregation provided that you do not charge a licensing fee for the
% Package. Distributor Fees are permitted, and licensing fees for other
% components in the aggregation are permitted. The terms of this license
% apply to the use and Distribution of the Standard or Modified Versions
% as included in the aggregation.
%
% (8) You are permitted to link Modified and Standard Versions with
% other works, to embed the Package in a larger work of your own, or to
% build stand-alone binary or bytecode versions of applications that
% include the Package, and Distribute the result without restriction,
% provided the result does not expose a direct interface to the Package.
%
% Items That are Not Considered Part of a Modified Version
%
% (9) Works (including, but not limited to, modules and scripts) that
% merely extend or make use of the Package, do not, by themselves, cause
% the Package to be a Modified Version. In addition, such works are not
% considered parts of the Package itself, and are not subject to the
% terms of this license.
%
% General Provisions
%
% (10) Any use, modification, and distribution of the Standard or
% Modified Versions is governed by this Artistic License. By using,
% modifying or distributing the Package, you accept this license. Do not
% use, modify, or distribute the Package, if you do not accept this
% license.
%
% (11) If your Modified Version has been derived from a Modified Version
% made by someone other than you, you are nevertheless required to
% ensure that your Modified Version complies with the requirements of
% this license.
%
% (12) This license does not grant you the right to use any trademark,
% service mark, tradename, or logo of the Copyright Holder.
%
% (13) This license includes the non-exclusive, worldwide,
% free-of-charge patent license to make, have made, use, offer to sell,
% sell, import and otherwise transfer the Package with respect to any
% patent claims licensable by the Copyright Holder that are necessarily
% infringed by the Package. If you institute patent litigation
% (including a cross-claim or counterclaim) against any party alleging
% that the Package constitutes direct or contributory patent
% infringement, then this Artistic License to you shall terminate on the
% date that such litigation is filed.
%
% (14) Disclaimer of Warranty: THE PACKAGE IS PROVIDED BY THE COPYRIGHT
% HOLDER AND CONTRIBUTORS "AS IS' AND WITHOUT ANY EXPRESS OR IMPLIED
% WARRANTIES. THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
% PARTICULAR PURPOSE, OR NON-INFRINGEMENT ARE DISCLAIMED TO THE EXTENT
% PERMITTED BY YOUR LOCAL LAW. UNLESS REQUIRED BY LAW, NO COPYRIGHT
% HOLDER OR CONTRIBUTOR WILL BE LIABLE FOR ANY DIRECT, INDIRECT,
% INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING IN ANY WAY OUT OF THE USE
% OF THE PACKAGE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Discrete probability distributions for ProbLog
%
% this file contains predicates to emulate discrete distributions in ProbLog
%
% uniform(I,N,ID)
% emulates a uniform discrete distribution
% P(I) = 1/N for I in {1,2,...,N}
% If I is a variable, the predicate backtracks over all
% possible values for I
% ID has to be ground, it is an identifier which - if in the same proof -
% reused, will always return the same value
%
% binomial(K,N,P,ID)
% emulates a binomial distribution
% P(K) = (N over K) x P^K x (1-P)^(N-K) for K in {0,1,...,N}
% If K is a variable, the predicate backtracks over all
% possible values for K
% ID has to be ground, it is an identifier which - if in the same proof -
% reused, will always return the same value
%
% poisson(K,Lambda,ID)
% emulates a Poisson distribution
% P(K) = Lamda^K / K! x exp(-Lambda) for K in {0,1,2, ....}
% If K is a variable, the predicate backtracks over all
% possible values for K
% ID has to be ground, it is an identifier which - if in the same proof -
% reused, will always return the same value
%
%
% Author : Bernd Gutmann, bernd.gutmann@cs.kuleuven.be
% Version : January 14, 2009
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
:- module(discrete, [uniform/3,binomial/4,poisson/3]).
:- use_module('../problog').
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% A distribution over 1,2, ..., N
% where P(I) := 1/N
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Prob::p_uniform(_I,_N,_ID,Prob).
uniform(I,N,ID) :-
integer(N),
N>0,
( var(I) ; integer(I), I>0, I=<N),
uniform(1,I,true,N,ID).
uniform(I,I,Old,N,ID) :-
I=<N,
FactProb is 1/(N-I+1),
call(Old),
p_uniform(I,N,ID,FactProb).
uniform(I,I2,Old,N,ID) :-
I<N,
FactProb is 1/(N-I+1),
NextI is I+1,
uniform(NextI,I2,(problog_not(p_uniform(I,N,ID,FactProb)),Old),N,ID).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Binomial Distribution
% K in { 0,1,2,3, ... }
% Lambda >= 0
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Prob::p_binomial(_K,_N,_P,_ID,Prob).
binomial(K,N,P,ID) :-
number(P),
P >= 0,
P =< 1,
integer(N),
N>=0,
( var(K) ; integer(K),K>=0,K=<N),
binomial(0,K,N,P,true,0.0,ID).
binomial(K,KResult,N,P,Old,ProbAcc,ID) :-
% KResult is a number, make sure, not to go over it
% safes some time
(
number(KResult)
->
K=<KResult;
true
),
binomial_coefficient(N,K,BinomCoeff),
Prob is BinomCoeff * (P ** K) * ((1-P) ** (N-K)),
FactProb is Prob / (1-ProbAcc),
% this check stops the derivation, if the floating-point-based
% rounding errors get too big
FactProb > 0.0,
FactProb =< 1.0,
(
(
call(Old),
p_binomial(K,N,P,ID,FactProb),
KResult=K
); (
K<N,
NextK is K+1,
NextProbAcc is ProbAcc+Prob,
binomial(NextK,KResult,N,P,(problog_not(p_binomial(K,N,P,ID,FactProb)),Old),NextProbAcc,ID)
)
).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Poisson Distribution
% K in { 0,1,2,3, ... } or var(K)
% Lambda >= 0
% ID has to be ground
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
P :: p_poisson(_K,_Lambda,_ID,P).
poisson(K,Lambda,ID) :-
( var(K); integer(K),K>=0 ),
number(Lambda),
Lambda>=0,
ground(ID),
poisson(0,K,true,Lambda,0.0,ID).
poisson(K,K2,Old,Lambda,ProbAcc,ID) :-
% KResult is a number, make sure, not to go over it
% safes some time
(
integer(K2)
->
K=<K2;
true
),
power_over_factorial(K,Lambda,Part1),
% Prob is P(K) for a Poisson distribution with Lambda
Prob is Part1 * exp(-Lambda),
% now we have to determine the fact probability
% conditioned on the aggregated probabilities so far
FactProb is Prob/(1-ProbAcc),
% this check stops the derivation, if the floating-point-based
% rounding errors get too big
FactProb > 0.0,
FactProb =< 1.0,
(
(
call(Old),
p_poisson(K,Lambda,ID,FactProb),
K2=K
); (
NextK is K+1,
NextProbAcc is ProbAcc+Prob,
poisson(NextK,K2,(problog_not(p_poisson(K,Lambda,ID,FactProb)),Old),Lambda,NextProbAcc,ID)
)
).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% calculates (Lambda ** N) / N!
power_over_factorial(N,Lambda,Result) :-
integer(N),
N>=0,
power_over_factorial(N,Lambda,1.0,Result).
power_over_factorial(N,Lambda,Old,Result) :-
(
N>0
->
(
N2 is N-1,
New is Old * Lambda/N,
power_over_factorial(N2,Lambda,New,Result)
); Result=Old
).
% calculates (N \over K) = N!/(K! * (N-K)!)
binomial_coefficient(N,K,Result) :-
integer(K),
K >= 0,
binomial_coefficient(K,N,1,Result).
binomial_coefficient(I,N,Product,Result) :-
(
I=0
->
Result=Product;
(
I2 is I-1,
Product2 is Product * (N+1-I)/I,
binomial_coefficient(I2,N,Product2,Result)
)
).

4
packages/ProbLog/problog/flags.yap
View File

@@ -2,8 +2,8 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2010-12-02 15:20:15 +0100 (Thu, 02 Dec 2010) $
% $Revision: 5043 $
% $Date: 2011-02-08 16:00:57 +0100 (Tue, 08 Feb 2011) $
% $Revision: 5614 $
%
% This file is part of ProbLog
% http://dtai.cs.kuleuven.be/problog

46
packages/ProbLog/problog/print_learning.yap
View File

@@ -2,8 +2,8 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2010-12-02 15:20:15 +0100 (Thu, 02 Dec 2010) $
% $Revision: 5043 $
% $Date: 2011-04-21 14:18:59 +0200 (Thu, 21 Apr 2011) $
% $Revision: 6364 $
%
% This file is part of ProbLog
% http://dtai.cs.kuleuven.be/problog
@@ -207,11 +207,12 @@
%%%%%%%%
% Collected OS depended instructions
%%%%%%%%
:- module(print_learning, [format_learning/3]).
:- module(print_learning, [format_learning/3,format_learning_rule/3]).
% load our own modules
:- use_module(flags).
:- use_module(termhandling).
:- initialization(problog_define_flag(verbosity_learning, problog_flag_validate_0to5,'How much output shall be given (0=nothing,5=all)',5, learning_general)).
@@ -230,3 +231,42 @@ format_learning(Level,String,Arguments) :-
flush_output(user).
format_learning(_,_,_) :-
true.
%========================================================================
%=
%=
%=
%========================================================================
format_learning_rule(D,'$atom'(A)):-
format_learning(D,'~q',[A]).
format_learning_rule(D,\+A):-
format_learning(D,'\+',[]),
format_learning_rule(D,A).
format_learning_rule(D,'true'):-
format_learning(D,'true',[]).
format_learning_rule(D,'false'):-
format_learning(D,'false',[]).
format_learning_rule(D,(First<=>Second)):-
format_learning_rule(D,First),
format_learning(D,'<==>',[]),
format_learning_rule(D,Second)
.
format_learning_rule(D,(First;Second)):-
format_learning(D,'(',[]),
format_learning_rule(D,First),
format_learning(D,';',[]),
format_learning_rule(D,Second),
format_learning(D,')',[])
.
format_learning_rule(D,(First,Second)):-
format_learning_rule(D,First),
format_learning(D,',',[]),
format_learning_rule(D,Second)
.
format_learning_rule(D,R,Key):-
(format_learning_rule(D,R) ; (format('~q ',[flr(D,R,Key)]),throw(ball))),
format_learning(D,' (~q)~n',[Key]).

8
packages/ProbLog/problog/ptree.yap
View File

@@ -2,8 +2,8 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2011-01-16 19:24:10 +0100 (Sun, 16 Jan 2011) $
% $Revision: 5260 $
% $Date: 2011-04-11 17:23:11 +0200 (Mon, 11 Apr 2011) $
% $Revision: 5920 $
%
% This file is part of ProbLog
% http://dtai.cs.kuleuven.be/problog
@@ -679,6 +679,10 @@ writemap([Name|Names],[Fact|Facts]):-
writemap(Names, Facts).
bdd_vars_script([], []).
bdd_vars_script([false|T], Names):-
bdd_vars_script(T, Names).
bdd_vars_script([true|T], Names):-
bdd_vars_script(T, Names).
bdd_vars_script([not(A)|B], Names) :-
!, bdd_vars_script([A|B], Names).
bdd_vars_script([A|B], [NameA|Names]) :-

28
packages/ProbLog/problog/tabling.yap
View File

@@ -2,8 +2,8 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2010-12-13 16:29:18 +0100 (Mon, 13 Dec 2010) $
% $Revision: 5122 $
% $Date: 2011-04-11 17:23:11 +0200 (Mon, 11 Apr 2011) $
% $Revision: 5920 $
%
% This file is part of ProbLog
% http://dtai.cs.kuleuven.be/problog
@@ -305,21 +305,21 @@ problog_table(P) :-
problog_table(P, M).
problog_table(M:P, _) :-
problog_table(P, M).
problog_table(P, M).
problog_table((P1, P2), M) :-
problog_table(P1, M),
problog_table(P2, M).
problog_table(P1, M),
problog_table(P2, M).
problog_table(Name/Arity, Module) :-
length(Args,Arity),
Head =.. [Name|Args],
\+ predicate_property(Module:Head, dynamic), !,
throw(error('problog_table: Problog tabling currently requires the predicate to be declared dynamic and compiles it to static.')).
length(Args,Arity),
Head =.. [Name|Args],
\+ predicate_property(Module:Head, dynamic), !,
throw(error('problog_table: Problog tabling currently requires the predicate to be declared dynamic and compiles it to static.')).
problog_table(Name/Arity, Module) :-
length(Args,Arity),
Head =.. [Name|Args],
atom_concat(['problog_', Name, '_original'], OriginalName),
atom_concat(['problog_', Name, '_mctabled'], MCName),
atom_concat(['problog_', Name, '_tabled'], ExactName),
length(Args,Arity),
Head =.. [Name|Args],
atom_concat(['problog_', Name, '_original'], OriginalName),
atom_concat(['problog_', Name, '_mctabled'], MCName),
atom_concat(['problog_', Name, '_tabled'], ExactName),
% Monte carlo tabling
catch((table(Module:MCName/Arity),

454
packages/ProbLog/problog/termhandling.yap Normal file
View File

@@ -0,0 +1,454 @@
%%% -*- Mode: Prolog; -*-
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% $Date: 2011-04-09 12:00:00 +0200 (Sat, 09 Apr 2011) $
% $Revision: 5890 $
%
% Main authors of this file:
% Bernd Gutmann
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Artistic License 2.0
%
% Copyright (c) 2000-2006, The Perl Foundation.
%
% Everyone is permitted to copy and distribute verbatim copies of this
% license document, but changing it is not allowed. Preamble
%
% This license establishes the terms under which a given free software
% Package may be copied, modified, distributed, and/or
% redistributed. The intent is that the Copyright Holder maintains some
% artistic control over the development of that Package while still
% keeping the Package available as open source and free software.
%
% You are always permitted to make arrangements wholly outside of this
% license directly with the Copyright Holder of a given Package. If the
% terms of this license do not permit the full use that you propose to
% make of the Package, you should contact the Copyright Holder and seek
% a different licensing arrangement. Definitions
%
% "Copyright Holder" means the individual(s) or organization(s) named in
% the copyright notice for the entire Package.
%
% "Contributor" means any party that has contributed code or other
% material to the Package, in accordance with the Copyright Holder's
% procedures.
%
% "You" and "your" means any person who would like to copy, distribute,
% or modify the Package.
%
% "Package" means the collection of files distributed by the Copyright
% Holder, and derivatives of that collection and/or of those files. A
% given Package may consist of either the Standard Version, or a
% Modified Version.
%
% "Distribute" means providing a copy of the Package or making it
% accessible to anyone else, or in the case of a company or
% organization, to others outside of your company or organization.
%
% "Distributor Fee" means any fee that you charge for Distributing this
% Package or providing support for this Package to another party. It
% does not mean licensing fees.
%
% "Standard Version" refers to the Package if it has not been modified,
% or has been modified only in ways explicitly requested by the
% Copyright Holder.
%
% "Modified Version" means the Package, if it has been changed, and such
% changes were not explicitly requested by the Copyright Holder.
%
% "Original License" means this Artistic License as Distributed with the
% Standard Version of the Package, in its current version or as it may
% be modified by The Perl Foundation in the future.
%
% "Source" form means the source code, documentation source, and
% configuration files for the Package.
%
% "Compiled" form means the compiled bytecode, object code, binary, or
% any other form resulting from mechanical transformation or translation
% of the Source form.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Permission for Use and Modification Without Distribution
%
% (1) You are permitted to use the Standard Version and create and use
% Modified Versions for any purpose without restriction, provided that
% you do not Distribute the Modified Version.
%
% Permissions for Redistribution of the Standard Version
%
% (2) You may Distribute verbatim copies of the Source form of the
% Standard Version of this Package in any medium without restriction,
% either gratis or for a Distributor Fee, provided that you duplicate
% all of the original copyright notices and associated disclaimers. At
% your discretion, such verbatim copies may or may not include a
% Compiled form of the Package.
%
% (3) You may apply any bug fixes, portability changes, and other
% modifications made available from the Copyright Holder. The resulting
% Package will still be considered the Standard Version, and as such
% will be subject to the Original License.
%
% Distribution of Modified Versions of the Package as Source
%
% (4) You may Distribute your Modified Version as Source (either gratis
% or for a Distributor Fee, and with or without a Compiled form of the
% Modified Version) provided that you clearly document how it differs
% from the Standard Version, including, but not limited to, documenting
% any non-standard features, executables, or modules, and provided that
% you do at least ONE of the following:
%
% (a) make the Modified Version available to the Copyright Holder of the
% Standard Version, under the Original License, so that the Copyright
% Holder may include your modifications in the Standard Version. (b)
% ensure that installation of your Modified Version does not prevent the
% user installing or running the Standard Version. In addition, the
% modified Version must bear a name that is different from the name of
% the Standard Version. (c) allow anyone who receives a copy of the
% Modified Version to make the Source form of the Modified Version
% available to others under (i) the Original License or (ii) a license
% that permits the licensee to freely copy, modify and redistribute the
% Modified Version using the same licensing terms that apply to the copy
% that the licensee received, and requires that the Source form of the
% Modified Version, and of any works derived from it, be made freely
% available in that license fees are prohibited but Distributor Fees are
% allowed.
%
% Distribution of Compiled Forms of the Standard Version or
% Modified Versions without the Source
%
% (5) You may Distribute Compiled forms of the Standard Version without
% the Source, provided that you include complete instructions on how to
% get the Source of the Standard Version. Such instructions must be
% valid at the time of your distribution. If these instructions, at any
% time while you are carrying out such distribution, become invalid, you
% must provide new instructions on demand or cease further
% distribution. If you provide valid instructions or cease distribution
% within thirty days after you become aware that the instructions are
% invalid, then you do not forfeit any of your rights under this
% license.
%
% (6) You may Distribute a Modified Version in Compiled form without the
% Source, provided that you comply with Section 4 with respect to the
% Source of the Modified Version.
%
% Aggregating or Linking the Package
%
% (7) You may aggregate the Package (either the Standard Version or
% Modified Version) with other packages and Distribute the resulting
% aggregation provided that you do not charge a licensing fee for the
% Package. Distributor Fees are permitted, and licensing fees for other
% components in the aggregation are permitted. The terms of this license
% apply to the use and Distribution of the Standard or Modified Versions
% as included in the aggregation.
%
% (8) You are permitted to link Modified and Standard Versions with
% other works, to embed the Package in a larger work of your own, or to
% build stand-alone binary or bytecode versions of applications that
% include the Package, and Distribute the result without restriction,
% provided the result does not expose a direct interface to the Package.
%
% Items That are Not Considered Part of a Modified Version
%
% (9) Works (including, but not limited to, modules and scripts) that
% merely extend or make use of the Package, do not, by themselves, cause
% the Package to be a Modified Version. In addition, such works are not
% considered parts of the Package itself, and are not subject to the
% terms of this license.
%
% General Provisions
%
% (10) Any use, modification, and distribution of the Standard or
% Modified Versions is governed by this Artistic License. By using,
% modifying or distributing the Package, you accept this license. Do not
% use, modify, or distribute the Package, if you do not accept this
% license.
%
% (11) If your Modified Version has been derived from a Modified Version
% made by someone other than you, you are nevertheless required to
% ensure that your Modified Version complies with the requirements of
% this license.
%
% (12) This license does not grant you the right to use any trademark,
% service mark, tradename, or logo of the Copyright Holder.
%
% (13) This license includes the non-exclusive, worldwide,
% free-of-charge patent license to make, have made, use, offer to sell,
% sell, import and otherwise transfer the Package with respect to any
% patent claims licensable by the Copyright Holder that are necessarily
% infringed by the Package. If you institute patent litigation
% (including a cross-claim or counterclaim) against any party alleging
% that the Package constitutes direct or contributory patent
% infringement, then this Artistic License to you shall terminate on the
% date that such litigation is filed.
%
% (14) Disclaimer of Warranty: THE PACKAGE IS PROVIDED BY THE COPYRIGHT
% HOLDER AND CONTRIBUTORS "AS IS' AND WITHOUT ANY EXPRESS OR IMPLIED
% WARRANTIES. THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
% PARTICULAR PURPOSE, OR NON-INFRINGEMENT ARE DISCLAIMED TO THE EXTENT
% PERMITTED BY YOUR LOCAL LAW. UNLESS REQUIRED BY LAW, NO COPYRIGHT
% HOLDER OR CONTRIBUTOR WILL BE LIABLE FOR ANY DIRECT, INDIRECT,
% INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING IN ANY WAY OUT OF THE USE
% OF THE PACKAGE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
:- module(termhandling, [term_element/2,
propagate/5,
propagate_interpretation/3,
simplify/3,
list_to_disjunction/2,
list_to_conjunction/2,
op( 551, yfx, <=> ),
not/2]).
% propagate( +OldTerm, +AtomToReplace, +ReplacementTermForAtom, -NewTerm, -ReplaceHasHappend).
% simplify(+OldTerm,-NewTerm,-SimplificationHasHappend).
% list_to_disjunction(+list,-Disjunction).
% list_to_conjunction(+list,+Conjunction).
:- op( 551, yfx, <=> ).
:- style_check(all).
:- yap_flag(unknown,error).
%========================================================================
%=
%=
%= term_element(+GroundTerm, ?Atom)
%========================================================================
term_element((X,Y),Z) :-
(term_element(X,Z);term_element(Y,Z)).
term_element((X;Y),Z) :-
(term_element(X,Z);term_element(Y,Z)).
term_element((X <=> Y),Z) :-
(term_element(X,Z);term_element(Y,Z)).
term_element(\+ X,Z) :-
term_element(X,Z).
term_element('$atom'(X),'$atom'(X)) :-
X \== true,
X \== false.
% or(+Boolean,+Boolean,-Boolean)
or(true,_,true).
or(false,X,X).
% not(+Boolean,-Boolean)
not(true,false).
not(false,true).
%========================================================================
%=
%=
%= propagate_interpretation(+GroundTerm, +ID, -GroundTerm)
%========================================================================
propagate_interpretation((X,Y),ID,(X2,Y2)) :-
propagate_interpretation(X,ID,X2),
propagate_interpretation(Y,ID,Y2).
propagate_interpretation((X;Y),ID,(X2;Y2)) :-
propagate_interpretation(X,ID,X2),
propagate_interpretation(Y,ID,Y2).
propagate_interpretation((X <=> Y),ID,(X2 <=> Y2)) :-
propagate_interpretation(X,ID,X2),
propagate_interpretation(Y,ID,Y2).
propagate_interpretation((\+ X), ID,\+ X2) :-
propagate_interpretation(X,ID,X2).
propagate_interpretation('$atom'(X),ID,Value) :-
(
user:known(ID,X,Value)
->
true;
Value='$atom'(X)
).
%========================================================================
%=
%=
%=
%========================================================================
propagate((X,Y),A,AValue,(X2,Y2),Result) :-
propagate(X,A,AValue,X2,Result1),
propagate(Y,A,AValue,Y2,Result2),
or(Result1,Result2,Result).
propagate((X;Y),A,AValue,(X2;Y2),Result) :-
propagate(X,A,AValue,X2,Result1),
propagate(Y,A,AValue,Y2,Result2),
or(Result1,Result2,Result).
propagate((X <=> Y),A,AValue,(X2 <=> Y2),Result) :-
propagate(X,A,AValue,X2,Result1),
propagate(Y,A,AValue,Y2,Result2),
or(Result1,Result2,Result).
propagate((\+ X), A, AValue,\+ X2,Result) :-
propagate(X,A,AValue,X2,Result).
propagate('$atom'(X),'$atom'(A),AValue,X2,Result) :-
(
X==A
->
(
X2=AValue,
Result=true
);
(
X2=X,
Result=false
)
).
propagate(true,_,_,true,false).
propagate(false,_,_,false,false).
%========================================================================
%=
%=
%=
%========================================================================
negate_atom(\+ '$atom'(X), '$atom'(X)).
negate_atom( '$atom'(X),\+ '$atom'(X)).
occurs_check_and((X,_), A) :-
occurs_check_and(X,A),
!.
occurs_check_and((_,Y), A) :-
occurs_check_and(Y,A).
occurs_check_and( '$atom'(X), '$atom'(X)).
occurs_check_or((X;_), A) :-
occurs_check_or(X,A),
!.
occurs_check_or((_;Y), A) :-
occurs_check_and(Y,A).
occurs_check_or( '$atom'(X), '$atom'(X) ).
%========================================================================
%=
%= Tries to simplify Term. If succeeded Status=true and SimplifiedTerm
%= is bound to the simplified term. If not succeeded Status=false and
%= SimplifiedTerm=Term.
%=
%= Only works for ground terms! If non-ground terms are used, the
%= the result is undefined!!!
%=
%= simplify(+Term, -SimplifiedTerm, -Status)
%=
%========================================================================
simplify(Term,Term3,true) :-
simplify_intern(Term,Term2,Result),
Result==true,
!,
simplify(Term2,Term3,_).
simplify(Term,Term,false).
%-----------
simplify_intern( (X<=>Y), NewTerm, Result) :-
simplify_intern_implication(X,Y,NewTerm,Result).
simplify_intern((\+ X), NewTerm,Result) :-
simplify_intern_negation(X,NewTerm,Result).
simplify_intern( (X;Y), NewTerm, Result) :-
simplify_intern_or(X,Y,NewTerm,Result).
simplify_intern( (X,Y), NewTerm, Result) :-
simplify_intern_and(X,Y,NewTerm,Result).
simplify_intern('$atom'(X),'$atom'(X),false).
simplify_intern(true,true,false).
simplify_intern(false,false,false).
%-----------
simplify_intern_or( true,_,true,true) :-
!.
simplify_intern_or( false,X,X,true) :-
!.
simplify_intern_or(_,true,true,true) :-
!.
simplify_intern_or(X,false,X,true) :-
!.
% quite expensive
% simplify_intern_or(X,Y,true,true) :-
% negate_atom(X,X2),
% occurs_check_or(Y,X2),
% !.
simplify_intern_or(X,Y,(X2;Y2),Result) :-
!,
simplify_intern(X,X2,Result1),
simplify_intern(Y,Y2,Result2),
or(Result1,Result2,Result).
%-----------
simplify_intern_and( true,X,X,true) :-
!.
simplify_intern_and( false,_,false,true) :-
!.
simplify_intern_and(X,true,X,true) :-
!.
simplify_intern_and(_,false,false,true) :-
!.
% quite expensive
% simplify_intern_and(X,Y,false,true) :-
% negate_atom(X,X2),
% occurs_check_and(Y,X2),
% !.
simplify_intern_and(X,Y,(X2,Y2),Result) :-
!,
simplify_intern(X,X2,Result1),
simplify_intern(Y,Y2,Result2),
or(Result1,Result2,Result).
%-----------
simplify_intern_implication(true,Y,Y,true) :-
!.
simplify_intern_implication(false,Y,(\+ Y),true) :-
!.
simplify_intern_implication(X,true,X,true) :-
!.
simplify_intern_implication(X,false,(\+ X),true) :-
!.
simplify_intern_implication(X,Y,(X <=> Y2), Result) :-
!,
simplify_intern(Y,Y2,Result).
%-----------
simplify_intern_negation(true,false,true).
simplify_intern_negation(false,true,true).
simplify_intern_negation((\+ X),X,true).
simplify_intern_negation((A,B),Term,true) :-
simplify_intern_or( (\+ A), (\+ B), Term, _).
simplify_intern_negation((A;B),Term,true) :-
simplify_intern_and( (\+ A), (\+ B), Term, _).
simplify_intern_negation('$atom'(X),(\+ '$atom'(X)),false).
%========================================================================
%=
%=
%= list_to_disjunction(+List,-Disjunction)
%========================================================================
list_to_disjunction([A,B|T],(A;T2)) :-
!,
list_to_disjunction([B|T],T2).
list_to_disjunction([A],A).
list_to_disjunction([],false).
%========================================================================
%=
%=
%= list_to_conjunction(+List,(A,T2)-Conjunction) :-
%========================================================================
list_to_conjunction([A,B|T],(A,T2)) :-
!,
list_to_conjunction([B|T],T2).
list_to_conjunction([A],A).
list_to_conjunction([],true).