463 lines
17 KiB
Prolog
463 lines
17 KiB
Prolog
%%% -*- Mode: Prolog; -*-
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
% $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
|
|
%
|
|
% 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.
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
|
:- 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,memberchk/2,append/3]).
|
|
|
|
:- use_module(flags).
|
|
|
|
:- style_check(all).
|
|
:- yap_flag(unknown,error).
|
|
|
|
:- discontiguous user:(<--)/2, problog:(<--)/2.
|
|
|
|
:- op( 550, yfx, :: ).
|
|
|
|
% for annotated disjunctions
|
|
:- op(1149, yfx, <-- ).
|
|
|
|
:- 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,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,Mode);
|
|
(
|
|
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)))
|
|
)
|
|
),
|
|
|
|
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
|
|
->
|
|
(
|
|
format('Compiling the annotated disjunction~n ~q~ninto the following code~n',[(Head<--Body)]),
|
|
format('================================================~n',[]),
|
|
forall(member(F,Facts),format(' ~q.~n',[F])),
|
|
format(' - - - - - - - - - - - - - - - - - - - - - - ~n',[]),
|
|
forall(member(B,Bodies),format(' ~q.~n',[B])),
|
|
format('================================================~2n',[])
|
|
);
|
|
true
|
|
).
|
|
|
|
term_expansion_intern_ad( (Head<--Body),_,_) :-
|
|
format_to_chars('Error at compiling the annotated disjunction ~q<--Body.',[Head,Body],Error),
|
|
print_message(error,Error),
|
|
fail.
|
|
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
get_next_unique_id(ID) :-
|
|
(
|
|
bb_get(mvs_unique_id,ID)
|
|
->
|
|
true;
|
|
ID=1
|
|
),
|
|
ID2 is ID+1,
|
|
bb_put(mvs_unique_id,ID2).
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
proper_annotated_disjunction(AD,Sum) :-
|
|
proper_annotated_disjunction(AD,0.0,Sum),
|
|
Sum=<1.
|
|
|
|
proper_annotated_disjunction( P :: _, OldSum,NewSum) :-
|
|
% evaluate P
|
|
P2 is P,
|
|
P2>=0,
|
|
P2=<1,
|
|
NewSum is OldSum+P.
|
|
proper_annotated_disjunction((X;Y),OldSum,Sum) :-
|
|
proper_annotated_disjunction(X,OldSum,NewSum),
|
|
proper_annotated_disjunction(Y,NewSum,Sum).
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
|
proper_tunable_annotated_disjunction( t(_) :: _).
|
|
proper_tunable_annotated_disjunction((X;Y)) :-
|
|
proper_tunable_annotated_disjunction(X),
|
|
proper_tunable_annotated_disjunction(Y).
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
|
compile_tunable_annotated_disjunction(Head,Body,Facts2,Bodies2,Extra_ID,AD_CPL_Semantics,Mode) :-
|
|
get_next_unique_id(Extra_ID),
|
|
|
|
(
|
|
AD_CPL_Semantics==true
|
|
->
|
|
term_variables(Body,Body_Vars);
|
|
Body_Vars=[]
|
|
),
|
|
|
|
|
|
|
|
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,Mode,ProbSum) :-
|
|
get_next_unique_id(Extra_ID),
|
|
|
|
(
|
|
AD_CPL_Semantics==true
|
|
->
|
|
term_variables(Body,Body_Vars);
|
|
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(Bodies,Bodies2).
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
convert_a((X;Y),OldAcc,Acc,Extra_ID,OldFacts,Facts,Body_Vars) :-
|
|
convert_a(X,OldAcc,NewAcc,Extra_ID,OldFacts,NewFacts,Body_Vars),
|
|
convert_a(Y,NewAcc,Acc,Extra_ID,NewFacts,Facts,Body_Vars).
|
|
convert_a(P::Atom,OldAcc,NewAcc,Extra_ID,OldFacts,[P1::ProbFact|OldFacts],Body_Vars) :-
|
|
Atom =.. [Functor|AllArguments],
|
|
append(AllArguments,Body_Vars,NewAllArguments),
|
|
length(AllArguments,Arity),
|
|
|
|
atomic_concat([mvs_fact_,Functor,'_',Arity,'_',Extra_ID],NewAtom),
|
|
|
|
ProbFact =.. [NewAtom|NewAllArguments],
|
|
(
|
|
(P=:=0; OldAcc=:=0)
|
|
->
|
|
P1 is P;
|
|
P1 is min(P/(1-OldAcc),1.0)
|
|
),
|
|
NewAcc is OldAcc+P.
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
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(t(_)::Atom,Extra_ID,OldFacts,[t(_)::ProbFact|OldFacts],Body_Vars) :-
|
|
Atom =.. [Functor|AllArguments],
|
|
append(AllArguments,Body_Vars,NewAllArguments),
|
|
length(AllArguments,Arity),
|
|
|
|
atomic_concat([mvs_fact_,Functor,'_',Arity,'_',Extra_ID],NewAtom),
|
|
|
|
ProbFact =.. [NewAtom|NewAllArguments].
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
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),
|
|
|
|
length(AllArguments,Arity),
|
|
atomic_concat([mvs_fact_,Functor,'_',Arity,'_',Extra_ID],NewFunctor),
|
|
|
|
ProbFact =.. [NewFunctor|NewAllArguments],
|
|
(
|
|
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)
|
|
).
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
%
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
tuple_append(true,X,X) :-
|
|
!.
|
|
tuple_append(X,true,X) :-
|
|
!.
|
|
tuple_append((A,B),X,(A,B2)) :-
|
|
X \= true,
|
|
!,
|
|
tuple_append(B,X,B2).
|
|
tuple_append(X,Y,(X,Y)) :-
|
|
X \= true,
|
|
Y \= true,
|
|
X \= (_,_).
|