cplint is a suite of programs for reasoning with LPADs [11, 12] and CP-logic -programs [10, 13]. -
It consists of three Prolog modules for answering queries using goal-oriented -procedures plus three Prolog modules for answering queries using the definition of the -semantics of LPADs and CP-logic. -
The modules for answering queries using using goal-oriented procedures are +class="cmtt-10">cplint is a suite of programs for reasoning with ICL [12], LPADs [21, 22] and +CP-logic programs [19, 20]. It contains programs both for inference and +learning. +
+
cplint is distributed in source code in the CVS version of Yap. It +includes Prolog and C files. Download it by following the instruction in +http://www.ncc.up.pt/ vsc/Yap/downloads.html . +
cplint requires CUDD and glib-2.0. You can download CUDD from +ftp://vlsi.colorado.edu/pub/cudd-2.4.2.tar.gz . You can download glib-2.0 (version lpadsld.pl, lpad.pl and cpl.pl: +class="cmsy-10">≥ 2.0) from http://www.gtk.org/ . This is a standard GNU package so it is easy to +install it using the package management software of your Linux or Cygwin +distribution. +
Compile CUDD: +
Install Yap together with cplint: when compiling Yap following the instruction of +the INSTALL file in the root of the Yap folder, use + +
where DIR is the directory where CUDD is, i.e., the directory ending with
+cudd-2.4.2. Under Windows, you have to use Cygwin (CUDD does not compile
+under MinGW), so
+
+
+
After having performed make install you can do make installcheck that will +execute a suite of tests of the various programs. If no error is reported you have a +working installation of cplint. +
+
LPAD and CP-logic programs consist of a set of annotated disjunctive clauses. +Disjunction in the head is represented with a semicolon and atoms in the head are +separated from probabilities by a colon. For the rest, the usual syntax of Prolog is +used. For example, the CP-logic clause +
No parentheses are necessary. The pi are numeric expressions. It is up to the user to +ensure that the numeric expressions are legal, i.e. that they sum up to less than +one. +
If the clause has an empty body, it can be represented like this + +
If the clause has a single head with probability 1, the annotation can be omitted and +the clause takes the form of a normal prolog clause, i.e. + +
stands for + +
+
The coin example of [22] is represented as (see file coin.cpl) + +
The first clause states that if we toss a coin that is not biased it has equal +probability of landing heads and tails. The second states that if the coin is biased it +has a slightly higher probability of landing heads. The third states that the coin is +fair with probability 0.9 and biased with probability 0.1 and the last clause states +that we toss a coin with certainty. +
Moreover, the bodies of rules can contain the built-in predicates: + +
The bodies can also contain the following library predicates: + +
plus the predicate + +
that, given a list of numbers, computes its arithmetic mean. +
The syntax of ICL program is the one used by the AILog 2 system. +
cplint contains various modules for answering queries. +
These modules answer queries using using goal-oriented procedures:
It was proved correct [8] with respect to the semantics of LPADs for range - restricted acyclic programs [lpadsld.pl: uses the top-down procedure described in in [13] and [14]. It + is based on SLDNF resolution and is an adaptation of the interpreter for + ProbLog [8]. +
It was proved correct [14] with respect to the semantics of LPADs for + range restricted acyclic programs [1] without function symbols. -
It is also able to deal with extensions of LPADs and CP-logic: the clause +
It is also able to deal with extensions of LPADs and CP-logic: the clause bodies can contain setof and bagof, the probabilities in the head may @@ -62,32 +194,67 @@ class="cmtt-10">setof or bagof operator. These extended features have been introduced in order to represent CLP(BN) [9] programs and PRM models [6]: 18] programs and PRM models [11]: setof and bagof allow to express dependency of an attribute from an aggregate function of another attribute, as in CLP(BN) and PRM, while the possibility of specifying a uniform distribution allows the use of the reference uncertainty feature of PRM. +
The modules for answering queries using the definition of the semantics of LPADs -and CP-logic are semlpadsld.pl, semlpad.pl and semcpl.pl: +class="cmtt-10">approx/exact.pl as lpadsld.pl but uses SimplecuddLPADs, a modification + of the Simplecudd instead of the cplint library for building BDDs and + computing the probability. +
These modules answer queries using the definition of the semantics of LPADs and +CP-logic:
-
cplint is distributed in source code in the git version of Yap. It -includes Prolog and C files. Download it by following the instruction in -http://www.ncc.up.pt/ vsc/Yap/downloads.html . -
cplint requires cudd and glib-2.0. You can download cudd from -http://vlsi.colorado.edu/ fabio/CUDD/ . You can download glib-2.0 (version ≥ 2.0) -from http://www.gtk.org/ . This is a standard GNU package so it is easy to -install it using the package management software of your Linux or Cygwin -distribution. -
Compile cudd: -
Install Yap together with cplint: when compiling Yap following the instuction of -the INSTALL file in the root of the Yap folder, use - -
Under Windows, you have to use Cygwin (glu does not compile under MinGW),
-so
-
-
where DIR is the path to the directory cudd-2.4.2 (including cudd-2.4.2). -
After having performed make install you can do make installcheck that will -execute a suite of tests of the various programs. If no error is reported you have a -working installation of cplint. -
-
Disjunction in the head is represented with a semicolon and atoms in the head are -separated from probabilities by a colon. For the rest, the usual syntax of Prolog is -used. For example, the CP-logic clause -
No parentheses are necessary. The pi are numeric expressions. It is up to the user to -ensure that the numeric expressions are legal, i.e. that they sum up to less than -one. -
If the clause has an empty body, it can be represented like this - -
If the clause has a single head with probability 1, the annotation can be omitted and -the clause takes the form of a normal prolog clause, i.e. - -
stands for - -
-
The coin example of [12] is represented as (see file coin.cpl) - -
The first clause states that if we toss a coin that is not biased it has equal -probability of landing heads and tails. The second states that if the coin is biased it -has a slightly higher probability of landing heads. The third states that the coin is -fair with probability 0.9 and biased with probability 0.1 and the last clause states -that we toss a coin with certainty. -
-
All six modules accept the same commands for reading in files and answering queries. -The LPAD or CP-logic program must be stored in a text file with extension 20]. +
+
The LPAD or CP-logic program must be stored in a text file with extension .cpl. Suppose you have stored the example above in file coin.cpl. In order to answer @@ -246,23 +294,23 @@ queries from this program, you have to run Yap, load one of the modules (such as example lpad.pl) by issuing the command -
at the command prompt. Then you must parse the source file at the command prompt. Then you must parse the source file coin.cpl with the
command
- if if coin.cpl is in the current directory, or
- if if coin.cpl is in a different directory. At this point you can pose query to the
program by using the predicate s/2 (for solve) that takes as its first argument a
@@ -271,10 +319,10 @@ as its second argument. For example, the probability of the conjunction
head(coin),biased(coin) can be asked with the query
- For computing the probability of a conjunction given another conjunction you can
+ For computing the probability of a conjunction given another conjunction you can
use the predicate sc/3 (for solve conditional) that take takes as input the query
conjunction as its first argument, the evidence conjunction as its second argument
@@ -284,22 +332,22 @@ class="cmtt-10">heads(coin) given the evidence biased(coin) can be asked with the
query
- After having parsed a program, in order to read in a new program you must restart
+ After having parsed a program, in order to read in a new program you must restart
Yap when using semlpadsld.pl and semlpad.pl. With the other modules, you can
directly parse a new program.
- When using When using lpad.pl, the system can print the message “Uunsound program” in
the case in which an instance with a three valued well founded model is found.
Moreover, it can print the message “It requires the choice of a head atom from a non
ground head”: in this case, in order to answer the query, all the groundings of the
culprit clause must be generated, which may be impossible for programs with
function symbols.
- When using When using semcpl.pl, you can print the execution process by using the
command print. after context is a list of atoms that are true in the context.
semcpl.pl can print “Invalid program” in the case in which no execution process
exists.
- When using When using cpl.pl you can print a partial execution model including all the
clauses involved in the query issued with print. cpl.pl can print the messages
“Uunsound program”, “It requires the choice of a head atom from a non ground
head” and “Invalid program”.
- The modules make use of a number of parameters in order to control their
-behavior. They that can be set with the command
+ For approx/deepit.pl and approx/deepdyn.pl the command
- takes as input a list of goals GoalsList and returns a lower bound on the
+probability ProbLow, an upper bound on the probability ProbUp, the CPU time spent
+on performing resolution ResTime and the CPU time spent on handling BDDs
+BddTime.
+ For approx/bestk.pl the command
+
+ takes as input a list of goals GoalsList and returns a lower bound on the
+probability ProbLow, the CPU time spent on performing resolution ResTime and the
+CPU time spent on handling BDDs BddTime.
+ For approx/bestfirst.pl the command
+
+ takes as input a list of goals GoalsList and returns a lower bound on the
+probability ProbLow, an upper bound on the probability ProbUp, the number of
+BDDs generated by the algorithm Count, the CPU time spent on performing
+resolution ResTime and the CPU time spent on handling BDDs BddTime.
+ For approx/montecarlo.pl the command
+
+ takes as input a list of goals GoalsList and returns the number of samples taken
+Samples, the time required to solve the problem Time, the lower end of the
+confidence interval Lower, the estimated probability Prob and the upper end of the
+confidence interval Up.
+ For mcintyre.pl: the command
+
+ takes as input a conjunction of goals Goals and returns the number of samples taken
+Samples, the CPU time required to solve the problem CPUTime, the wall time
+required to solve the problem CPUTime, the lower end of the confidence interval
+Lower, the estimated probability Prob and the upper end of the confidence interval
+Up.
+ For approx/exact.pl the command
+
+ takes as input a conjunction of goals Goals and returns the probability Prob, the
+CPU time spent on performing resolution ResTime and the CPU time spent on
+handling BDDs BddTime.
+
+ The modules make use of a number of parameters in order to control their behavior.
+They that can be set with the command
+
+ from the Yap prompt after having loaded the module. The current value can be read
+ from the Yap prompt after having loaded the module. The current value can be read
with
- from the Yap prompt. The available parameters are:
+ from the Yap prompt. The available parameters are:
where the first element of each couple is the clause number of the input file
+ where the first element of each couple is the clause number of the input file
(starting from 1). In the example above variable X0 corresponds to clause 2
@@ -366,20 +509,20 @@ class="cmtt-10">2 with the
substitutions X=1,X1=0 and variable X2 corresponds to clause 1 with the empty
- substitution. You can view the graph with graphviz ( www.graphviz.org )
- using the command
+class="cmtt-10">1 with the
+ empty substitution. You can view the graph with graphviz using the
+ command
-
+
- The three semantic modules need to produce a grounding of the program in order to
+ event.
+
+
+ The three semantic modules need to produce a grounding of the program in order to
compute the semantics. They require an extra file with extension .uni (for universe)
in the same directory where the .cpl file is.
- There are two ways to specify how to ground a program. The first consists in
+ There are two ways to specify how to ground a program. The first consists in
providing the list of constants to which each variable can be instantiated. For
example, in our case the current directory will contain a file coin.uni that is a
Prolog file containing facts of the form
- where where var_list is a list of variables names (each must be included in single quotes)
and const_list is a list of constants. The semantic modules generate the grounding
@@ -415,23 +610,23 @@ class="cmtt-10">var_list The other way to specify how to ground a program consists in using mode and
+ The other way to specify how to ground a program consists in using mode and
type information. For each predicate, the file .uni must contain a fact of the
form
- that specifies the number and types of each argument of the predicate. Then, the list
+ that specifies the number and types of each argument of the predicate. Then, the list
of constants that are in the domain of each type ti must be specified with a fact of
the form
- The file The file .uni can contain both universe and mode declaration, the ones to be used
depend on the value of the parameter grounding: with value variables, the
universe declarations are used, with value modes the mode declarations are
used.
- With With semcpl.pl only mode declarations can be used.
-
- In this section we will present the extensions to the syntax of LPADs and CP-logic
+
+ In this section we will present the extensions to the syntax of LPADs and CP-logic
programs that cplint can handle.
- The first is the use of some standard Prolog predicates. The bodies can contain
-the built-in predicates:
-
- The bodies can also contain the following library predicates:
-
- plus the predicate
-
- that, given a list of numbers, computes its arithmetic mean.
- When using lpadsld can handle.
+ When using lpadsld.pl, the bodies can contain the predicates setof/3 and
bagof/3 with the same meaning as in Prolog. Existential quantifiers are allowed in
both, so for example the query
- returns all the instantiations of returns all the instantiations of Z such that there exists an instantiation of X and Y
for which foo(X,Y,Z) is true.
- An example of the use of An example of the use of setof and bagof is in the file female.cpl:
- The disjunctive rule expresses the probability of a person of unknown sex of being
+ The disjunctive rule expresses the probability of a person of unknown sex of being
male or female depending on the number of males and females that are known. This
is an example of the use of expressions in the probabilities in the head that depend
on variables in the body. The probabilities are well defined because they always sum
to 1 (unless P is 0).
- Another use of Another use of setof and bagof is to have an attribute depend on an
aggregate function of another attribute, similarly to what is done in PRM and
CLP(BN).
- So, in the classical school example (available in So, in the classical school example (available in student.cpl) you can find the
following clauses:
- where where registr_stu(R,S) expresses that registration R refers to student S and
@@ -557,7 +714,7 @@ class="cmtt-10">R Another extension can be used with Another extension can be used with lpadsld.pl in order to be able to represent
reference uncertainty of PRMs. Reference uncertainty means that the link structure
of a relational model is not fixed but is uncertain: this is represented by having the
@@ -569,25 +726,25 @@ selected uniformly from certain sets, the following clauses can be used (see fil
paper_ref_simple.cpl):
- The first clauses states that the paper The first clauses states that the paper P cited in a citation C is selected
uniformly from the set of all papers with topic theory. The second clauses
expresses that the citing paper is selected uniformly from the papers with topic
ai.
- These clauses make use of the predicate
+ These clauses make use of the predicate
- in the head, where in the head, where Atom must contain Variable. The meaning is the following:
the set of all the atoms obtained by instantiating ∕N where N is the length of
List.
- A more elaborate example is present in file A more elaborate example is present in file paper_ref.cpl:
- where the cited paper depends on the topic of the citing paper. In particular, if the
+ where the cited paper depends on the topic of the citing paper. In particular, if the
topic is theory, the cited paper is selected uniformly from the papers about theory
with probability 0.9 and from the papers about ai with probability 0.1. if
the topic is ai, the cited paper is selected uniformly from the papers about
theory with probability 0.01 and from the papers about ai with probability
0.99.
- PRMs take into account as well existence uncertainty, where the existence of
+ PRMs take into account as well existence uncertainty, where the existence of
instances is also probabilistic. For example, in the paper domain, the total number of
citations may be unknown and a citation between any two paper may have a
probability of existing. For example, a citation between two paper may be more
probable if they are about the same topic:
- This is an example where the probabilities in the head do not sum up to one so the
+ This is an example where the probabilities in the head do not sum up to one so the
null event is automatically added to the head. The first clause states that, if the topic
of a paper X is theory and of paper X to Y. The other clauses consider the remaining cases for the
topics.
-
- In the directory where Yap keeps the library files (usually
+ In the directory where Yap keeps the library files (usually /usr/local/share/ Yap)
you can find the directory cplint that contains the files:
The files The files *.uni that are present for some of the examples are used by the
semantical modules. Some of the example files contain in an initial comment
some queries together with their result.
@@ -764,18 +918,289 @@ class="cmtt-10">*.uni
-
+ cplint contains the following learning algorithms:
+
+ To execute the learning algorithms, prepare four files in the same folder:
+ where <stem> is your dataset name. Examples of these files can be found in the dataset
+pages.
+ In <stem>.kb the example interpretations have to be given as a list of Prolog
+facts initiated by begin(model(<name>)). and terminated by end(model(<name>)).
+as in
+
+ The interpretations may contain a fact of the form
+
+ assigning a probability (0.3 in this case) to the interpretations. If this is omitted, the
+probability of each interpretation is considered equal to 1∕n where n is the total
+number of interpretations. prob/1 can be used to set different multiplicity for the
+different interpretations.
+ In order for RIB to work, the input interpretations must share the Herbrand
+universe. If this is not the case, you have to translate the interpretations in this was,
+see for example the sp1 files in RIB’s folder, that are the results of the conversion of
+the first fold of the IMDB dataset.
+ <stem>.bg can contain Prolog clauses that can be used to derive additional
+conclusions from the atoms in the interpretations.
+ <stem>.l contains the declarations of the input and output predicates, of the
+unseen predicates and the commands for setting the algorithms’ parameters. Output
+predicates are declared as
+
+ and define the predicates whose atoms in the input interpretations are used as the
+goals for the prediction of which you want to optimize the parameters. Derivations
+for these goals are built by the systems.
+ Input predicates are those for the predictions of which you do not want to
+optimize the parameters. You can declare closed world input predicates
+with
+
+ For these predicates, the only true atoms are those in the interpretations, the
+clauses in the input program are not used to derive atoms not present in the
+interpretations.
+ Open world input predicates are declared with
+
+ In this case, if a subgoal for such a predicate is encountered when deriving the atoms
+for the output predicates, both the facts in the interpretations and the clauses of the
+input program are used.
+ For RIB, if there are unseen predicates, i.e., predicates that are present in the
+input program but not in the interpretations, you have to declare them
+with
+
+
+ For SLIPCASE, you have to specify the language bias by means of mode
+declarations in the style of Progol .
+
+ specifies the atoms that can appear in the head of clauses, while
+
+ specifies the atoms that can appear in the body of clauses. <recall> can be an
+integer or * (currently unused).
+ The arguments are of the form
+
+ for specifying an input variable of type <type>, or
+
+ for specifying an output variable of type <type>.
+ In order to set the algorithms’ parameters, you have to insert in <stem>.l commands
+of the form
+
+ The available parameters are:
+
+ To execute CEM, load em.pl and call:
+
+ To execute RIB, load rib.pl and call:
+
+
+
+ cplint, as Yap, follows the Artistic License 2.0 that you can find in Yap CVS root
dir. The copyright is by Fabrizio Riguzzi.
- The program uses the library The modules in the approx subdirectory use SimplecuddLPADs, a modification of
+the Simplecudd library whose copyright is by Katholieke Universiteit Leuven and
+that follows the Artistic License 2.0.
+ Some modules use the library CUDD for manipulating BDDs that is included in
glu. For the use of CUDD, the following license must be accepted:
- Copyright (c) 1995-2004, Regents of the University of Colorado
- All rights reserved.
- Redistribution and use in source and binary forms, with or without modification,
+ Copyright (c) 1995-2004, Regents of the University of Colorado
+ All rights reserved.
+ Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS lpad.pl, semlpad.pl and cpl.pl are based on the SLG system by and David Scott Warren , Copyright (C) 1993 Southern Methodist University,
1993 SUNY at Stony Brook, see the file COYPRIGHT_SLG for detailed information
on this copyright.
-
[1] K. R. Apt and M. Bezem. Acyclic programs. New Generation
- Comput., 9(3/4):335–364, 1991.
+ id="XDBLP:journals/ngc/AptB91">K. R. Apt and M. Bezem. Acyclic programs. New Gener. Comput.,
+ 9(3/4):335–364, 1991.
[2] Elena Bellodi and Fabrizio Riguzzi. EM over binary decision diagrams
+ for probabilistic logic programs. In Proceedings of the 26th Italian
+ Conference on Computational Logic (CILC2011), Pescara, Italy, 31 August
+ 31-2 September, 2011, 2011.
+
+ [3] Elena Bellodi and Fabrizio Riguzzi. EM over binary decision
+ diagrams for probabilistic logic programs. Technical Report CS-2011-01,
+ Dipartimento di Ingegneria, Universitą di Ferrara, Italy, 2011.
+
+ [4] Elena Bellodi and Fabrizio Riguzzi. Learning the structure of
+ probabilistic logic programs. In Inductive Logic Programming, 21th
+ International Conference, ILP 2011, London, UK, 31 July-3 August, 2011,
+ 2011.
+
+ [5] H. Blockeel. Probabilistic logical models for mendel’s experiments: An
+
exercise. In Inductive Logic Programming (ILP 2004), Work in Progress
Track, 2004.
- [3] Stefano Bragaglia and Fabrizio Riguzzi. Approximate inference for logic
+ programs with annotated disjunctions. In Paolo Frasconi and Francesca
+ Lisi, editors, Inductive Logic Programming 20th International Conference,
+ ILP 2010, Florence, Italy, June 27-30, 2010. Revised Papers, volume 6489
+ of LNCS, pages 30–37. Springer, 2011.
+
+ [7] Weidong Chen and David Scott Warren. Tabled evaluation with
delaying for general logic programs. J. ACM, 43(1):20–74, 1996.
+class="cmti-10">Journal of the ACM, 43(1):20–74, 1996.
- [4] L. De Raedt, A. Kimmig, and H. Toivonen. Problog: A probabilistic
- prolog and its application in link discovery. In Proceedings of the 20th
+ [8] L. De Raedt, A. Kimmig, and H. Toivonen. ProbLog: A probabilistic
+ Prolog and its application in link discovery. In International Joint
International Joint Conference on Artificial Intelligence, pages 2462–2467,
- 2007.
+class="cmti-10">Conference on Artificial Intelligence, pages 2462–2467, 2007.
- [5] G. Elidan and N. Friedman. Learning hidden variable networks: The
+ information bottleneck approach. Journal of Machine Learning Research,
+ 6:81–127, 2005.
+
+ [10] L. Getoor, N. Friedman, D. Koller, and A. Pfeffer. Learning
probabilistic relational models. In Saso Dzeroski and Nada Lavrac, editors,
Relational Data Mining. Springer-Verlag, Berlin, 2001.
- [6] L. Getoor, N. Friedman, D. Koller, and B. Taskar. Learning
probabilistic models of relational structure. Journal of Machine Learning
@@ -863,70 +1330,92 @@ class="cmti-10">Journal of Machine Learning
class="cmti-10">Research, 3:679–707, December 2002.
- [7] Fabrizio Riguzzi. A top down interpreter for lpad and cp-logic. In
- 10th Congress of the Italian Association for Artificial Intelligence. Springer,
- 2007.
- http://www.ing.unife.it/docenti/FabrizioRiguzzi/Papers/Rig-AIIA07.pdf
- .
+ [12] David Poole. The independent choice logic for modelling multiple agents
+ under uncertainty. Artificial Intelligence, 94(1-2):7–56, 1997.
- [8] Fabrizio Riguzzi. A top down interpreter for lpad and
- cp-logic. In The 14th RCRA workshop Experimental Evaluation of
+ [13] Fabrizio Riguzzi. A top down interpreter for LPAD and CP-logic. In
Algorithms for Solving Problems with Combinatorial Explosion, 2007.
- http://pst.istc.cnr.it/RCRA07/articoli/P19-riguzzi-RCRA07.pdf .
+class="cmti-10">Congress of the Italian Association for Artificial Intelligence, volume 4733
+ of LNAI, pages 109–120. Springer, 2007.
- [9] V. Santos Costa, D. Page, M. Qazi, and J. Cussens. CLP(BN):
+ [14] Fabrizio Riguzzi. A top down interpreter for LPAD and CP-logic.
+ In Proceedings of the 14th RCRA workshop Experimental Evaluation of
+ Algorithms for Solving Problems with Combinatorial Explosion, 2007.
+
+ [15] Fabrizio Riguzzi. Extended semantics and inference for the Independent
+ Choice Logic. Logic Journal of the IGPL, 17(6):589–629, 2009.
+
+ [16] Fabrizio Riguzzi. MCINTYRE: A Monte Carlo algorithm for
+ probabilistic logic programming. In Proceedings of the 26th Italian
+ Conference on Computational Logic (CILC2011), Pescara, Italy, 31
+ August-2 September, 2011, 2011.
+
+ [17] Fabrizio Riguzzi and Nicola Di Mauro. Applying the information
+ bottleneck to statistical relational learning. Machine Learning, 2011. To
+ appear.
+
+ [18] V. Santos Costa, D. Page, M. Qazi, and J. Cussens. CLP(
- [10] J. Vennekens, M. Denecker, and M. Bruynooghe. Representing causal
- information about a probabilistic process. In 10th European Conference on
+ information about a probabilistic process. In Proceedings of the 10th
Logics in Artificial Intelligence, JELIA 2006, LNAI. Springer, September
- 2006.
+class="cmti-10">European Conference on Logics in Artificial Intelligence, LNAI. Springer,
+ September 2006.
+
+ [20] J. Vennekens, Marc Denecker, and Maurice Bruynooghe. CP-logic:
+ A language of causal probabilistic events and its relation to logic
+ programming. Theory Pract. Log. Program., 9(3):245–308, 2009.
- [11] J. Vennekens and S. Verbaeten. Logic programs with annotated
- disjunctions. Technical Report CW386, K. U. Leuven, 2003.
- http://www.cs.kuleuven.ac.be/~joost/techrep.ps .
+ disjunctions. Technical Report CW386, K. U. Leuven, 2003.
- [12] J. Vennekens, S. Verbaeten, and M. Bruynooghe. Logic programs with
- annotated disjunctions. In The 20th International Conference on Logic
+ [22] J. Vennekens, S. Verbaeten, and M. Bruynooghe. Logic programs
+ with annotated disjunctions. In International Conference on Logic
Programming (ICLP 2004), 2004. http://www.cs.kuleuven.ac.be/~joost/
- .
-
- [13] Joost Vennekens, Marc Denecker, and Maurice Bruynooge. Extending
- the role of causality in
- probabilistic modeling. http://www.cs.kuleuven.ac.be/~joost/cplogic.pdf
- , 2006.
+class="cmti-10">Programming, volume 3131 of LNCS, pages 195–209. Springer, 2004.
+
p(coin).
-
+
p(’path_to_coin/coin’).
-
+
s([head(coin),biased(coin)],P).
-
+
sc([heads(coin)],[biased(coin)],P).
-
+
+solve(GoalsList, ProbLow, ProbUp, ResTime, BddTime)
+
+
+solve(GoalsList, ProbLow, ResTime, BddTime)
+
+
+solve(GoalsList, ProbLow, ProbUp, Count, ResTime, BddTime)
+
+
+solve(GoalsList, Samples, Time, Low, Prob, Up)
+
+
+solve(Goals, Samples, CPUTime, WallTime, Lower, Prob, Upper) :-
+
+
+solve(GoalsList, Prob, ResTime, BddTime)
+
+4.1.1 Parameters
+
set(parameter,value).
-
+
setting(parameter,Value).
-
+
Variables: [(2,[X=2,X1=1]),(2,[X=1,X1=0]),(1,[])]
-
+
dotty cpl.dot &
- 5 Semantic Modules
-4.2 Semantic Modules
+
+
universe(var_list,const_list).
-
+
mode(predicate(t1,...,tn)).
-
+
type(ti,list_of_constants).
-6 Extensions
-4.3 Extensions
+
-is/2
-
-
>/2
-
</2
-
>=/2
-
=</2
-
=:=/2
-
=\=/2
-
true/0
-
false/0
-
=/2
-
==/2
-
\=/2
-
\==/2
-
length/2
-
-member/2
-
-
max_list/2
-
min_list/2
-
nth0/3
-
nth/3
-
-average/2
-
-
+
setof(Z, (term(X,Y))^foo(X,Y,Z), L).
-
+
male(C):M/P ; female(C):F/P:-
-
person(C),
setof(Male,known_male(Male),LM),
@@ -514,31 +675,27 @@ male(C):M/P ; female(C):F/P:-
person(f).
known_female(a).
-
known_female(b).
-
known_female(c).
-
known_male(d).
-
known_male(e).
+
student_rank(S,h):0.6 ; student_rank(S,l):0.4:-
-
bagof(G,R^(registr_stu(R,S),registr_gr(R,G)),L),
average(L,Av),Av>1.5.
@@ -547,7 +704,7 @@ student_rank(S,h):0.6 ; student_rank(S,l):0.4:-
bagof(G,R^(registr_stu(R,S),registr_gr(R,G)),L),
average(L,Av),Av =< 1.5.
+
uniform(cites_cited(C,P),P,L):-
-
bagof(Pap,paper_topic(Pap,theory),L).
uniform(cites_citing(C,P),P,L):-
bagof(Pap,paper_topic(Pap,ai),L).
+
uniform(Atom,Variable,List)
-
+
uniform(cites_citing(C,P),P,L):-
-
setof(Pap,paper(Pap),L).
@@ -616,19 +773,19 @@ uniform(cites_citing(C,P),P,L):-
uniform(cites_cited(C,P),P,L):-
cites_cited_group(C,T),bagof(Pap,paper_topic(Pap,T),L).
+
cites(X,Y):0.005 :-
-
paper_topic(X,theory),paper_topic(Y,theory).
@@ -641,7 +798,7 @@ cites(X,Y):0.005 :-
cites(X,Y):0.008 :-
paper_topic(X,ai),paper_topic(Y,ai).
7 Additional Files
-4.4 Files
+
-
:
invalid.cpl: programs taken from [13]. 20]. invalid.cpl is an example
of a program that is invalid but sound.8 License
-5 Learning
+
+
+5.1 Input
+
+
+
+begin(model(b1)).
+
+
sameperson(1,2).
+
movie(f1,1).
+
movie(f1,2).
+
workedunder(1,w1).
+
workedunder(2,w1).
+
gender(1,female).
+
gender(2,female).
+
actor(1).
+
actor(2).
+
end(model(b1)).
+
+prob(0.3).
+
+
+output(<predicate>/<arity>).
+
+
+input_cw(<predicate>/<arity>).
+
+
+input(<predicate>/<arity>).
+
+
+unseen(<predicate>/<arity>).
+
+
+modeh(<recall>,<predicate>(<arg1>,...).
+
+
+modeb(<recall>,<predicate>(<arg1>,...).
+
+
++<type>
+
+
+-<type>
+
+5.2 Parameters
+
+:- set(<parameter>,<value>).
+
+
+
+5.3 Commands
+
+?:- em(stem).
+
+
+?:- ib_par(stem).
+
+6 License
+
-
AND CONTRIBUTORS ”AS IS” AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAU-SED
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-References
+ id="x1-150006">
diff --git a/packages/cplint/doc/manual.pdf b/packages/cplint/doc/manual.pdf
index a37549757..e2491631e 100644
Binary files a/packages/cplint/doc/manual.pdf and b/packages/cplint/doc/manual.pdf differ
diff --git a/packages/cplint/doc/manual.tex b/packages/cplint/doc/manual.tex
index ef9b79fd7..8effd8554 100644
--- a/packages/cplint/doc/manual.tex
+++ b/packages/cplint/doc/manual.tex
@@ -1,5 +1,5 @@
\ifnum\pdfoutput>0 % pdflatex compilation
-\documentclass[a4paper,12pt]{article}
+\documentclass[a4paper,10pt]{article}
\usepackage[pdftex]{graphicx}
\DeclareGraphicsExtensions{.pdf,.png,.jpg}
\RequirePackage[hyperindex]{hyperref}
@@ -7,16 +7,16 @@
\documentclass{article}
\usepackage{graphicx}
\DeclareGraphicsExtensions{.png, .gif, .jpg}
-\newcommand{\url}[1]{\Link[#1]{}{} #1 \EndLink}
\newcommand{\href}[2]{\Link[#1]{}{} #2 \EndLink}
\newcommand{\hypertarget}[2]{\Link[]{}{#1} #2 \EndLink}
\newcommand{\hyperlink}[2]{\Link[]{#1}{} #2 \EndLink}
+\newcommand{\url}[1]{\Link[#1]{}{} #1 \EndLink}
\fi
\begin{document}
-\title{\texttt{cplint} Version 2.0 Manual}
+\title{\texttt{cplint} Manual}
\author{Fabrizio Riguzzi\\
@@ -28,69 +28,41 @@ fabrizio.riguzzi@unife.it}
\section{Introduction}
-\texttt{cplint} is a suite of programs for reasoning with LPADs \cite{VenVer03-TR,VenVer04-ICLP04-IC} and CP-logic programs \cite{VenDenBru-JELIA06,CP-logic-unp}.
-
-It consists of three Prolog modules for answering queries using goal-oriented procedures plus
- three
-Prolog modules for answering queries using the definition of the semantics of LPADs and CP-logic.
-
-The modules for answering queries using using goal-oriented procedures are \texttt{lpadsld.pl}, \texttt{lpad.pl} and
-\texttt{cpl.pl}:
-\begin{itemize}
-\item \texttt{lpadsld.pl}: computes the probability of a query using the top-down procedure described in
-in \cite{Rig-AIIA07-IC} and \cite{Rig-RCRA07-IC}. It is based on SLDNF resolution and is an adaptation of the interpreter for ProbLog \cite{DBLP:conf/ijcai/RaedtKT07}.
-
-It was proved correct \cite{Rig-RCRA07-IC} with respect to the semantics of LPADs for range restricted acyclic programs \cite{DBLP:journals/ngc/AptB91} without function symbols.
-
-It is also able to deal with extensions of LPADs and CP-logic: the clause bodies can contain \texttt{setof} and \texttt{bagof}, the probabilities in the head may be depend on variables in the body and it is possible to specify a uniform distribution in the head with reference to a \texttt{setof} or \texttt{bagof} operator. These extended features have been introduced in order to represent CLP(BN) \cite{SanPagQaz03-UAI-IC} programs and PRM models \cite{Getoor+al:JMLR02}:
-\texttt{setof} and \texttt{bagof} allow to express dependency of an attribute from an aggregate function of another attribute, as in CLP(BN) and PRM, while the possibility of specifying a uniform distribution allows the use of the reference uncertainty feature of PRM.
-\item \texttt{lpad.pl}: computes the probability of a query using a top-down procedure based on SLG resolution \cite{DBLP:journals/jacm/ChenW96}. As a consequence, it works for any sound LPADs, i.e., any LPAD such that each of its instances has a two valued well founded model.
-\item \texttt{cpl.pl}: computes the probability of a query using a top-down procedure based on SLG resolution and moreover checks that the CP-logic program is valid, i.e., that it has at least an execution model.
-\end{itemize}
-
-The modules for answering queries using the definition of the semantics of LPADs and CP-logic are \texttt{semlpadsld.pl}, \texttt{semlpad.pl} and
-\texttt{semcpl.pl}:
-\begin{itemize}
-\item \texttt{semlpadsld.pl}: given an LPAD $P$, it generates all the instances of $P$. The probability of a query $Q$ is computed by identifying all the instances where $Q$ is derivable by SLDNF resolution.
-\item \texttt{semlpad.pl}: given an LPAD $P$, it generates all the instances of $P$. The probability of a query $Q$ is computed by identifying all the instances where $Q$ is derivable by SLG resolution.
-\item \texttt{semlcpl.pl}: given an LPAD $P$, it builds an execution model of $P$, i.e., a probabilistic process that satisfy the principles of universal causation, sufficient causation, independent causation, no deus ex machina events and temporal precedence. It uses the definition of the semantics given in \cite{CP-logic-unp}.
-\end{itemize}
-%For program with function symbols, the semantics of LPADs and CP-logic are not defined. However, the interpreter accepts programs with function symbols and, if it does not go into a loop, it returns an answer. What is the meaning of this answer is subject of current study.
+\texttt{cplint} is a suite of programs for reasoning with ICL \cite{DBLP:journals/ai/Poole97}, LPADs \cite{VenVer03-TR,VenVer04-ICLP04-IC} and CP-logic programs \cite{VenDenBru-JELIA06,DBLP:journals/tplp/VennekensDB09}. It contains programs both for inference and learning.
\section{Installation}
-\texttt{cplint} is distributed in source code in the git version of Yap. It includes Prolog and C files. Download it by following the instruction in \url{http://www.ncc.up.pt/~vsc/Yap/downloads.html}.
+\texttt{cplint} is distributed in source code in the CVS version of Yap. It includes Prolog and C files. Download it by following the instruction in \url{http://www.ncc.up.pt/~vsc/Yap/downloads.html}.
-\texttt{cplint} requires cudd and glib-2.0.
-You can download cudd from \url{http://vlsi.colorado.edu/~fabio/CUDD/}.
+\texttt{cplint} requires \href{http://vlsi.colorado.edu/~fabio/CUDD/}{CUDD} and glib-2.0.
+You can download CUDD from \url{ftp://vlsi.colorado.edu/pub/cudd-2.4.2.tar.gz}.
You can download glib-2.0 (version $\geq 2.0$) from \url{http://www.gtk.org/}. This is a standard GNU package
so it is easy to install it using the package management software of your Linux or Cygwin
distribution.
-Compile cudd:
+Compile CUDD:
\begin{enumerate}
-\item downlad \texttt{cudd-2.4.2.tar.gz}
-\item decompress it
+\item decompress cudd-2.4.2.tar.gz
\item \texttt{cd cudd-2.4.2}
-\item check makefile options
-\item \texttt{make}
+\item see the \texttt{README} file for instructions on compilation
\end{enumerate}
Install Yap together with \texttt{cplint}:
-when compiling Yap following the instuction of the \texttt{INSTALL} file in the root of the Yap folder, use
+when compiling Yap following the instruction of the \texttt{INSTALL} file in the root of the Yap folder, use
\begin{verbatim}
configure --enable-cplint=DIR
\end{verbatim}
-Under Windows, you have to use Cygwin (glu does not compile under MinGW), so\\
+where \verb|DIR| is the directory where CUDD is, i.e., the directory ending with \texttt{cudd-2.4.2}.
+Under Windows, you have to use Cygwin (CUDD does not compile under MinGW), so\\
\begin{verbatim}
configure --enable-cplint=DIR --enable-cygwin
\end{verbatim}
-where \texttt{DIR} is the path to the directory \texttt{cudd-2.4.2} (including \texttt{cudd-2.4.2}).
After having performed \texttt{make install} you can do \texttt{make installcheck} that will execute a suite of tests of the various programs. If no error is reported you have a working installation of \texttt{cplint}.
\section{Syntax}
+LPAD and CP-logic programs consist of a set of annotated disjunctive clauses.
Disjunction in the head is represented with a semicolon and atoms in the head are separated from probabilities by a colon. For the rest, the usual syntax of Prolog is used.
For example, the CP-logic clause
$$h_1:p_1\vee \ldots \vee h_n:p_n\leftarrow b_1,\dots,b_m ,\neg c_1,\ldots,\neg c_l$$
@@ -127,10 +99,68 @@ toss(coin).
\end{verbatim}
The first clause states that if we toss a coin that is not biased it has equal probability of landing heads and tails. The second states that if the coin is biased it has a slightly higher probability of landing heads. The third states that the coin is fair with probability 0.9 and biased with probability 0.1 and the last clause states that we toss a coin with certainty.
+Moreover, the bodies of rules can contain the built-in predicates:
+\begin{verbatim}
+is/2, >/2, =/2 ,=/2
-=/2
-=.kb}: contains the example interpretations
+\item \texttt{):
Constraint logic programming for probabilistic knowledge. In Uncertainty
in Artificial Intelligence (UAI 2003), 2003.
+class="cmti-10">in Artificial Intelligence. Morgan Kaufmann, 2003.