-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtutorial_logic_programming.html
More file actions
270 lines (241 loc) · 28.6 KB
/
tutorial_logic_programming.html
File metadata and controls
270 lines (241 loc) · 28.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta charset="utf-8" />
<title>NeuroLang for Logic Programmers — neurolang 0.1.dev445+g118bfa5.d20201104 documentation</title>
<link rel="stylesheet" href="_static/bootstrap-sphinx.css" type="text/css" />
<link rel="stylesheet" href="_static/pygments.css" type="text/css" />
<link rel="stylesheet" type="text/css" href="_static/gallery.css" />
<link rel="stylesheet" type="text/css" href="_static/gallery-binder.css" />
<link rel="stylesheet" type="text/css" href="_static/gallery-dataframe.css" />
<script id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
<script src="_static/jquery.js"></script>
<script src="_static/underscore.js"></script>
<script src="_static/doctools.js"></script>
<script src="_static/language_data.js"></script>
<link rel="index" title="Index" href="genindex.html" />
<link rel="search" title="Search" href="search.html" />
<link rel="prev" title="neurolang.relational_algebra_provenance module" href="gen_api/neurolang.relational_algebra_provenance.html" />
<meta charset='utf-8'>
<meta http-equiv='X-UA-Compatible' content='IE=edge,chrome=1'>
<meta name='viewport' content='width=device-width, initial-scale=1.0, maximum-scale=1'>
<meta name="apple-mobile-web-app-capable" content="yes">
<script type="text/javascript" src="_static/js/jquery-1.11.0.min.js "></script>
<script type="text/javascript" src="_static/js/jquery-fix.js "></script>
<script type="text/javascript" src="_static/bootstrap-3.3.7/js/bootstrap.min.js "></script>
<script type="text/javascript" src="_static/bootstrap-sphinx.js "></script>
</head><body>
<div id="navbar" class="navbar navbar-default navbar-fixed-top">
<div class="container">
<div class="navbar-header">
<!-- .btn-navbar is used as the toggle for collapsed navbar content -->
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".nav-collapse">
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="index.html"><span><img src="_static/logo.png"></span>
neurolang</a>
<span class="navbar-text navbar-version pull-left"><b></b></span>
</div>
<div class="collapse navbar-collapse nav-collapse">
<ul class="nav navbar-nav">
<li><a href="tutorial.html">Tutorial</a></li>
<li><a href="examples/index.html">Gallery</a></li>
<li class="dropdown globaltoc-container">
<a role="button"
id="dLabelGlobalToc"
data-toggle="dropdown"
data-target="#"
href="index.html">Site <b class="caret"></b></a>
<ul class="dropdown-menu globaltoc"
role="menu"
aria-labelledby="dLabelGlobalToc"><ul class="current">
<li class="toctree-l1"><a class="reference internal" href="tutorial.html">Get Started with NeuroLang</a></li>
<li class="toctree-l1"><a class="reference internal" href="auto_examples/index.html">Examples of the NeuroLang language environment.</a></li>
<li class="toctree-l1"><a class="reference internal" href="api.html">User Guide</a></li>
<li class="toctree-l1"><a class="reference internal" href="api.html#indices-and-tables">Indices and tables</a></li>
<li class="toctree-l1 current"><a class="current reference internal" href="#">NeuroLang for Logic Programmers</a></li>
</ul>
</ul>
</li>
<li class="dropdown">
<a role="button"
id="dLabelLocalToc"
data-toggle="dropdown"
data-target="#"
href="#">Page <b class="caret"></b></a>
<ul class="dropdown-menu localtoc"
role="menu"
aria-labelledby="dLabelLocalToc"><ul>
<li><a class="reference internal" href="#">NeuroLang for Logic Programmers</a><ul>
<li><a class="reference internal" href="#using-datalog-embedded-in-python">Using Datalog Embedded in Python</a></li>
<li><a class="reference internal" href="#including-aggregations-and-builtin-functions">Including Aggregations and Builtin Functions</a></li>
<li><a class="reference internal" href="#adding-constraints-and-open-knowledge-rules">Adding Constraints and Open Knowledge Rules</a></li>
</ul>
</li>
</ul>
</ul>
</li>
</ul>
<form class="navbar-form navbar-right" action="search.html" method="get">
<div class="form-group">
<input type="text" name="q" class="form-control" placeholder="Search" />
</div>
<input type="hidden" name="check_keywords" value="yes" />
<input type="hidden" name="area" value="default" />
</form>
</div>
</div>
</div>
<div class="container">
<div class="row">
<div class="col-md-3">
<div id="sidebar" class="bs-sidenav" role="complementary"><ul>
<li><a class="reference internal" href="#">NeuroLang for Logic Programmers</a><ul>
<li><a class="reference internal" href="#using-datalog-embedded-in-python">Using Datalog Embedded in Python</a></li>
<li><a class="reference internal" href="#including-aggregations-and-builtin-functions">Including Aggregations and Builtin Functions</a></li>
<li><a class="reference internal" href="#adding-constraints-and-open-knowledge-rules">Adding Constraints and Open Knowledge Rules</a></li>
</ul>
</li>
</ul>
<form action="search.html" method="get">
<div class="form-group">
<input type="text" name="q" class="form-control" placeholder="Search" />
</div>
<input type="hidden" name="check_keywords" value="yes" />
<input type="hidden" name="area" value="default" />
</form>
</div>
</div>
<div class="body col-md-9 content" role="main">
<div class="section" id="neurolang-for-logic-programmers">
<h1>NeuroLang for Logic Programmers<a class="headerlink" href="#neurolang-for-logic-programmers" title="Permalink to this headline">¶</a></h1>
<p>NeuroLang is implemented over the basis of Datalog+/- with probabilistic extensions. In that there are two main frontend which might came useful: the <a href="#id3"><span class="problematic" id="id4">python_embedded_</span></a> frontend and the <a href="#id5"><span class="problematic" id="id6">datalog_</span></a> frontend</p>
<div class="section" id="using-datalog-embedded-in-python">
<h2>Using Datalog Embedded in Python<a class="headerlink" href="#using-datalog-embedded-in-python" title="Permalink to this headline">¶</a></h2>
<p>This requires a first step importing the NeuroLang frontend and initialising the class:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="kn">from</span> <span class="nn">neurolang</span> <span class="kn">import</span> <span class="n">frontend</span>
<span class="gp">>>> </span><span class="n">nl</span> <span class="o">=</span> <span class="n">frontend</span><span class="o">.</span><span class="n">NeurolangDL</span><span class="p">()</span>
</pre></div>
</div>
<p>Then, we can add some facts (connected) and rules (reachable):</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="k">with</span> <span class="n">nl</span><span class="o">.</span><span class="n">environment</span> <span class="k">as</span> <span class="n">e</span><span class="p">:</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">z</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">z</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span>
</pre></div>
</div>
<p>please note how the environment <a href="#id1"><span class="problematic" id="id2">:python:`e`</span></a> allows for the creation of logic programming symbols
dynamically.</p>
<p>With this we now have program loaded in memory which can be explored as:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="nb">print</span><span class="p">(</span><span class="n">nl</span><span class="o">.</span><span class="n">symbols</span><span class="p">[</span><span class="s1">'connected'</span><span class="p">])</span>
<span class="go">connected: typing.AbstractSet[typing.Tuple[int, int]] = [(0, 1), (1, 2), (2, 3)]</span>
<span class="gp">>>> </span><span class="k">for</span> <span class="n">rule</span> <span class="ow">in</span> <span class="n">nl</span><span class="o">.</span><span class="n">current_program</span><span class="p">:</span>
<span class="gp">... </span> <span class="nb">print</span><span class="p">(</span><span class="n">rule</span><span class="p">)</span>
<span class="go">reachable(x, y) ← connected(x, y)</span>
<span class="go">reachable(x, y) ← ( reachable(x, z) ) ∧ ( reachable(z, y) )</span>
</pre></div>
</div>
<p>Finally, we can solve the query:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="k">with</span> <span class="n">nl</span><span class="o">.</span><span class="n">environment</span> <span class="k">as</span> <span class="n">e</span><span class="p">:</span>
<span class="gp">... </span> <span class="n">res</span> <span class="o">=</span> <span class="n">nl</span><span class="o">.</span><span class="n">query</span><span class="p">((</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">),</span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">))</span>
<span class="gp">>>> </span><span class="nb">print</span><span class="p">(</span><span class="n">res</span><span class="p">)</span>
<span class="go"> 0 1</span>
<span class="go">0 0 1</span>
<span class="go">1 1 2</span>
<span class="go">2 2 3</span>
<span class="go">3 0 2</span>
<span class="go">4 1 3</span>
<span class="go">5 0 3</span>
</pre></div>
</div>
<p>Alternatively the <cite>connected</cite> table can be added more efficiently
from a tuple iterable or a <cite>numpy.array</cite> as follows:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="n">nl</span><span class="o">.</span><span class="n">add_tuple_set</span><span class="p">([(</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">),</span> <span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">)],</span> <span class="n">name</span><span class="o">=</span><span class="s1">'connected'</span><span class="p">)</span>
</pre></div>
</div>
</div>
<div class="section" id="including-aggregations-and-builtin-functions">
<h2>Including Aggregations and Builtin Functions<a class="headerlink" href="#including-aggregations-and-builtin-functions" title="Permalink to this headline">¶</a></h2>
<p>Suppose that now we want to obtain the number of destinations
reachable by each starting point. For this we need a new aggregation
function that counts the number of distinct elements. Specifically:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">Iterable</span>
<span class="gp">>>> </span><span class="kn">from</span> <span class="nn">neurolang</span> <span class="kn">import</span> <span class="n">frontend</span>
<span class="gp">>>> </span><span class="n">nl</span> <span class="o">=</span> <span class="n">frontend</span><span class="o">.</span><span class="n">NeurolangDL</span><span class="p">()</span>
<span class="gp">>>> </span><span class="n">nl</span><span class="o">.</span><span class="n">add_tuple_set</span><span class="p">([(</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">),</span> <span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">)],</span> <span class="n">name</span><span class="o">=</span><span class="s1">'connected'</span><span class="p">)</span>
<span class="gp">>>> </span><span class="nd">@nl</span><span class="o">.</span><span class="n">add_symbol</span>
<span class="gp">>>> </span><span class="k">def</span> <span class="nf">agg_count</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="n">Iterable</span><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span>
<span class="gp">>>> </span> <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="nb">set</span><span class="p">(</span><span class="n">x</span><span class="p">))</span>
<span class="gp">>>> </span><span class="k">with</span> <span class="n">nl</span><span class="o">.</span><span class="n">environment</span> <span class="k">as</span> <span class="n">e</span><span class="p">:</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">z</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">connected</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">z</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span>
</pre></div>
</div>
<p>This adds a new function <cite>agg_count</cite> to the NeuroLang interpreter,
any built-in or aggregation function is added in the same manner. Then,
we can then count all arrivals for starts <cite>0</cite> and <cite>1</cite>:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="k">with</span> <span class="n">nl</span><span class="o">.</span><span class="n">environment</span> <span class="k">as</span> <span class="n">e</span><span class="p">:</span>
<span class="gp">>>> </span> <span class="n">e</span><span class="o">.</span><span class="n">count_arrivals</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">agg_count</span><span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">)]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">reachable</span><span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">)</span>
<span class="gp">>>> </span> <span class="n">counts</span> <span class="o">=</span> <span class="n">nl</span><span class="o">.</span><span class="n">query</span><span class="p">((</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">c</span><span class="p">),</span> <span class="n">e</span><span class="o">.</span><span class="n">count_arrivals</span><span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">c</span><span class="p">)</span> <span class="o">&</span> <span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">x</span> <span class="o"><</span> <span class="mi">2</span><span class="p">))</span>
<span class="gp">>>> </span><span class="nb">print</span><span class="p">(</span><span class="n">counts</span><span class="p">)</span>
<span class="go"> 0 1</span>
<span class="go">0 0 3</span>
<span class="go">1 1 2</span>
</pre></div>
</div>
</div>
<div class="section" id="adding-constraints-and-open-knowledge-rules">
<h2>Adding Constraints and Open Knowledge Rules<a class="headerlink" href="#adding-constraints-and-open-knowledge-rules" title="Permalink to this headline">¶</a></h2>
<p>Neurolang also supports tuple-generating dependencies (TGDs).
We can say that a person is a parent if they have a child:</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="kn">from</span> <span class="nn">neurolang.frontend</span> <span class="kn">import</span> <span class="n">NeurolangPDL</span>
<span class="gp">>>> </span><span class="n">nl</span> <span class="o">=</span> <span class="n">NeurolangPDL</span><span class="p">()</span>
<span class="gp">>>> </span><span class="k">with</span> <span class="n">nl</span><span class="o">.</span><span class="n">environment</span> <span class="k">as</span> <span class="n">e</span><span class="p">:</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="s1">'John'</span><span class="p">,</span> <span class="s1">'Carl'</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="s1">'Mary'</span><span class="p">,</span> <span class="s1">'Carl'</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="s1">'Pat'</span><span class="p">,</span> <span class="s1">'Anna'</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="s1">'Anna'</span><span class="p">,</span> <span class="s1">'Pete'</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="o">...</span><span class="p">]</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="o">...</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span>
<span class="gp">... </span> <span class="n">nl</span><span class="o">.</span><span class="n">add_constraint</span><span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">],</span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">])</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">has_parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span>
<span class="gp">>>> </span><span class="n">res</span> <span class="o">=</span> <span class="n">nl</span><span class="o">.</span><span class="n">solve_all</span><span class="p">()</span>
<span class="gp">>>> </span><span class="nb">print</span><span class="p">(</span><span class="n">res</span><span class="p">)</span>
<span class="gp">>>> </span><span class="kn">from</span> <span class="nn">neurolang.frontend</span> <span class="kn">import</span> <span class="n">NeurolangPDL</span>
<span class="gp">>>> </span><span class="n">nl</span> <span class="o">=</span> <span class="n">NeurolangPDL</span><span class="p">()</span>
<span class="gp">>>> </span><span class="k">with</span> <span class="n">nl</span><span class="o">.</span><span class="n">environment</span> <span class="k">as</span> <span class="n">e</span><span class="p">:</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="s1">'Pat'</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="s1">'Chris'</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
<span class="gp">... </span> <span class="n">nl</span><span class="o">.</span><span class="n">add_constraint</span><span class="p">(</span><span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">],</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">])</span>
<span class="gp">... </span> <span class="n">e</span><span class="o">.</span><span class="n">has_grand_parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">person</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">x</span><span class="p">]</span> <span class="o">&</span> <span class="n">e</span><span class="o">.</span><span class="n">parent</span><span class="p">[</span><span class="n">e</span><span class="o">.</span><span class="n">z</span><span class="p">,</span> <span class="n">e</span><span class="o">.</span><span class="n">y</span><span class="p">]</span>
<span class="gp">>>> </span><span class="n">res</span> <span class="o">=</span> <span class="n">nl</span><span class="o">.</span><span class="n">solve_all</span><span class="p">()</span>
<span class="gp">>>> </span><span class="nb">print</span><span class="p">(</span><span class="n">res</span><span class="p">)</span>
</pre></div>
</div>
</div>
</div>
</div>
</div>
</div>
<footer class="footer">
<div class="container">
<p class="pull-right">
<a href="#">Back to top</a>
<br/>
<div id="sourcelink">
<a href="_sources/tutorial_logic_programming.rst.txt"
rel="nofollow">Source</a>
</div>
</p>
<p>
© Copyright 2017, Demian Wassermann.<br/>
Created using <a href="http://sphinx-doc.org/">Sphinx</a> 2.4.4.<br/>
</p>
</div>
</footer>
</body>
</html>