Main text adapted to beamer

Francisco Coelho
1 parent 8ccb9631
Showing 170 changed files with 28980 additions and 0 deletions Show diff stats
README.pdf
biblio/00-reading/2008 | ANNOTATED | Cognitive Technologies | Logical and relational learning with 10 tables | Luc De Raedt | Springer.pdf
biblio/00-reading/2022 | plingo 2206.11515.pdf
biblio/00-reading/21245-Article Text-25258-1-2-20220628.pdf
biblio/00-reading/3534678.3542609.pdf
biblio/00-reading/AIC-2022-camera-ready-full-paper-19.pdf
biblio/00-reading/ANNOTATED | The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference | Fabio Gagliardi Cozman, Denis Deratani Mauá | 2020.pdf
biblio/00-reading/algorithms-15-00201-v3.pdf
biblio/Interpretable Machine Learning with Python Learn to build interpretable high-performance models with hands-on real-world examples by Masís, Serg (z-lib.org).pdf
biblio/Meta-Level Abduction.pdf
biblio/asp/ASP-CORE-2.01c.pdf
biblio/asp/Answer Set Programming in a Nutshell | Thomas Eiter | 2008.pdf
biblio/asp/Answer set solving in practice.pdf
biblio/asp/Complexity results for probabilistic answer set programming | Maua D, Cozman F | 2020
biblio/asp/Conflict-driven answer set solving: From theory to practice.pdf
biblio/asp/Experiencing Answer Set Programming at Work - Today and Tomorrow | Torsten Schaub.pdf
biblio/asp/FastLAS_Scalable_Inductive_Logic_Programming_ETC | 2020.pdf
biblio/asp/Inductive learning of answer set programs.pdf
biblio/asp/Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub - Answer Set Solving in Practice-Morgan & Claypool (2013).pdf
biblio/asp/ON THE FOUNDATIONS OF GROUNDING IN ASP | 2021.pdf
@@ -0,0 +1,5 @@
+burglary;-burglary. % 0.1::
+earthquake;-earthquake. % 0.01::
+
+alarm:- burglary.
+alarm;-alarm :- earthquake. % 0.8::
 \ No newline at end of file
@@ -0,0 +1,2 @@
+q.
+p :- q, not r.
 \ No newline at end of file
@@ -0,0 +1 @@
+p :- -p.
 \ No newline at end of file
@@ -0,0 +1,4 @@
+person(joey).
+%married(X); -married(X) :- person(X).
+male(X); female(X) :- person(X).
+bachelor(X) :- male(X), not married(X).
 \ No newline at end of file
@@ -0,0 +1,6 @@
+person(joey).
+% male(X); female(X) :- person(X).
+male(X) :- person(X).
+female(X) :- person(X).
+
+bachelor(X) :- male(X), \+ married(X).
 \ No newline at end of file
@@ -0,0 +1,11 @@
+{ a ; b }.
+
+% Answer: 1
+%
+% Answer: 2
+% b
+% Answer: 3
+% a
+% Answer: 4
+% a b
+% SATISFIABLE
 \ No newline at end of file
@@ -0,0 +1,9 @@
+a ; b.
+
+% Answer: 1
+% b
+% Answer: 2
+% a 
+% SATISFIABLE
+%
+% In Answer 2 we (also) have not b.
 \ No newline at end of file
@@ -0,0 +1,10 @@
+{ a ; b }.
+:- a, not b.
+
+% Answer: 1
+%
+% Answer: 2
+% b
+% Answer: 3
+% a b
+% SATISFIABLE
 \ No newline at end of file
@@ -0,0 +1,5 @@
+a ; b.
+:- a, not b.
+% Answer: 1
+% b
+% SATISFIABLE
 \ No newline at end of file
@@ -0,0 +1,8 @@
+{ a ; -a }.
+:- a, not -a.
+
+% Answer: 1
+%
+% Answer: 2
+% -a
+% SATISFIABLE
@@ -0,0 +1,5 @@
+a ; -a.
+:- a, not -a.
+% Answer: 1
+% -a
+% SATISFIABLE
 \ No newline at end of file
@@ -0,0 +1,15 @@
+node(1..6).
+
+edge(1,2). edge(2,4). edge(3,1).
+edge(4,1). edge(5,3). edge(6,2).
+edge(1,3). edge(2,5). edge(3,4).
+edge(4,2). edge(5,4). edge(6,3).
+edge(1,4). edge(2,6). edge(3,5).
+edge(5,6). edge(6,5).
+
+col(r). col(b). col(g).
+
+1 { color(X,C) : col(C)} 1 :- node(X).
+:- edge(X,Y), color(X,C), color(Y,C).
+
+#show color/2.
 \ No newline at end of file
@@ -0,0 +1,4 @@
+a ; -a.
+
+s :- not w, not a.
+w :- not s.
 \ No newline at end of file
@@ -0,0 +1,9 @@
+% p :- not p.   % UNSAT
+% not p :- p.   % SAT: {}
+% p :- -p.      % SAT: {}
+% -p :- p.      % SAT: {}
+% not p :- -p.  % SAT: {}
+% -p :- not p.  % SAT: -p
+a :- b.
+b :- a.
+a :- not a.
 \ No newline at end of file
@@ -0,0 +1,14 @@
+a :- b.
+a :- \+ a.
+b :- a.
+% > swipl cyclic.pl
+% ERROR: /home/fc/sci/projetos/plp/code/asp/cyclic.pl:2:
+% ERROR:    Stack limit (1.0Gb) exceeded
+% ERROR:      Stack sizes: local: 1.0Gb, global: 27Kb, trail: 1Kb
+% ERROR:      Stack depth: 7,455,777, last-call: 0%, Choice points: 7,455,758
+% ERROR:      Probable infinite recursion (cycle):
+% ERROR:        [7,455,777] user:p
+% ERROR:        [7,455,776] user:p
+% Warning: /home/fc/sci/projetos/plp/code/asp/cyclic.pl:2:
+% Warning:    Goal (directive) failed: user:p
+%
 \ No newline at end of file
@@ -0,0 +1,42 @@
+%not not a.
+%% UNSATISFIABLE
+%%% ie no models.
+
+% a.
+%% Answer: 1
+%% a
+%% SATISFIABLE
+%%% ie there is (only) one (stable) model: {a}
+
+% -a.
+%% Answer: 1
+%% -a
+%% SATISFIABLE
+
+% --a. 
+%% *** ERROR: (clingo): parsing failed
+%%% WTF?
+
+% not a.
+%% Answer: 1
+%% 
+%% SATISFIABLE
+%%% ie there is (only) one (stable) model: {} 
+%%%
+%%% this program states that there is no information. In particular, there is no information about a.
+%%% Therefore there are no provable atoms. Hence the empty set is a stable model.
+
+% not -a.
+%% Answer: 1
+%% 
+%% SATISFIABLE
+
+% b.
+% a;c.
+% not a :- b.
+%% Answer: 1
+%% b -a
+%% SATISFIABLE
+
+a.
+b :- not a.
 \ No newline at end of file
@@ -0,0 +1,3 @@
+p(a) :- not p(b).
+p(b) :- not p(a).
+:- p(b).
 \ No newline at end of file
@@ -0,0 +1,9 @@
+col(r ; g ; b).
+
+% var C is local in this rule.
+% More specificlly, it is bound to the (lhs) cardinality contraint.
+% Also, it varies over all instantiations of col(C).
+1 { color(X, C) : col(C) } 1 :- node(X).
+:- edge(X, Y), color(X, C), color(Y, C).
+
+#show color/2.
 \ No newline at end of file
@@ -0,0 +1,8 @@
+node(1 .. 6).
+
+edge(1 ,2). edge(2 ,4). edge(3 ,1).
+edge(4 ,1). edge(5 ,3). edge(6 ,2).
+edge(1 ,3). edge(2 ,5). edge(3 ,4).
+edge(4 ,2). edge(5 ,4).
+edge(6 ,3). edge(1 ,4). edge(2 ,6).
+edge(3 ,5). edge(5 ,6). edge(6 ,5).
 \ No newline at end of file
@@ -0,0 +1 @@
+a :- not a.
 \ No newline at end of file
...	...	@@ -0,0 +1,5 @@
	1	+burglary;-burglary. % 0.1::
	2	+earthquake;-earthquake. % 0.01::
	3	+
	4	+alarm:- burglary.
	5	+alarm;-alarm :- earthquake. % 0.8::
0	6	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,2 @@
	1	+q.
	2	+p :- q, not r.
0	3	\ No newline at end of file
...	...
...	...	@@ -0,0 +1 @@
	1	+p :- -p.
0	2	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,4 @@
	1	+person(joey).
	2	+%married(X); -married(X) :- person(X).
	3	+male(X); female(X) :- person(X).
	4	+bachelor(X) :- male(X), not married(X).
0	5	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,6 @@
	1	+person(joey).
	2	+% male(X); female(X) :- person(X).
	3	+male(X) :- person(X).
	4	+female(X) :- person(X).
	5	+
	6	+bachelor(X) :- male(X), \+ married(X).
0	7	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,11 @@
	1	+{ a ; b }.
	2	+
	3	+% Answer: 1
	4	+%
	5	+% Answer: 2
	6	+% b
	7	+% Answer: 3
	8	+% a
	9	+% Answer: 4
	10	+% a b
	11	+% SATISFIABLE
0	12	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,9 @@
	1	+a ; b.
	2	+
	3	+% Answer: 1
	4	+% b
	5	+% Answer: 2
	6	+% a
	7	+% SATISFIABLE
	8	+%
	9	+% In Answer 2 we (also) have not b.
0	10	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,10 @@
	1	+{ a ; b }.
	2	+:- a, not b.
	3	+
	4	+% Answer: 1
	5	+%
	6	+% Answer: 2
	7	+% b
	8	+% Answer: 3
	9	+% a b
	10	+% SATISFIABLE
0	11	\ No newline at end of file
...	...
...	...	@@ -0,0 +1,8 @@
	1	+{ a ; -a }.
	2	+:- a, not -a.
	3	+
	4	+% Answer: 1
	5	+%
	6	+% Answer: 2
	7	+% -a
	8	+% SATISFIABLE
...	...
...	...	@@ -0,0 +1,5 @@
	1	+a ; -a.
	2	+:- a, not -a.
	3	+% Answer: 1
	4	+% -a
	5	+% SATISFIABLE
0	6	\ No newline at end of file
...	...