From b43c061c4d3c5750c9a9a1f7c0d170266ba78556 Mon Sep 17 00:00:00 2001 From: Francisco Coelho Date: Tue, 8 Nov 2022 17:34:31 +0000 Subject: [PATCH] rewriting 00_PASP for scholarship project --- README.md | 4 +++- SCASP-best-practices.pdf | Bin 0 -> 88835 bytes msc/Empty File | 0 task_01/proposal.md | 6 +++--- text/00_PASP.aux | 153 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++--------------------------------------------------------- text/00_PASP.fdb_latexmk | 27 ++++++++++++++++++--------- text/00_PASP.fls | 61 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++-- text/00_PASP.log | 195 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++--------------------------------------------------------------------------------------- text/00_PASP.nav | 82 +++++++++++++++++++++++++++++++++++++++++++++++++++++----------------------------- text/00_PASP.out | 12 +++++++----- text/00_PASP.pdf | Bin 76286 -> 0 bytes text/00_PASP.snm | 24 +++++++++++++----------- text/00_PASP.synctex.gz | Bin 67096 -> 0 bytes text/00_PASP.tex | 378 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++--------------------------------------------------------------------------------------------------------------------------------------------- text/00_PASP.toc | 10 ++++++---- text/00_PASP.xdv | Bin 100300 -> 0 bytes 16 files changed, 603 insertions(+), 349 deletions(-) create mode 100644 SCASP-best-practices.pdf create mode 100644 msc/Empty File diff --git a/README.md b/README.md index f9a8b2f..86c88ba 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,7 @@ # Probabilistic ILP +**Check** Conformal prediction. + > Fonte: [Turning 30: New Ideas in Inductive Logic Programming](https://arxiv.org/abs/2002.11002) ## Introduction @@ -62,4 +64,4 @@ Recursion; Predicate Invention; Higher order, ASP Hypotheses; Optimality; Prolog ## Applications -### ELearning \ No newline at end of file +### ELearning diff --git a/SCASP-best-practices.pdf b/SCASP-best-practices.pdf new file mode 100644 index 0000000..ea0feef Binary files /dev/null and b/SCASP-best-practices.pdf differ diff --git a/msc/Empty File b/msc/Empty File new file mode 100644 index 0000000..e69de29 --- /dev/null +++ b/msc/Empty File diff --git a/task_01/proposal.md b/task_01/proposal.md index 09cc04b..6c04164 100644 --- a/task_01/proposal.md +++ b/task_01/proposal.md @@ -6,7 +6,7 @@ Answer Set Programming (ASP) is a logic programming paradigm based on the Stable Model semantics of Normal Logic Programs (NP) that can be implemented using the latest advances in SAT solving technology. ASP is a truly declarative language that supports language constructs such as disjunction in the head of a clause, choice rules, and hard and weak constraints. -The Distribution Semantics (DS) is a key approach to extend logical representations with probabilistic reasoning. Probabilistic Facts (PF) are the most basic stochastic DS primitive and they take the form of logical facts labelled with a probability $p$; Each probabilistic fact represents a boolean random variable that is true with probability $p$ and false with probability $1 − p$. +The Distribution Semantics (DS) is a key approach to extend logical representations with probabilistic reasoning. Probabilistic Facts (PF) are the most basic stochastic DS primitive and they take the form of logical facts labeled with a probability $p$; Each probabilistic fact represents a boolean random variable that is true with probability $p$ and false with probability $1 − p$. Crucially, a joint distribution of atoms derived from an ASP specification can be used to _quantitatively measure the performance of that specification_ given data observed from the system it is intended to describe. Then, given competing specifications to describe a certain system, these performance measures can be applied in various optimization techniques in order to obtain one that best describes the target system. @@ -36,7 +36,7 @@ A team of two **(or three?)** researchers and a graduate student, working over s - The formalization of the methods outlined above including the parameter estimation from observations and the joint distribution extending the probabilities of the stable models. - Application and evaluation of this approach to well-known problems, using available software tools, such as - Problems: **Assim, de momento, não me lembro de nenhum!** - - Software tools: [`s(casp)`](https://ciao-lang.org/playground/scasp.html), Potassco suit, _etc._ + - Software tools: [`s(casp)`](https://ciao-lang.org/playground/scasp.html), [Potassco suit](https://potassco.org/), _etc._ ## References @@ -44,4 +44,4 @@ A team of two **(or three?)** researchers and a graduate student, working over s 2. Andrew Cropper, Sebastijan Dumancic, Richard Evans, Stephen H. Muggleton, Inductive logic programming at 30 (2021) 3. Fabio Gagliardi Cozman, Denis Deratani Mauá, The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference (2020) 4. Fabrizio Riguzzi, Foundations of Probabilistic Logic Programming Languages, Semantics, Inference and Learning. Rivers Publishers (2018) -6. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub, Answer Set Solving in Practice, Morgan & Claypool Publishers (2013) \ No newline at end of file +6. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub, Answer Set Solving in Practice, Morgan & Claypool Publishers (2013) diff --git a/text/00_PASP.aux b/text/00_PASP.aux index 3d02a36..415b822 100644 --- a/text/00_PASP.aux +++ b/text/00_PASP.aux @@ -29,14 +29,6 @@ \@writefile{nav}{\headcommand {\slideentry {1}{0}{2}{3/3}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {3}{3}}} \HyPL@Entry{3<>} -\newlabel{prop:lucases.a}{{1}{4}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {prop:lucases.a}{4}} -\newlabel{prop:lucases.b}{{2}{4}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {prop:lucases.b}{4}} -\newlabel{prop:lucases.c}{{3}{4}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {prop:lucases.c}{4}} -\newlabel{prop:lucases.d}{{4}{4}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {prop:lucases.d}{4}} \@writefile{nav}{\headcommand {\slideentry {1}{0}{3}{4/4}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {4}{4}}} \HyPL@Entry{4<>} @@ -48,79 +40,126 @@ \@writefile{nav}{\headcommand {\slideentry {1}{0}{5}{6/6}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {6}{6}}} \HyPL@Entry{6<>} +\newlabel{prop:unique.ext.tcsm}{{7}{7}{Introduction}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {prop:unique.ext.tcsm}{7}} \@writefile{nav}{\headcommand {\slideentry {1}{0}{6}{7/7}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {7}{7}}} \HyPL@Entry{7<>} -\@writefile{nav}{\headcommand {\slideentry {1}{0}{7}{8/8}{}{0}}} +\@writefile{toc}{\beamer@sectionintoc {2}{Motivation}{8}{0}{2}} +\@writefile{nav}{\headcommand {\beamer@sectionpages {2}{7}}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {2}{7}}} +\@writefile{nav}{\headcommand {\sectionentry {2}{Motivation}{8}{Motivation}{0}}} +\@writefile{nav}{\headcommand {\slideentry {2}{0}{1}{8/8}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {8}{8}}} \HyPL@Entry{8<>} -\@writefile{snm}{\beamer@slide {def:w.inconsistent}{9}} -\newlabel{def:w.inconsistent}{{2}{9}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {eq:prob.sm}{9}} -\newlabel{eq:prob.sm}{{3}{9}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {def:w.disj}{9}} -\newlabel{def:w.disj}{{4}{9}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {def:w.conj}{9}} -\newlabel{def:w.conj}{{5}{9}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {def:w.empty}{9}} -\newlabel{def:w.empty}{{6}{9}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {eq:def.prob}{9}} -\newlabel{eq:def.prob}{{7}{9}{Introduction}{Doc-Start}{}} -\@writefile{snm}{\beamer@slide {eq:def.prob.event}{9}} -\newlabel{eq:def.prob.event}{{8}{9}{Introduction}{Doc-Start}{}} -\@writefile{nav}{\headcommand {\slideentry {1}{0}{8}{9/9}{}{0}}} +\@writefile{nav}{\headcommand {\slideentry {2}{0}{2}{9/9}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {9}{9}}} \HyPL@Entry{9<>} -\@writefile{toc}{\beamer@sectionintoc {2}{Cases \& Examples}{10}{0}{2}} -\@writefile{nav}{\headcommand {\beamer@sectionpages {2}{9}}} -\@writefile{nav}{\headcommand {\beamer@subsectionpages {2}{9}}} -\@writefile{nav}{\headcommand {\sectionentry {2}{Cases \& Examples}{10}{Cases \& Examples}{0}}} -\@writefile{toc}{\beamer@subsectionintoc {2}{1}{Programs with disjunctive heads}{10}{0}{2}} -\@writefile{nav}{\headcommand {\beamer@subsectionpages {10}{9}}} -\@writefile{nav}{\headcommand {\beamer@subsectionentry {0}{2}{1}{10}{Programs with disjunctive heads}}} -\@writefile{nav}{\headcommand {\slideentry {2}{1}{1}{10/10}{Programs with disjunctive heads}{0}}} +\@writefile{toc}{\beamer@sectionintoc {3}{Resolution}{10}{0}{3}} +\@writefile{nav}{\headcommand {\beamer@sectionpages {8}{9}}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {8}{9}}} +\@writefile{nav}{\headcommand {\sectionentry {3}{Resolution}{10}{Resolution}{0}}} +\@writefile{nav}{\headcommand {\slideentry {3}{0}{1}{10/10}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {10}{10}}} \HyPL@Entry{10<>} -\@writefile{nav}{\headcommand {\slideentry {2}{1}{2}{11/11}{Programs with disjunctive heads}{0}}} +\newlabel{prop:lucases}{{11}{11}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {prop:lucases}{11}} +\newlabel{prop:lucases.a}{{1}{11}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {prop:lucases.a}{11}} +\newlabel{prop:lucases.b}{{2}{11}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {prop:lucases.b}{11}} +\newlabel{prop:lucases.c}{{3}{11}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {prop:lucases.c}{11}} +\newlabel{prop:lucases.d}{{4}{11}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {prop:lucases.d}{11}} +\@writefile{nav}{\headcommand {\slideentry {3}{0}{2}{11/11}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {11}{11}}} \HyPL@Entry{11<>} -\@writefile{nav}{\headcommand {\slideentry {2}{1}{3}{12/12}{Programs with disjunctive heads}{0}}} +\@writefile{nav}{\headcommand {\slideentry {3}{0}{3}{12/12}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {12}{12}}} \HyPL@Entry{12<>} -\@writefile{nav}{\headcommand {\slideentry {2}{1}{4}{13/13}{Programs with disjunctive heads}{0}}} +\@writefile{snm}{\beamer@slide {def:w.inconsistent}{13}} +\newlabel{def:w.inconsistent}{{2}{13}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {eq:prob.sm}{13}} +\newlabel{eq:prob.sm}{{3}{13}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {def:w.disj}{13}} +\newlabel{def:w.disj}{{4}{13}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {def:w.conj}{13}} +\newlabel{def:w.conj}{{5}{13}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {def:w.empty}{13}} +\newlabel{def:w.empty}{{6}{13}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {eq:def.prob}{13}} +\newlabel{eq:def.prob}{{7}{13}{Resolution}{Doc-Start}{}} +\@writefile{snm}{\beamer@slide {eq:def.prob.event}{13}} +\newlabel{eq:def.prob.event}{{8}{13}{Resolution}{Doc-Start}{}} +\@writefile{nav}{\headcommand {\slideentry {3}{0}{4}{13/13}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {13}{13}}} \HyPL@Entry{13<>} -\@writefile{toc}{\beamer@subsectionintoc {2}{2}{Non-stratified programs}{14}{0}{2}} +\@writefile{toc}{\beamer@sectionintoc {4}{Cases \& Examples}{14}{0}{4}} +\@writefile{nav}{\headcommand {\beamer@sectionpages {10}{13}}} \@writefile{nav}{\headcommand {\beamer@subsectionpages {10}{13}}} -\@writefile{nav}{\headcommand {\beamer@subsectionentry {0}{2}{2}{14}{Non-stratified programs}}} -\@writefile{nav}{\headcommand {\slideentry {2}{2}{1}{14/14}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\sectionentry {4}{Cases \& Examples}{14}{Cases \& Examples}{0}}} +\@writefile{nav}{\headcommand {\slideentry {4}{0}{1}{14/14}{}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {14}{14}}} \HyPL@Entry{14<>} -\@writefile{nav}{\headcommand {\slideentry {2}{2}{2}{15/15}{Non-stratified programs}{0}}} +\@writefile{toc}{\beamer@subsectionintoc {4}{1}{Programs with disjunctive heads}{15}{0}{4}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {14}{14}}} +\@writefile{nav}{\headcommand {\beamer@subsectionentry {0}{4}{1}{15}{Programs with disjunctive heads}}} +\@writefile{nav}{\headcommand {\slideentry {4}{1}{1}{15/15}{Programs with disjunctive heads}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {15}{15}}} \HyPL@Entry{15<>} -\@writefile{nav}{\headcommand {\slideentry {2}{2}{3}{16/16}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\slideentry {4}{1}{2}{16/16}{Programs with disjunctive heads}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {16}{16}}} \HyPL@Entry{16<>} -\@writefile{nav}{\headcommand {\slideentry {2}{2}{4}{17/17}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\slideentry {4}{1}{3}{17/17}{Programs with disjunctive heads}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {17}{17}}} \HyPL@Entry{17<>} -\@writefile{toc}{\beamer@sectionintoc {3}{Conclusions}{18}{0}{3}} -\@writefile{nav}{\headcommand {\beamer@sectionpages {10}{17}}} -\@writefile{nav}{\headcommand {\beamer@subsectionpages {14}{17}}} -\@writefile{nav}{\headcommand {\sectionentry {3}{Conclusions}{18}{Conclusions}{0}}} -\@writefile{nav}{\headcommand {\slideentry {3}{0}{1}{18/18}{}{0}}} +\@writefile{nav}{\headcommand {\slideentry {4}{1}{4}{18/18}{Programs with disjunctive heads}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {18}{18}}} \HyPL@Entry{18<>} -\@writefile{nav}{\headcommand {\beamer@sectionpages {18}{18}}} -\@writefile{nav}{\headcommand {\beamer@subsectionpages {18}{18}}} -\@writefile{nav}{\headcommand {\sectionentry {4}{ASP \& related definitions}{19}{ASP \& related definitions}{0}}} -\@writefile{nav}{\headcommand {\slideentry {4}{0}{1}{19/19}{}{0}}} +\@writefile{nav}{\headcommand {\slideentry {4}{1}{5}{19/19}{Programs with disjunctive heads}{0}}} \@writefile{nav}{\headcommand {\beamer@framepages {19}{19}}} -\@writefile{nav}{\headcommand {\beamer@partpages {1}{19}}} -\@writefile{nav}{\headcommand {\beamer@subsectionpages {19}{19}}} -\@writefile{nav}{\headcommand {\beamer@sectionpages {19}{19}}} -\@writefile{nav}{\headcommand {\beamer@documentpages {19}}} -\@writefile{nav}{\headcommand {\gdef \inserttotalframenumber {19}}} -\newlabel{TotPages}{{19}{19}{}{page.19}{}} -\gdef \@abspage@last{19} +\HyPL@Entry{19<>} +\@writefile{toc}{\beamer@subsectionintoc {4}{2}{Non-stratified programs}{20}{0}{4}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {15}{19}}} +\@writefile{nav}{\headcommand {\beamer@subsectionentry {0}{4}{2}{20}{Non-stratified programs}}} +\@writefile{nav}{\headcommand {\slideentry {4}{2}{1}{20/20}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {20}{20}}} +\HyPL@Entry{20<>} +\@writefile{nav}{\headcommand {\slideentry {4}{2}{2}{21/21}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {21}{21}}} +\HyPL@Entry{21<>} +\@writefile{nav}{\headcommand {\slideentry {4}{2}{3}{22/22}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {22}{22}}} +\HyPL@Entry{22<>} +\@writefile{nav}{\headcommand {\slideentry {4}{2}{4}{23/23}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {23}{23}}} +\HyPL@Entry{23<>} +\@writefile{nav}{\headcommand {\slideentry {4}{2}{5}{24/24}{Non-stratified programs}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {24}{24}}} +\HyPL@Entry{24<>} +\@writefile{toc}{\beamer@sectionintoc {5}{Conclusions}{25}{0}{5}} +\@writefile{nav}{\headcommand {\beamer@sectionpages {14}{24}}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {20}{24}}} +\@writefile{nav}{\headcommand {\sectionentry {5}{Conclusions}{25}{Conclusions}{0}}} +\@writefile{nav}{\headcommand {\slideentry {5}{0}{1}{25/25}{}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {25}{25}}} +\HyPL@Entry{25<>} +\@writefile{nav}{\headcommand {\slideentry {5}{0}{2}{26/26}{}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {26}{26}}} +\HyPL@Entry{26<>} +\@writefile{nav}{\headcommand {\beamer@sectionpages {25}{26}}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {25}{26}}} +\@writefile{nav}{\headcommand {\sectionentry {6}{ASP \& related definitions}{27}{ASP \& related definitions}{0}}} +\@writefile{nav}{\headcommand {\slideentry {6}{0}{1}{27/27}{}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {27}{27}}} +\HyPL@Entry{27<>} +\@writefile{nav}{\headcommand {\slideentry {6}{0}{2}{28/28}{}{0}}} +\@writefile{nav}{\headcommand {\beamer@framepages {28}{28}}} +\@writefile{nav}{\headcommand {\beamer@partpages {1}{28}}} +\@writefile{nav}{\headcommand {\beamer@subsectionpages {27}{28}}} +\@writefile{nav}{\headcommand {\beamer@sectionpages {27}{28}}} +\@writefile{nav}{\headcommand {\beamer@documentpages {28}}} +\@writefile{nav}{\headcommand {\gdef \inserttotalframenumber {28}}} +\newlabel{TotPages}{{28}{28}{}{page.28}{}} +\gdef \@abspage@last{28} diff --git a/text/00_PASP.fdb_latexmk b/text/00_PASP.fdb_latexmk index b77e945..fd7b141 100644 --- a/text/00_PASP.fdb_latexmk +++ b/text/00_PASP.fdb_latexmk @@ -1,10 +1,10 @@ # Fdb version 3 -["xdvipdfmx"] 1663582707 "00_PASP.xdv" "00_PASP.pdf" "00_PASP" 1663582708 - "00_PASP.xdv" 1663582707 100300 6dd1844da1890e1cb7b5c7dad010f731 "xelatex" +["xdvipdfmx"] 1667928801 "00_PASP.xdv" "00_PASP.pdf" "00_PASP" 1667928802 + "00_PASP.xdv" 1667928801 200932 982c61eac8b5d4d97d7ddad987e569ae "xelatex" (generated) "00_PASP.pdf" -["xelatex"] 1663582702 "/home/fc/sci/projetos/zugzwang/text/00_PASP.tex" "00_PASP.xdv" "00_PASP" 1663582708 - "/home/fc/sci/projetos/zugzwang/text/00_PASP.tex" 1663582702 24211 60f6eac8176f95783413aef5958f7e49 "" +["xelatex"] 1667928794 "/home/fc/sci/projetos/zugzwang/text/00_PASP.tex" "00_PASP.xdv" "00_PASP" 1667928802 + "/home/fc/sci/projetos/zugzwang/text/00_PASP.tex" 1667928794 29667 8d68ac0db717033678db2dd1c81ee58c "" "/usr/share/texmf-dist/fonts/map/fontname/texfonts.map" 1650183167 3524 cb3e574dea2d1052e39280babc910dc8 "" "/usr/share/texmf-dist/fonts/tfm/adobe/zapfding/pzdr.tfm" 1650183167 1528 f853c4d1b4e0550255e02831fdc8496f "" "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm" 1650183167 1004 54797486969f23fa377b128694d548df "" @@ -24,6 +24,11 @@ "/usr/share/texmf-dist/fonts/tfm/public/cm/cmsy10.tfm" 1650183167 1124 6c73e740cf17375f03eec0ee63599741 "" "/usr/share/texmf-dist/fonts/tfm/public/cm/cmsy6.tfm" 1650183167 1116 933a60c408fc0a863a92debe84b2d294 "" "/usr/share/texmf-dist/fonts/tfm/public/cm/cmsy8.tfm" 1650183167 1120 8b7d695260f3cff42e636090a8002094 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr10.tfm" 1650183167 12056 7e13df7fe4cbce21b072ba7c4f4deb6e "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr5.tfm" 1650183167 12020 46464c854bf317de2a7a0bbe4a1160ca "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr6.tfm" 1650183167 12048 c1068d0f4772be9b0ec447692e1d6d82 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr7.tfm" 1650183167 12064 09aa3eeac96bf141d673bb1b0385ce55 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr8.tfm" 1650183167 12064 a35db870f0b76c338d749c56dc030ef5 "" "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss10.tfm" 1650183167 11176 53ebf7a171df1f9447b387b178768bb5 "" "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss12.tfm" 1650183167 11232 955a7245396175d9219648eadc654ac9 "" "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss8.tfm" 1650183167 11180 705632ac6b4fb69204ad970192cdf4e5 "" @@ -152,6 +157,7 @@ "/usr/share/texmf-dist/tex/latex/beamer/beamerbasetwoscreens.sty" 1650183167 1808 098e1772761e9b4a016e74f1a4c1cb74 "" "/usr/share/texmf-dist/tex/latex/beamer/beamerbaseverbatim.sty" 1650183167 4026 1ba2c6a2acf275d63cb85d60d8597fe8 "" "/usr/share/texmf-dist/tex/latex/beamer/beamercolorthemedefault.sty" 1650183167 7089 c34bc77851d46db7348b94bd5e51168a "" + "/usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty" 1650183167 853 82dd210288d1106dcf8014b257a62279 "" "/usr/share/texmf-dist/tex/latex/beamer/beamerfontthemedefault.sty" 1650183167 4236 21e590075d6781cc58fee783316ee268 "" "/usr/share/texmf-dist/tex/latex/beamer/beamericonarticle.20.pdf" 1650183167 2958 4e0c4a6e994e5c4d9da11c477e927f0f "" "/usr/share/texmf-dist/tex/latex/beamer/beamericonarticle.pdf" 1650183167 2936 6cc3ef0682cbb62be8aa1b19f0a84ed6 "" @@ -159,6 +165,7 @@ "/usr/share/texmf-dist/tex/latex/beamer/beamericonbook.pdf" 1650183167 2667 7624351b441ffe4bd2d14e08fbcf063d "" "/usr/share/texmf-dist/tex/latex/beamer/beamericononline.20.pdf" 1650183167 24451 195d2c060e84f339954bc6d9b52131d7 "" "/usr/share/texmf-dist/tex/latex/beamer/beamericononline.pdf" 1650183167 24611 df07010540266b2b205b492a4d02e7e1 "" + "/usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty" 1650183167 402 e195c2bcc25433d9ad026b309024fcf9 "" "/usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemedefault.sty" 1650183167 13080 71b38252cbe3d689bcd03161d205eb84 "" "/usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty" 1650183167 6946 ef0e875be97ab827b5cf3232042f1628 "" "/usr/share/texmf-dist/tex/latex/beamer/beamerthemedefault.sty" 1650183167 355 75c98e7b8f427eb7c625ed391b140c5b "" @@ -188,6 +195,7 @@ "/usr/share/texmf-dist/tex/latex/kvoptions/kvoptions.sty" 1650183167 22521 d2fceb764a442a2001d257ef11db7618 "" "/usr/share/texmf-dist/tex/latex/l3backend/l3backend-xetex.def" 1650183167 35763 558b6bb076dfa9b058fe5c58dc6e0434 "" "/usr/share/texmf-dist/tex/latex/letltxmacro/letltxmacro.sty" 1650183167 5766 13a9e8766c47f30327caf893ece86ac8 "" + "/usr/share/texmf-dist/tex/latex/lm/t1lmr.fd" 1650183167 1867 996fe743d88a01aca041ed22cc10e1bb "" "/usr/share/texmf-dist/tex/latex/lm/t1lmss.fd" 1650183167 1641 f48673bce41ac279099d0c9523459753 "" "/usr/share/texmf-dist/tex/latex/oberdiek/ifdraft.sty" 1650183167 1922 5bdcc31b0573e5e7f31c36f1b88b6a7d "" "/usr/share/texmf-dist/tex/latex/pdfpc/pdfpc.sty" 1650181202 5526 5ffff551ead72b2c156114adf6316943 "" @@ -217,11 +225,12 @@ "/usr/share/texmf-dist/tex/latex/url/url.sty" 1650183167 12796 8edb7d69a20b857904dd0ea757c14ec9 "" "/usr/share/texmf-dist/tex/latex/xcolor/xcolor.sty" 1650183167 56029 3f7889dab51d620aa43177c391b7b190 "" "/usr/share/texmf-dist/web2c/texmf.cnf" 1650183167 39911 2da6c67557ec033436fe5418a70a8a61 "" - "/var/lib/texmf/web2c/xetex/xelatex.fmt" 1654344976 5825171 e62f6c4589d7283e8c8de6756069bec1 "" - "00_PASP.aux" 1663582707 7268 adbb9f14f355de15c9b3f2df744fdf69 "xelatex" - "00_PASP.nav" 1663582707 3084 b065ef1bdebdad806819ade4b85012b9 "xelatex" - "00_PASP.out" 1663582707 911 9b6b412061f6aef8474f584f8fed2350 "xelatex" - "00_PASP.tex" 1663582702 24211 60f6eac8176f95783413aef5958f7e49 "" + "/var/lib/texmf/web2c/xetex/xelatex.fmt" 1667607223 5825155 acc75abcaf8e6f881414fa8770610f6c "" + "00_PASP.aux" 1667928801 9634 8e144a491304a1dcf0003771d7f89fb7 "xelatex" + "00_PASP.nav" 1667928801 4276 4edecfe6ebd3d4b2e818cd376272e5e4 "xelatex" + "00_PASP.out" 1667928801 1097 fd2c5e9a9165683b5658636d6bb611e1 "xelatex" + "00_PASP.tex" 1667928794 29667 8d68ac0db717033678db2dd1c81ee58c "" + "00_PASP.toc" 1667928801 383 bceb83a7e3f28815a9defb8c90b2016a "xelatex" "Pabc_alpha03.pdf" 1663331875 12659 e50124c327299028f63ecb501d23eb0d "" (generated) "00_PASP.aux" diff --git a/text/00_PASP.fls b/text/00_PASP.fls index 3bd959c..0e54667 100644 --- a/text/00_PASP.fls +++ b/text/00_PASP.fls @@ -1064,6 +1064,28 @@ INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty +INPUT /usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty INPUT /usr/share/texmf-dist/tex/latex/pdfpc/pdfpc.sty INPUT /usr/share/texmf-dist/tex/latex/pdfpc/pdfpc.sty INPUT /usr/share/texmf-dist/tex/latex/pdfpc/pdfpc.sty @@ -1384,6 +1406,11 @@ INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss12.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss8.tfm OUTPUT 00_PASP.xdv +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss10.tfm +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/cm/cmss10.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/cm/cmss8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/cm/cmss8.tfm @@ -1414,11 +1441,19 @@ INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmsso10.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmsso8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmsso8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmssbx10.tfm -INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss8.tfm -INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss10.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr6.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/cm/cmss10.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/cm/cmss8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/cm/cmss8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr5.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm @@ -1433,10 +1468,32 @@ INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmsso10.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmsso8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmsso8.tfm INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmssbo10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmss12.tfm +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmssbx10.tfm +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc INPUT ./Pabc_alpha03.pdf INPUT ./Pabc_alpha03.pdf INPUT Pabc_alpha03.pdf +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc +INPUT ./00_PASP.toc +INPUT 00_PASP.toc +INPUT 00_PASP.toc OUTPUT 00_PASP.nav OUTPUT 00_PASP.toc OUTPUT 00_PASP.snm diff --git a/text/00_PASP.log b/text/00_PASP.log index e9ed6b7..37be4db 100644 --- a/text/00_PASP.log +++ b/text/00_PASP.log @@ -1,4 +1,4 @@ -This is XeTeX, Version 3.141592653-2.6-0.999994 (TeX Live 2022/Arch Linux) (preloaded format=xelatex 2022.6.4) 19 SEP 2022 11:18 +This is XeTeX, Version 3.141592653-2.6-0.999994 (TeX Live 2022/Arch Linux) (preloaded format=xelatex 2022.11.5) 8 NOV 2022 17:33 entering extended mode \write18 enabled. file:line:error style messages enabled. @@ -525,7 +525,7 @@ Package: amsthm 2020/05/29 v2.20.6 ) (/usr/share/texmf-dist/tex/latex/beamer/beamerbasethemes.sty)) (/usr/share/texmf-dist/tex/latex/beamer/beamerthemedefault.sty (/usr/share/texmf-dist/tex/latex/beamer/beamerfontthemedefault.sty) (/usr/share/texmf-dist/tex/latex/beamer/beamercolorthemedefault.sty) (/usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemedefault.sty \beamer@dima=\dimen290 \beamer@dimb=\dimen291 -) (/usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty))) (/usr/share/texmf-dist/tex/latex/pdfpc/pdfpc.sty +) (/usr/share/texmf-dist/tex/latex/beamer/beamerouterthemedefault.sty))) (/usr/share/texmf-dist/tex/latex/beamer/beamercolorthemerose.sty) (/usr/share/texmf-dist/tex/latex/beamer/beamerinnerthemecircles.sty) (/usr/share/texmf-dist/tex/latex/pdfpc/pdfpc.sty Package: pdfpc 2021/02/06 v0.6.0 PDFPC (/usr/share/texmf-dist/tex/generic/xstring/xstring.sty (/usr/share/texmf-dist/tex/generic/xstring/xstring.tex \integerpart=\count332 @@ -608,7 +608,7 @@ LaTeX Font Info: Trying to load font information for T1+lmss on input line 11 (/usr/share/texmf-dist/tex/latex/lm/t1lmss.fd File: t1lmss.fd 2015/05/01 v1.6.1 Font defs for Latin Modern )) -Package hyperref Info: Option `colorlinks' set `true' on input line 18. +Package hyperref Info: Option `colorlinks' set `true' on input line 34. (/usr/share/texmf-dist/tex/latex/l3backend/l3backend-xetex.def File: l3backend-xetex.def 2022-04-14 L3 backend support: XeTeX \l__color_backend_stack_int=\count343 @@ -621,30 +621,30 @@ File: l3backend-xetex.def 2022-04-14 L3 backend support: XeTeX ) (./00_PASP.aux) \openout1 = `00_PASP.aux'. -LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 45. -LaTeX Font Info: Trying to load font information for TS1+cmr on input line 45. +LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 64. +LaTeX Font Info: Trying to load font information for TS1+cmr on input line 64. (/usr/share/texmf-dist/tex/latex/base/ts1cmr.fd File: ts1cmr.fd 2019/12/16 v2.5j Standard LaTeX font definitions ) -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for TU/lmr/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. -LaTeX Font Info: Checking defaults for PU/pdf/m/n on input line 45. -LaTeX Font Info: ... okay on input line 45. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for TU/lmr/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. +LaTeX Font Info: Checking defaults for PU/pdf/m/n on input line 64. +LaTeX Font Info: ... okay on input line 64. *geometry* driver: auto-detecting *geometry* detected driver: xetex @@ -680,7 +680,7 @@ LaTeX Font Info: ... okay on input line 45. * \@reversemarginfalse * (1in=72.27pt=25.4mm, 1cm=28.453pt) -Package hyperref Info: Link coloring ON on input line 45. +Package hyperref Info: Link coloring ON on input line 64. (/usr/share/texmf-dist/tex/latex/hyperref/nameref.sty Package: nameref 2021-04-02 v2.47 Cross-referencing by name of section (/usr/share/texmf-dist/tex/latex/refcount/refcount.sty @@ -690,55 +690,55 @@ Package: gettitlestring 2019/12/15 v1.6 Cleanup title references (HO) ) \c@section@level=\count349 ) -LaTeX Info: Redefining \ref on input line 45. -LaTeX Info: Redefining \pageref on input line 45. -LaTeX Info: Redefining \nameref on input line 45. +LaTeX Info: Redefining \ref on input line 64. +LaTeX Info: Redefining \pageref on input line 64. +LaTeX Info: Redefining \nameref on input line 64. (./00_PASP.out) (./00_PASP.out) \@outlinefile=\write5 \openout5 = `00_PASP.out'. LaTeX Font Info: Overwriting symbol font `operators' in version `normal' -(Font) OT1/cmr/m/n --> OT1/cmss/m/n on input line 45. +(Font) OT1/cmr/m/n --> OT1/cmss/m/n on input line 64. LaTeX Font Info: Overwriting symbol font `operators' in version `bold' -(Font) OT1/cmr/bx/n --> OT1/cmss/b/n on input line 45. +(Font) OT1/cmr/bx/n --> OT1/cmss/b/n on input line 64. \symnumbers=\mathgroup6 \sympureletters=\mathgroup7 LaTeX Font Info: Overwriting math alphabet `\mathrm' in version `normal' -(Font) OT1/cmss/m/n --> T1/lmr/m/n on input line 45. -LaTeX Font Info: Redeclaring math alphabet \mathbf on input line 45. +(Font) OT1/cmss/m/n --> T1/lmr/m/n on input line 64. +LaTeX Font Info: Redeclaring math alphabet \mathbf on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `normal' -(Font) OT1/cmr/bx/n --> T1/lmss/b/n on input line 45. +(Font) OT1/cmr/bx/n --> T1/lmss/b/n on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `bold' -(Font) OT1/cmr/bx/n --> T1/lmss/b/n on input line 45. -LaTeX Font Info: Redeclaring math alphabet \mathsf on input line 45. +(Font) OT1/cmr/bx/n --> T1/lmss/b/n on input line 64. +LaTeX Font Info: Redeclaring math alphabet \mathsf on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `normal' -(Font) OT1/cmss/m/n --> T1/lmss/m/n on input line 45. +(Font) OT1/cmss/m/n --> T1/lmss/m/n on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `bold' -(Font) OT1/cmss/bx/n --> T1/lmss/m/n on input line 45. -LaTeX Font Info: Redeclaring math alphabet \mathit on input line 45. +(Font) OT1/cmss/bx/n --> T1/lmss/m/n on input line 64. +LaTeX Font Info: Redeclaring math alphabet \mathit on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathit' in version `normal' -(Font) OT1/cmr/m/it --> T1/lmss/m/it on input line 45. +(Font) OT1/cmr/m/it --> T1/lmss/m/it on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathit' in version `bold' -(Font) OT1/cmr/bx/it --> T1/lmss/m/it on input line 45. -LaTeX Font Info: Redeclaring math alphabet \mathtt on input line 45. +(Font) OT1/cmr/bx/it --> T1/lmss/m/it on input line 64. +LaTeX Font Info: Redeclaring math alphabet \mathtt on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `normal' -(Font) OT1/cmtt/m/n --> T1/lmtt/m/n on input line 45. +(Font) OT1/cmtt/m/n --> T1/lmtt/m/n on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `bold' -(Font) OT1/cmtt/m/n --> T1/lmtt/m/n on input line 45. +(Font) OT1/cmtt/m/n --> T1/lmtt/m/n on input line 64. LaTeX Font Info: Overwriting symbol font `numbers' in version `bold' -(Font) T1/lmss/m/n --> T1/lmss/b/n on input line 45. +(Font) T1/lmss/m/n --> T1/lmss/b/n on input line 64. LaTeX Font Info: Overwriting symbol font `pureletters' in version `bold' -(Font) T1/lmss/m/it --> T1/lmss/b/it on input line 45. +(Font) T1/lmss/m/it --> T1/lmss/b/it on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathrm' in version `bold' -(Font) OT1/cmss/b/n --> T1/lmr/b/n on input line 45. +(Font) OT1/cmss/b/n --> T1/lmr/b/n on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `bold' -(Font) T1/lmss/b/n --> T1/lmss/b/n on input line 45. +(Font) T1/lmss/b/n --> T1/lmss/b/n on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `bold' -(Font) T1/lmss/m/n --> T1/lmss/b/n on input line 45. +(Font) T1/lmss/m/n --> T1/lmss/b/n on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathit' in version `bold' -(Font) T1/lmss/m/it --> T1/lmss/b/it on input line 45. +(Font) T1/lmss/m/it --> T1/lmss/b/it on input line 64. LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `bold' -(Font) T1/lmtt/m/n --> T1/lmtt/b/n on input line 45. +(Font) T1/lmtt/m/n --> T1/lmtt/b/n on input line 64. (/usr/share/texmf-dist/tex/latex/translator/translator-basic-dictionary-English.dict Dictionary: translator-basic-dictionary, Language: English ) (/usr/share/texmf-dist/tex/latex/translator/translator-bibliography-dictionary-English.dict @@ -753,91 +753,112 @@ Dictionary: translator-numbers-dictionary, Language: English Dictionary: translator-theorem-dictionary, Language: English ) (./00_PASP.nav) [1.1 +] (./00_PASP.toc) [2.2 + ] -LaTeX Font Info: Trying to load font information for U+msa on input line 65. +LaTeX Font Info: Trying to load font information for U+msa on input line 89. (/usr/share/texmf-dist/tex/latex/amsfonts/umsa.fd File: umsa.fd 2013/01/14 v3.01 AMS symbols A ) -LaTeX Font Info: Trying to load font information for U+msb on input line 65. +LaTeX Font Info: Trying to load font information for U+msb on input line 89. (/usr/share/texmf-dist/tex/latex/amsfonts/umsb.fd File: umsb.fd 2013/01/14 v3.01 AMS symbols B ) LaTeX Font Info: Font shape `T1/lmss/m/it' in size <10.95> not available -(Font) Font shape `T1/lmss/m/sl' tried instead on input line 65. +(Font) Font shape `T1/lmss/m/sl' tried instead on input line 89. LaTeX Font Info: Font shape `T1/lmss/m/it' in size <8> not available -(Font) Font shape `T1/lmss/m/sl' tried instead on input line 65. +(Font) Font shape `T1/lmss/m/sl' tried instead on input line 89. LaTeX Font Info: Font shape `T1/lmss/m/it' in size <6> not available -(Font) Font shape `T1/lmss/m/sl' tried instead on input line 65. - [2.2 +(Font) Font shape `T1/lmss/m/sl' tried instead on input line 89. +LaTeX Font Info: Trying to load font information for T1+lmr on input line 89. + (/usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +File: t1lmr.fd 2015/05/01 v1.6.1 Font defs for Latin Modern +) [3.3 ] LaTeX Font Info: Font shape `T1/lmss/m/it' in size <10> not available -(Font) Font shape `T1/lmss/m/sl' tried instead on input line 86. +(Font) Font shape `T1/lmss/m/sl' tried instead on input line 121. LaTeX Font Info: Font shape `T1/lmss/m/it' in size <7> not available -(Font) Font shape `T1/lmss/m/sl' tried instead on input line 86. +(Font) Font shape `T1/lmss/m/sl' tried instead on input line 121. LaTeX Font Info: Font shape `T1/lmss/m/it' in size <5> not available -(Font) Font shape `T1/lmss/m/sl' tried instead on input line 86. - [3.3 - -] [4.4 +(Font) Font shape `T1/lmss/m/sl' tried instead on input line 121. + [4.4 ] [5.5 ] LaTeX Font Info: Font shape `T1/lmss/bx/it' in size <10.95> not available -(Font) Font shape `T1/lmss/bx/sl' tried instead on input line 133. +(Font) Font shape `T1/lmss/bx/sl' tried instead on input line 162. [6.6 ] [7.7 -] [8.8 +] (./00_PASP.toc) [8.8 + +] [9.9 + +] (./00_PASP.toc) [10.10 + +] [11.11 + +] [12.12 ] -Overfull \hbox (24.92613pt too wide) detected at line 236 +Overfull \hbox (18.42326pt too wide) detected at line 335 [][] [] -Overfull \vbox (448.34027pt too high) detected at line 236 +Overfull \vbox (448.34027pt too high) detected at line 335 [] -[9.9 +[13.13 -] [10.10 +] (./00_PASP.toc) [14.14 -] [11.11 +] (./00_PASP.toc) [15.15 + +] [16.16 + +] [17.17 ] -Overfull \hbox (81.56876pt too wide) in paragraph at lines 340--340 +Overfull \hbox (81.56876pt too wide) in paragraph at lines 439--439 [] [] -[12.12 +[18.18 ] File: Pabc_alpha03.pdf Graphic file (type pdf) -Overfull \vbox (479.67523pt too high) detected at line 399 +Overfull \vbox (479.67523pt too high) detected at line 498 [] -[13.13 +[19.19 -] [14.14 +] (./00_PASP.toc) [20.20 -] [15.15 +] [21.21 -] [16.16 +] [22.22 -] [17.17 +] [23.23 + +] [24.24 + +] (./00_PASP.toc) [25.25 -] [18.18 +] [26.26 + +] (./00_PASP.toc) [27.27 ] -Overfull \vbox (411.79784pt too high) detected at line 538 +Overfull \vbox (411.79784pt too high) detected at line 633 [] -[19.19 +[28.28 ] \tf@nav=\write6 @@ -855,15 +876,15 @@ File: se-pdfdoc.def 2019/11/29 v1.12 stringenc: PDFDocEncoding File: se-utf32be.def 2019/11/29 v1.12 stringenc: UTF-32BE ) (./00_PASP.aux) Package rerunfilecheck Info: File `00_PASP.out' has not changed. -(rerunfilecheck) Checksum: 9B6B412061F6AEF8474F584F8FED2350;911. +(rerunfilecheck) Checksum: FD2C5E9A9165683B5658636D6BB611E1;1097. ) Here is how much of TeX's memory you used: - 26087 strings out of 476156 - 513363 string characters out of 5814964 - 820401 words of memory out of 5000000 - 46325 multiletter control sequences out of 15000+600000 - 524235 words of font info for 77 fonts, out of 8000000 for 9000 + 26341 strings out of 476156 + 520395 string characters out of 5814963 + 832651 words of memory out of 5000000 + 46549 multiletter control sequences out of 15000+600000 + 544952 words of font info for 84 fonts, out of 8000000 for 9000 1348 hyphenation exceptions out of 8191 128i,11n,122p,908b,32766s stack positions out of 5000i,500n,10000p,200000b,80000s -Output written on 00_PASP.xdv (19 pages, 100300 bytes). +Output written on 00_PASP.xdv (28 pages, 200932 bytes). diff --git a/text/00_PASP.nav b/text/00_PASP.nav index 9463f04..36906f9 100644 --- a/text/00_PASP.nav +++ b/text/00_PASP.nav @@ -15,45 +15,69 @@ \headcommand {\beamer@framepages {6}{6}} \headcommand {\slideentry {1}{0}{6}{7/7}{}{0}} \headcommand {\beamer@framepages {7}{7}} -\headcommand {\slideentry {1}{0}{7}{8/8}{}{0}} +\headcommand {\beamer@sectionpages {2}{7}} +\headcommand {\beamer@subsectionpages {2}{7}} +\headcommand {\sectionentry {2}{Motivation}{8}{Motivation}{0}} +\headcommand {\slideentry {2}{0}{1}{8/8}{}{0}} \headcommand {\beamer@framepages {8}{8}} -\headcommand {\slideentry {1}{0}{8}{9/9}{}{0}} +\headcommand {\slideentry {2}{0}{2}{9/9}{}{0}} \headcommand {\beamer@framepages {9}{9}} -\headcommand {\beamer@sectionpages {2}{9}} -\headcommand {\beamer@subsectionpages {2}{9}} -\headcommand {\sectionentry {2}{Cases \& Examples}{10}{Cases \& Examples}{0}} -\headcommand {\beamer@subsectionpages {10}{9}} -\headcommand {\beamer@subsectionentry {0}{2}{1}{10}{Programs with disjunctive heads}} -\headcommand {\slideentry {2}{1}{1}{10/10}{Programs with disjunctive heads}{0}} +\headcommand {\beamer@sectionpages {8}{9}} +\headcommand {\beamer@subsectionpages {8}{9}} +\headcommand {\sectionentry {3}{Resolution}{10}{Resolution}{0}} +\headcommand {\slideentry {3}{0}{1}{10/10}{}{0}} \headcommand {\beamer@framepages {10}{10}} -\headcommand {\slideentry {2}{1}{2}{11/11}{Programs with disjunctive heads}{0}} +\headcommand {\slideentry {3}{0}{2}{11/11}{}{0}} \headcommand {\beamer@framepages {11}{11}} -\headcommand {\slideentry {2}{1}{3}{12/12}{Programs with disjunctive heads}{0}} +\headcommand {\slideentry {3}{0}{3}{12/12}{}{0}} \headcommand {\beamer@framepages {12}{12}} -\headcommand {\slideentry {2}{1}{4}{13/13}{Programs with disjunctive heads}{0}} +\headcommand {\slideentry {3}{0}{4}{13/13}{}{0}} \headcommand {\beamer@framepages {13}{13}} +\headcommand {\beamer@sectionpages {10}{13}} \headcommand {\beamer@subsectionpages {10}{13}} -\headcommand {\beamer@subsectionentry {0}{2}{2}{14}{Non-stratified programs}} -\headcommand {\slideentry {2}{2}{1}{14/14}{Non-stratified programs}{0}} +\headcommand {\sectionentry {4}{Cases \& Examples}{14}{Cases \& Examples}{0}} +\headcommand {\slideentry {4}{0}{1}{14/14}{}{0}} \headcommand {\beamer@framepages {14}{14}} -\headcommand {\slideentry {2}{2}{2}{15/15}{Non-stratified programs}{0}} +\headcommand {\beamer@subsectionpages {14}{14}} +\headcommand {\beamer@subsectionentry {0}{4}{1}{15}{Programs with disjunctive heads}} +\headcommand {\slideentry {4}{1}{1}{15/15}{Programs with disjunctive heads}{0}} \headcommand {\beamer@framepages {15}{15}} -\headcommand {\slideentry {2}{2}{3}{16/16}{Non-stratified programs}{0}} +\headcommand {\slideentry {4}{1}{2}{16/16}{Programs with disjunctive heads}{0}} \headcommand {\beamer@framepages {16}{16}} -\headcommand {\slideentry {2}{2}{4}{17/17}{Non-stratified programs}{0}} +\headcommand {\slideentry {4}{1}{3}{17/17}{Programs with disjunctive heads}{0}} \headcommand {\beamer@framepages {17}{17}} -\headcommand {\beamer@sectionpages {10}{17}} -\headcommand {\beamer@subsectionpages {14}{17}} -\headcommand {\sectionentry {3}{Conclusions}{18}{Conclusions}{0}} -\headcommand {\slideentry {3}{0}{1}{18/18}{}{0}} +\headcommand {\slideentry {4}{1}{4}{18/18}{Programs with disjunctive heads}{0}} \headcommand {\beamer@framepages {18}{18}} -\headcommand {\beamer@sectionpages {18}{18}} -\headcommand {\beamer@subsectionpages {18}{18}} -\headcommand {\sectionentry {4}{ASP \& related definitions}{19}{ASP \& related definitions}{0}} -\headcommand {\slideentry {4}{0}{1}{19/19}{}{0}} +\headcommand {\slideentry {4}{1}{5}{19/19}{Programs with disjunctive heads}{0}} \headcommand {\beamer@framepages {19}{19}} -\headcommand {\beamer@partpages {1}{19}} -\headcommand {\beamer@subsectionpages {19}{19}} -\headcommand {\beamer@sectionpages {19}{19}} -\headcommand {\beamer@documentpages {19}} -\headcommand {\gdef \inserttotalframenumber {19}} +\headcommand {\beamer@subsectionpages {15}{19}} +\headcommand {\beamer@subsectionentry {0}{4}{2}{20}{Non-stratified programs}} +\headcommand {\slideentry {4}{2}{1}{20/20}{Non-stratified programs}{0}} +\headcommand {\beamer@framepages {20}{20}} +\headcommand {\slideentry {4}{2}{2}{21/21}{Non-stratified programs}{0}} +\headcommand {\beamer@framepages {21}{21}} +\headcommand {\slideentry {4}{2}{3}{22/22}{Non-stratified programs}{0}} +\headcommand {\beamer@framepages {22}{22}} +\headcommand {\slideentry {4}{2}{4}{23/23}{Non-stratified programs}{0}} +\headcommand {\beamer@framepages {23}{23}} +\headcommand {\slideentry {4}{2}{5}{24/24}{Non-stratified programs}{0}} +\headcommand {\beamer@framepages {24}{24}} +\headcommand {\beamer@sectionpages {14}{24}} +\headcommand {\beamer@subsectionpages {20}{24}} +\headcommand {\sectionentry {5}{Conclusions}{25}{Conclusions}{0}} +\headcommand {\slideentry {5}{0}{1}{25/25}{}{0}} +\headcommand {\beamer@framepages {25}{25}} +\headcommand {\slideentry {5}{0}{2}{26/26}{}{0}} +\headcommand {\beamer@framepages {26}{26}} +\headcommand {\beamer@sectionpages {25}{26}} +\headcommand {\beamer@subsectionpages {25}{26}} +\headcommand {\sectionentry {6}{ASP \& related definitions}{27}{ASP \& related definitions}{0}} +\headcommand {\slideentry {6}{0}{1}{27/27}{}{0}} +\headcommand {\beamer@framepages {27}{27}} +\headcommand {\slideentry {6}{0}{2}{28/28}{}{0}} +\headcommand {\beamer@framepages {28}{28}} +\headcommand {\beamer@partpages {1}{28}} +\headcommand {\beamer@subsectionpages {27}{28}} +\headcommand {\beamer@sectionpages {27}{28}} +\headcommand {\beamer@documentpages {28}} +\headcommand {\gdef \inserttotalframenumber {28}} diff --git a/text/00_PASP.out b/text/00_PASP.out index 435540a..4935b14 100644 --- a/text/00_PASP.out +++ b/text/00_PASP.out @@ -1,6 +1,8 @@ \BOOKMARK [2][]{Outline0.1}{\376\377\000I\000n\000t\000r\000o\000d\000u\000c\000t\000i\000o\000n}{}% 1 -\BOOKMARK [2][]{Outline0.2}{\376\377\000C\000a\000s\000e\000s\000\040\000\046\000\040\000E\000x\000a\000m\000p\000l\000e\000s}{}% 2 -\BOOKMARK [3][]{Outline0.2.1.10}{\376\377\000P\000r\000o\000g\000r\000a\000m\000s\000\040\000w\000i\000t\000h\000\040\000d\000i\000s\000j\000u\000n\000c\000t\000i\000v\000e\000\040\000h\000e\000a\000d\000s}{Outline0.2}% 3 -\BOOKMARK [3][]{Outline0.2.2.14}{\376\377\000N\000o\000n\000-\000s\000t\000r\000a\000t\000i\000f\000i\000e\000d\000\040\000p\000r\000o\000g\000r\000a\000m\000s}{Outline0.2}% 4 -\BOOKMARK [2][]{Outline0.3}{\376\377\000C\000o\000n\000c\000l\000u\000s\000i\000o\000n\000s}{}% 5 -\BOOKMARK [2][]{Outline0.4}{\376\377\000A\000S\000P\000\040\000\046\000\040\000r\000e\000l\000a\000t\000e\000d\000\040\000d\000e\000f\000i\000n\000i\000t\000i\000o\000n\000s}{}% 6 +\BOOKMARK [2][]{Outline0.2}{\376\377\000M\000o\000t\000i\000v\000a\000t\000i\000o\000n}{}% 2 +\BOOKMARK [2][]{Outline0.3}{\376\377\000R\000e\000s\000o\000l\000u\000t\000i\000o\000n}{}% 3 +\BOOKMARK [2][]{Outline0.4}{\376\377\000C\000a\000s\000e\000s\000\040\000\046\000\040\000E\000x\000a\000m\000p\000l\000e\000s}{}% 4 +\BOOKMARK [3][]{Outline0.4.1.15}{\376\377\000P\000r\000o\000g\000r\000a\000m\000s\000\040\000w\000i\000t\000h\000\040\000d\000i\000s\000j\000u\000n\000c\000t\000i\000v\000e\000\040\000h\000e\000a\000d\000s}{Outline0.4}% 5 +\BOOKMARK [3][]{Outline0.4.2.20}{\376\377\000N\000o\000n\000-\000s\000t\000r\000a\000t\000i\000f\000i\000e\000d\000\040\000p\000r\000o\000g\000r\000a\000m\000s}{Outline0.4}% 6 +\BOOKMARK [2][]{Outline0.5}{\376\377\000C\000o\000n\000c\000l\000u\000s\000i\000o\000n\000s}{}% 7 +\BOOKMARK [2][]{Outline0.6}{\376\377\000A\000S\000P\000\040\000\046\000\040\000r\000e\000l\000a\000t\000e\000d\000\040\000d\000e\000f\000i\000n\000i\000t\000i\000o\000n\000s}{}% 8 diff --git a/text/00_PASP.pdf b/text/00_PASP.pdf index 2072180..c5512a5 100644 Binary files a/text/00_PASP.pdf and b/text/00_PASP.pdf differ diff --git a/text/00_PASP.snm b/text/00_PASP.snm index f07ad09..14041bc 100644 --- a/text/00_PASP.snm +++ b/text/00_PASP.snm @@ -1,12 +1,14 @@ -\beamer@slide {prop:lucases.a}{4} -\beamer@slide {prop:lucases.b}{4} -\beamer@slide {prop:lucases.c}{4} -\beamer@slide {prop:lucases.d}{4} \beamer@slide {eq:prob.tc}{5} -\beamer@slide {def:w.inconsistent}{9} -\beamer@slide {eq:prob.sm}{9} -\beamer@slide {def:w.disj}{9} -\beamer@slide {def:w.conj}{9} -\beamer@slide {def:w.empty}{9} -\beamer@slide {eq:def.prob}{9} -\beamer@slide {eq:def.prob.event}{9} +\beamer@slide {prop:unique.ext.tcsm}{7} +\beamer@slide {prop:lucases}{11} +\beamer@slide {prop:lucases.a}{11} +\beamer@slide {prop:lucases.b}{11} +\beamer@slide {prop:lucases.c}{11} +\beamer@slide {prop:lucases.d}{11} +\beamer@slide {def:w.inconsistent}{13} +\beamer@slide {eq:prob.sm}{13} +\beamer@slide {def:w.disj}{13} +\beamer@slide {def:w.conj}{13} +\beamer@slide {def:w.empty}{13} +\beamer@slide {eq:def.prob}{13} +\beamer@slide {eq:def.prob.event}{13} diff --git a/text/00_PASP.synctex.gz b/text/00_PASP.synctex.gz index 590c8d0..636ba77 100644 Binary files a/text/00_PASP.synctex.gz and b/text/00_PASP.synctex.gz differ diff --git a/text/00_PASP.tex b/text/00_PASP.tex index ca3e700..7ffc136 100644 --- a/text/00_PASP.tex +++ b/text/00_PASP.tex @@ -1,9 +1,25 @@ \documentclass{beamer} - +%------------------------------------------ +\usecolortheme{rose} +%------------------------------------------ +\useinnertheme{circles} +%------------------------------------------ \setbeamertemplate{navigation symbols}{} -\setbeamertemplate{itemize items}[circle] - - +%------------------------------------------ +\AtBeginSection{ + \begin{frame}\small + \tableofcontents[currentsection,subsectionstyle=shaded/shaded/hide] + \end{frame} +} +%------------------------------------------ +\AtBeginSubsection{ + \begin{frame}\small + \tableofcontents[ + currentsection,sectionstyle=shaded/shaded, + currentsubsection,subsectionstyle=show/shaded/hide] + \end{frame} +} +%------------------------------------------ \usepackage[overridenote]{pdfpc} \usepackage{tikz} @@ -28,142 +44,225 @@ \newcommand{\deft}[1]{\textbf{#1}} \newcommand{\pset}[1]{\ensuremath{\mathbb{P}\at{#1}}} \newcommand{\ent}{\ensuremath{\lhd}} +\newcommand{\cset}[2]{\ensuremath{\set{#1,~#2}}} \newcommand{\langof}[1]{\ensuremath{\fml{L}\at{#1}}} \newcommand{\uset}[1]{\ensuremath{\left|{#1}\right>}} \newcommand{\lset}[1]{\ensuremath{\left<{#1}\right|}} +\newcommand{\pr}[1]{\ensuremath{\mathrm{p}\at{#1}}} % % Identificação deste documento % \title{Zugzwang} -\subtitle{Stochastic Adventures in Inductive Logic Specifications} +\subtitle{Stochastic Adventures in Inductive Logic} \author{Francisco Coelho} \institute[\texttt{fc@uevora.pt}]{ - Departamento de Informática\\ - Universidade de Évora + Departamento de Informática, Universidade de Évora\\ + High Performance Computing Chair\\ + NOVA-LINCS } \begin{document} % \begin{frame}[plain] \titlepage -\note{The goal of this text is to **explore how ASP specifications with probabilistic facts** can lead to characterizations of the **joint distributions** of the specification's atoms.} \end{frame} \section{Introduction} \begin{frame}{Notation and Assumptions} - \note{We start with **common notations and assumptions**.} + % -------------------------------- \begin{itemize} - \item The \textbf{complement} of $x$ is $\co{x} = 1 - x$. - \item A \textbf{probabilistic atomic choice} $\alpha:a$ defines the disjunction $a \lor \neg a$ and assigns probabilities $P\at{a} = \alpha, P\at{\neg a} = \co{\alpha}$. - \item $\delta a$ denotes the \textbf{disjunction} $a \lor \neg a$ associated to the probabilistic choice $\alpha : a$ and $\delta\! \set{\alpha: a, a \in A} = \set{\delta a, a \in A}$ for any set of atoms $A$. - \item We adopt the the \textbf{closed world assumption}, where $\naf x \models \neg x$. - \item And also assume that \textbf{probabilistic choices} and \textbf{subgoals} are iid. + % -------------------------------- + \item $\co{x} = 1 - x$. + % -------------------------------- + \item \textbf{Probabilistic Atomic Choice (PAC):} $\alpha :: a$ defines $a \lor \neg a$ and probabilities $\pr{a} = \alpha, \pr{\neg a} = \co{\alpha}$. + % -------------------------------- + \item $\delta a$ denotes $a \lor \neg a$ and $\delta\! \set{\alpha :: a, a \in \fml{A}} = \set{\delta a, a \in \fml{A}}$ for a set of atoms $\fml{A}$. + % -------------------------------- + \item \textbf{Closed World Assumption:} $\naf x \models \neg x$. + % -------------------------------- + % \item Probabilistic choices and sub-goals are independent. + % -------------------------------- \end{itemize} - \note{**Subgoals are IID** means that ???} + % -------------------------------- \end{frame} - +% ================================================================ \begin{frame}{General Setting} - \note{Next, we consider the following **general setting**} - Let $\fml{A}$ be a set of \textbf{atoms}, $\overline{\fml{A}} = \set{\neg a \middle| a \in \fml{A}}$ and $\fml{Z}$ the respective set of \textbf{observations}, - $$\fml{Z} = \set{z = \alpha \cup \beta \middle| \alpha \subseteq \fml{A} \land \beta \subseteq \overline{\fml{A}} }$$ and $\fml{I}$ the set of consistent observations or \textbf{interpretations}, $$\fml{I} = \set{z \in \fml{Z} \middle| \forall a \in \fml{A}~\abs{ \set{a, \neg a} \cap z} \leq 1}.$$ + % -------------------------------- \begin{itemize} - \item A \textbf{PASP program} is $P = C \land F \land R$ where - - \begin{itemize} - \item $C = C_P = \set{\alpha_i : a_i \middle| i = 1:n}$ is a set of probabilistic atomic choices, - - \item $F = F_P$ is a set of (common) facts and - - \item $R = R_P$ is a set of (common) rules. - \end{itemize} - - and the sets of atoms, observations and interpretations of program $P$ are denoted $\fml{A}_P, \fml{Z}_P$ and $\fml{I}_P$ + % -------------------------------- + \item \textbf{Atoms} $\fml{A}$, + $\overline{\fml{A}} = \cset{\neg a}{a \in \fml{A}}$, + % -------------------------------- + \item \textbf{Observations} $\fml{Z}$: + $$\fml{Z} = \cset{z = \alpha \cup \beta }{ \alpha \subseteq \fml{A} \land \beta \subseteq \overline{\fml{A}} }$$ + % -------------------------------- + \item \textbf{Interpretations} or \textit{consistent observations} $\fml{I}$ : + $$\fml{I} = \cset{z \in \fml{Z} }{ \forall a \in \fml{A}~\envert{\set{a,\neg a} \cap z} \leq 1}.$$ + % -------------------------------- + \item \textit{PASP Problem} or \textbf{Specification:} $P = C \land F \land R$ where + % -------------------------------- + \begin{itemize} + % -------------------------------- + \item $C = C_P = \cset{\alpha_i :: a_i }{ i \in 1:n \land a_i \in \fml{A}}$ \textit{pacs}. + % -------------------------------- + \item $F = F_P$ \textit{facts}. + % -------------------------------- + \item $R = R_P$ \textit{rules}. + % -------------------------------- + \item $\fml{A}_P, \fml{Z}_P$ and $\fml{I}_P$: \textit{atoms}, \textit{observations} and \textit{interpretations} of $P$. + \end{itemize} + % -------------------------------- + \item \textbf{Stable Models} of $P$, $\fml{S} = \fml{S}_P$, are the stable models of $\delta P = \delta C + F + R$. + % -------------------------------- + \end{itemize} + % -------------------------------- +\end{frame} +% ================================================================ +\begin{frame}{Distribution Semantics} + % -------------------------------- + \begin{itemize} + % -------------------------------- + \item \textbf{Total Choices:} $\Theta = \Theta_C = \Theta_P$ elements are $\theta = \set{c_1, \ldots, c_n}$ where $c_i$ is $a_i$ or $\neg a_i$. + % -------------------------------- + %\item For $s\in\fml{S}$ let $\theta_s \subseteq s$ (unique \textit{total choice}) + %\item Define $\fml{S}_\theta = \cset{s \in \fml{S}}{\theta \subset s}$. + % -------------------------------- - \item The \textbf{stable models} of $P$ are the stable models of $\delta P = \delta C + F + R$ and the respective set is denoted $\fml{S} = \fml{S}_P$. + % -------------------------------- + \item \textbf{Total Choice Probability:} + \begin{equation} + \pr{\theta} = \prod_{a_i \in \theta}\alpha_i \prod_{\neg a_i \in \theta}\co{\alpha_i}.\label{eq:prob.tc} + \end{equation} + % -------------------------------- \end{itemize} + % -------------------------------- + \begin{quote} + This is the \emph{Distribution Semantics} as set by Sato. + \end{quote} \end{frame} - -\begin{frame} - \note{A model x has lower and upper "bounds".} +% ================================================================ +\begin{frame}{Problem Statement} + % -------------------------------- + \begin{quotation} + How to extend probability from the total choices to interpretations and observations? + \end{quotation} + % -------------------------------- + \begin{itemize} + % -------------------------------- + \item \textbf{Todo:} Extend probability to \textit{stable models}, \textit{interpretations} and \textit{observations}. + % -------------------------------- + \end{itemize} + % -------------------------------- + \begin{quotation} + \textbf{But} there is a problem extending probability from total choices to stable models. + \end{quotation} + % -------------------------------- +\end{frame} +% ================================================================ +\begin{frame}{The Disjunction Case} + % -------------------------------- + \begin{exampleblock}{Disjuntion Example} + The specification + % -------------------------------- + $$ + \begin{aligned} + 0.3 :: a &, \cr + b \lor c &\larr a . + \end{aligned} + $$ + % -------------------------------- + has three stable models, + % -------------------------------- + $$ + \begin{aligned} + s_1 &= \set{\neg a}, & s_2 &= \set{a, b}, & s_3 &= \set{a, c}. + \end{aligned} + $$ + \end{exampleblock} + % -------------------------------- + \begin{itemize} + % -------------------------------- + \item\label{prop:unique.ext.tcsm}\textit{Any stable model contains exactly one total choice.~$\blacksquare$} + % -------------------------------- + \item $\pr{\set{\neg a}} = 0.7$ is straightforward. + % -------------------------------- + \item But, no \textit{unbiased} choice for $\alpha\in\intcc{0,1}$ in + $$ + \begin{aligned} + \pr{\set{a, b}} &= 0.3 \alpha, \cr + \pr{\set{a, c}} &= 0.3 \co{\alpha}. + \end{aligned} + $$ + % -------------------------------- + \end{itemize} + % -------------------------------- +\end{frame} +% ================================================================ +\section{Motivation} +% ================================================================ +\begin{frame}{Specification, Data \& Evaluation} + % -------------------------------- + Given some procedure to assign probabilities to observations from specifications and: + % -------------------------------- + \begin{itemize} + % -------------------------------- + \item $P$, a specification. + % -------------------------------- + \item $p$, the distribution of observations from above. + % -------------------------------- + \item $Z$, a dataset of observations. + % -------------------------------- + \item $e$, the respective empirical distribution. + % -------------------------------- + \item $D$, some probability divergence, \textit{e.g.} Kullback-Leibler. + % -------------------------------- + \end{itemize} + % -------------------------------- + Given a dataset $Z$, $D\at{P} = D\at{e, p}$ is a \textit{performance} measure of $P$ and can be used, \textit{e.g.} fitness, by algorithms searching for optimal specifications of a dataset. + % -------------------------------- +\end{frame} +% ================================================================ +\section{Resolution} +% ================================================================ +\begin{frame}{Bounds of Interpretations} + % -------------------------------- \begin{itemize} - \item \textbf{Proposition.} Let $x\in\fml{I}$ be an interpretation. + % -------------------------------- + \item For $x\in\fml{I}$: + % -------------------------------- \begin{itemize} - \item[Lower Models] $\lset{x} = \set{s\in \fml{S} \middle| s \subseteq x}$. - - \item[Upper Models] $\uset{x} = \set{s\in \fml{S} \middle| x \subseteq s}$. + % -------------------------------- + \item \textbf{Lower Models:} $\lset{x} = \cset{s\in \fml{S} }{ s \subseteq x}$. + % -------------------------------- + \item \textbf{Upper Models:} $\uset{x} = \cset{s\in \fml{S} }{ x \subseteq s}$. + % -------------------------------- \end{itemize} - \note{If $a$ is a lower model and $b$ an upper model, since stable models are minimal, must be $a = b = x$.} - - \item Exactly one of the following cases takes place: + % -------------------------------- + \item\label{prop:lucases} \textbf{Proposition.} Stable models are \textit{minimal} so \textit{one} of the following cases takes place: + % -------------------------------- \begin{enumerate} - % + % -------------------------------- \item\label{prop:lucases.a} $\lset{x} = \set{x} = \uset{x}$ and $x$ is a stable model. - % + % -------------------------------- \item\label{prop:lucases.b} $\lset{x} \neq \emptyset \land \uset{x} = \emptyset$. - % + % -------------------------------- \item\label{prop:lucases.c} $\lset{x} = \emptyset \land \uset{x} \neq \emptyset$. - % + % -------------------------------- \item\label{prop:lucases.d} $\lset{x} = \emptyset = \uset{x}$. + % -------------------------------- \end{enumerate} + % -------------------------------- \end{itemize} + % -------------------------------- \end{frame} - -\begin{frame} - \note{Total choice are key to define probability of a clause.} - \begin{itemize} - \item The probabilistic facts $C$ define a set $\Theta = \Theta_C$ of \textbf{total choices}, with $2^n$ elements, each one a set $\theta = \set{c_1, \ldots, c_n}$ where $c_i$ is either $a_i$ or $\neg a_i$. - - \item For each stable model $s\in\fml{S}$ let $\theta_s$ be the unique \textbf{total choice} contained in $s$ and $\fml{S}_\theta \subseteq \fml{S}$ the set of stable models that contains $\theta$. - - \item Define - \begin{equation} - p\at{\theta} = \prod_{a_i \in \theta}\alpha_i \prod_{\neg a_i \in \theta}\co{\alpha_i}.\label{eq:prob.tc} - \end{equation} - \end{itemize} -\end{frame} - - -\begin{frame} - \note{Relate stable models with Sato's probabilistic semantics} - \begin{quotation} - The problem we address is how to \textbf{assign probabilities to observations} given that a total choice might entail zero or many stable models \emph{i.e.} How to assign probabilities to the stable models of $\fml{S}_\theta$ when $\envert{\fml{S}_\theta} \not= 1$? - \end{quotation} -\end{frame} - -\begin{frame} - \note{There are some problems} - - As it turns out, it is quite easy to come out with a program from which result no single probability distribution. For example - $$ - \begin{aligned} - 0.3:a,& \cr - b \lor c \larr& a. - \end{aligned} - $$ - has three stable models - $$ - \begin{aligned} - s_1 &= \set{\neg a} \cr - s_2 &= \set{a, b} \cr - s_3 &= \set{a, c} - \end{aligned} - $$ - and while $p\at{\set{\neg a}} = 0.7$ is quite natural, we have no further information to support the choice of a singular $\alpha\in\intcc{0,1}$ in the assignment - $$ - \begin{aligned} - p\at{\set{a, b}} &= 0.3 \alpha \cr - p\at{\set{a, c}} &= 0.3 \co{\alpha} - \end{aligned} - $$ -\end{frame} - +% ================================================================ \begin{frame} - Next we try to formalize the possible configurations of this scenario. Consider the ASP program $P = C \land F \land R$ with total choices $\Theta $ and stable models $\fml{S}$. Let $d : \fml{S} \to \intcc{0,1}$ such that $\sum_{s\in\fml{S}_\theta} d\at{s} = 1$. + Next we try to formalize the possible configurations of this scenario. Consider the ASP program $P = C \land F \land R$ with total choices $\Theta $ and stable models $\fml{S}$. Let $d :: \fml{S} \to \intcc{0,1}$ such that $\sum_{s\in\fml{S}_\theta} d\at{s} = 1$. \end{frame} - +% ================================================================ \begin{frame} \begin{enumerate} @@ -176,7 +275,7 @@ % \item $z$ is an interpretation and $\lset{z} = \set{z} = \uset{x}$. Then $z = s$ is a stable model and \textbf{define} \begin{equation} - w_d\at{z} = w\at{s} = d\at{s} p\at{\theta_s}.\label{eq:prob.sm} + w_d\at{z} = w\at{s} = d\at{s} \pr{\theta_s}.\label{eq:prob.sm} \end{equation} % \item $z$ is an interpretation and $\lset{z} \neq \emptyset \land \uset{x} = \emptyset$. Then \textbf{define} @@ -197,36 +296,36 @@ % \item The last point defines a ``weight'' function on the observations that depends not only on the total choices and stable models of a PASP but also on a certain function $d$ that must respect some conditions. To simplify the notation we use the subscript in $w_d$ only when necessary. % - \item At first, it may seem counter-intuitive that $w\at{\emptyset} = \sum_{s\in\fml{S}} w\at{s}$ is the largest ``weight'' in the lattice. But $\emptyset$, as an interpretation, sets zero restrictions on the ``compatible'' stable models. The ``complement'' of $\bot = \emptyset$ is the \emph{maximal inconsistent} observation $\top = \fml{A} \cup \set{\neg a \middle| a \in \fml{A}}$. + \item At first, it may seem counter-intuitive that $w\at{\emptyset} = \sum_{s\in\fml{S}} w\at{s}$ is the largest ``weight'' in the lattice. But $\emptyset$, as an interpretation, sets zero restrictions on the ``compatible'' stable models. The ``complement'' of $\bot = \emptyset$ is the \emph{maximal inconsistent} observation $\top = \fml{A} \cup \cset{\neg a }{ a \in \fml{A}}$. % \item \textbf{We haven't yet defined a probability measure.} To do so we must define a set of samples $\Omega$, a set of events $F\subseteq \pset{\Omega}$ and a function $P:F\to\intcc{0,1}$ such that: \begin{enumerate} - \item $P\at{E} \in \intcc{0, 1}$ for any $E \in F$. - \item $P\at{\Omega} = 1$. - \item if $E_1 \cap E_2 = \emptyset$ then $P\at{E_1 \cup E_2} = P\at{E_1} + P\at{E_2}$. + \item $\pr{E} \in \intcc{0, 1}$ for any $E \in F$. + \item $\pr{\Omega} = 1$. + \item if $E_1 \cap E_2 = \emptyset$ then $\pr{E_1 \cup E_2} = \pr{E_1} + \pr{E_2}$. \end{enumerate} % \item In the following, assume that the stable models are iid. % \item Let the sample space $\Omega = \fml{Z}$ and the event space $F = \pset{\Omega}$. Define $Z = \sum_{\zeta\in\fml{Z}} w\at{\zeta}$ and \begin{equation} - P\at{z} = \frac{w\at{z}}{Z}, z \in \Omega \label{eq:def.prob} + \pr{z} = \frac{w\at{z}}{Z}, z \in \Omega \label{eq:def.prob} \end{equation} and \begin{equation} - P\at{E} = \sum_{x\in E} P\at{x}, E \subseteq \Omega. \label{eq:def.prob.event} + \pr{E} = \sum_{x\in E} \pr{x}, E \subseteq \Omega. \label{eq:def.prob.event} \end{equation} Now: \begin{enumerate} \item $P(E) \in \intcc{0,1}$ results directly from the definitions of $P$ and $w$. - \item $P\at{\Omega} = 1$ also results directly from the definitions. + \item $\pr{\Omega} = 1$ also results directly from the definitions. \item Consider two disjunct events $A, B \subset \Omega \land A \cap B = \emptyset$. Then $$ \begin{aligned} - P\at{A \cup B} &= \sum_{x \in A \cup B} P\at{x} \cr - &= \sum_{x \in A} P\at{x} + \sum_{x \in B} P\at{x} - \sum_{x \in A \cap B} P\at{x} \cr - &= \sum_{x \in A} P\at{x} + \sum_{x \in B} P\at{x} &\text{because}~A\cap B = \emptyset \cr - &= P\at{A} + P\at{B}. + \pr{A \cup B} &= \sum_{x \in A \cup B} \pr{x} \cr + &= \sum_{x \in A} \pr{x} + \sum_{x \in B} \pr{x} - \sum_{x \in A \cap B} \pr{x} \cr + &= \sum_{x \in A} \pr{x} + \sum_{x \in B} \pr{x} &\text{because}~A\cap B = \emptyset \cr + &= \pr{A} + \pr{B}. \end{aligned} $$ \item So $\del{\Omega = \fml{Z}, F = \pset{\Omega}, P}$ is a probability space. {$\blacksquare$} @@ -234,10 +333,11 @@ \end{enumerate} \end{frame} - +% ================================================================ \section{Cases \& Examples} +% ================================================================ \subsection{Programs with disjunctive heads} - +% ================================================================ \begin{frame} Consider the program: @@ -263,10 +363,9 @@ \end{aligned} $$ \end{frame} - - +% ================================================================ \begin{frame} - Suppose that we add an annotation $\alpha:a$, which entails $\co{\alpha}:\neg a$. This is enough to get $w\at{s_1} = \co{\alpha}$ but, on the absence of further information, no fixed probability can be assigned to either model $s_2, s_3$ except that the respective sum must be $\alpha$. So, expressing our lack of knowledge using a parameter $d \in \intcc{0, 1}$ we get: + Suppose that we add an annotation $\alpha :: a$, which entails $\co{\alpha} :: \neg a$. This is enough to get $w\at{s_1} = \co{\alpha}$ but, on the absence of further information, no fixed probability can be assigned to either model $s_2, s_3$ except that the respective sum must be $\alpha$. So, expressing our lack of knowledge using a parameter $d \in \intcc{0, 1}$ we get: $$ \begin{cases} w\at{s_1 } = &\co{\alpha}\cr @@ -275,7 +374,7 @@ \end{cases} $$ \end{frame} - +% ================================================================ \begin{frame} Now consider all the interpretations for this program: @@ -285,11 +384,11 @@ % \node [draw, circle] (E) at (5.5,0) {$\emptyset$}; % - \node [draw, circle] (a) at (2,2) {$a$}; - \node [draw, circle] (b) at (3,2) {$b$}; + \node [draw, circle] (a) at (3,2) {$a$}; + \node [draw, circle] (b) at (2,2) {$b$}; \node [draw, circle] (c) at (4,2) {$c$}; - \node [fill=gray!50] (A) at (9,2) {$\co{a}$}; - \node (B) at (8,2) {$\co{b}$}; + \node [fill=gray!50] (A) at (8,2) {$\co{a}$}; + \node (B) at (9,2) {$\co{b}$}; \node (C) at (7,2) {$\co{c}$}; % \node [fill=gray!50] (ab) at (0,4) {$ab$}; @@ -338,7 +437,7 @@ \end{tikzpicture} \end{center} \end{frame} - +% ================================================================ \begin{frame} In this diagram: @@ -378,7 +477,7 @@ $$ \item Now some statistics are possible. For example we get $$ - P\at{abc \mid \alpha = 0.3} = \frac{0.09 d \left(d - 1\right)}{0.09 d^{2} - 0.69 d - 7.9} + \pr{abc \mid \alpha = 0.3} = \frac{0.09 d \left(d - 1\right)}{0.09 d^{2} - 0.69 d - 7.9} $$. \item This expression can be plotted for $d\in\intcc{0,1}$ @@ -386,10 +485,10 @@ \includegraphics[height=15em]{Pabc_alpha03.pdf} \end{center} - \item If a data set $E$ entails \emph{e.g.} $P\at{abc \mid E} = 0.0015$ we can numerically solve + \item If a data set $E$ entails \emph{e.g.} $\pr{abc \mid E} = 0.0015$ we can numerically solve $$ \begin{aligned} - P\at{abc \mid \alpha = 0.3} &= P\at{abc \mid E} \cr + \pr{abc \mid \alpha = 0.3} &= \pr{abc \mid E} \cr \iff\cr \frac{0.09 d \del{d - 1}}{0.09 d^{2} - 0.69 d - 7.9} &= 0.0015 \end{aligned} @@ -397,10 +496,9 @@ which has two solutions, $d \approx 0.15861$ or $d \approx 0.83138$. \end{itemize} \end{frame} - +% ================================================================ \subsection{Non-stratified programs} - - +% ================================================================ \begin{frame} The following LP is non-stratified, because has a cycle with negated arcs: $$ @@ -429,13 +527,13 @@ }. $$ \end{frame} - +% ================================================================ \begin{frame} - Looking into probabilistic interpretations of the program and/or its models, we define $\alpha = P\at{\Theta = \theta_1}\in\intcc{0, 1}$ and $P\at{\Theta = \theta_2} = \co{\alpha}$. + Looking into probabilistic interpretations of the program and/or its models, we define $\alpha = \pr{\Theta = \theta_1}\in\intcc{0, 1}$ and $\pr{\Theta = \theta_2} = \co{\alpha}$. - Since $s_1$ is the only stable model that results from $\Theta = \theta_1$, it is natural to extend $P\at{ s_1 } = P\at{\Theta = \theta_1} = \alpha$. However, there is no clear way to assign $P\at{s_2}, P\at{s_3}$ since \emph{both models result from the single total choice} $\Theta = \theta_2$. Clearly, - $$P\at{s_2 \mid \Theta} + P\at{s_3 \mid \Theta} = + Since $s_1$ is the only stable model that results from $\Theta = \theta_1$, it is natural to extend $\pr{ s_1 } = \pr{\Theta = \theta_1} = \alpha$. However, there is no clear way to assign $\pr{s_2}, \pr{s_3}$ since \emph{both models result from the single total choice} $\Theta = \theta_2$. Clearly, + $$\pr{s_2 \mid \Theta} + \pr{s_3 \mid \Theta} = \begin{cases} 0 & \text{if}~\Theta = \theta_1\cr 1 & \text{if}~\Theta = \theta_2 @@ -444,16 +542,15 @@ but further assumptions are not supported \emph{a priori}. So let's \textbf{parameterize} the equation above, $$ \begin{cases} - P\at{s_2 \mid \Theta = \theta_2} = &\beta \in \intcc{0, 1} \cr - P\at{s_3 \mid \Theta = \theta_2} = &\co{\beta}, + \pr{s_2 \mid \Theta = \theta_2} = &\beta \in \intcc{0, 1} \cr + \pr{s_3 \mid \Theta = \theta_2} = &\co{\beta}, \end{cases} $$ in order to explicit our knowledge, or lack of, with numeric values and relations. \end{frame} - - +% ================================================================ \begin{frame} - Now we are able to define the \textbf{joint distribution} of the boolean random variables $A,B,C$, : + Now we are able to define the \textbf{joint distribution} of the boolean random variables $A,B,C$: $$ \begin{array}{cc|l} @@ -467,10 +564,9 @@ $$ where $\alpha, \beta\in\intcc{0,1}$. \end{frame} - +% ================================================================ \section{Conclusions} - - +% ================================================================ \begin{frame} \begin{itemize} \item We can use the basics of probability theory and logic programming to assign explicit \emph{parameterized} probabilities to the (stable) models of a program. @@ -479,10 +575,9 @@ \item However, it is non-restrictive since \emph{no unusual assumptions are made}. \end{itemize} \end{frame} - +% ================================================================ \section*{ASP \& related definitions} - - +% ================================================================ \begin{frame} \begin{itemize} @@ -536,4 +631,5 @@ \end{itemize} \end{itemize} \end{frame} +% ================================================================ \end{document} \ No newline at end of file diff --git a/text/00_PASP.toc b/text/00_PASP.toc index 33a80d8..97397a7 100644 --- a/text/00_PASP.toc +++ b/text/00_PASP.toc @@ -1,5 +1,7 @@ \beamer@sectionintoc {1}{Introduction}{2}{0}{1} -\beamer@sectionintoc {2}{Cases \& Examples}{10}{0}{2} -\beamer@subsectionintoc {2}{1}{Programs with disjunctive heads}{10}{0}{2} -\beamer@subsectionintoc {2}{2}{Non-stratified programs}{14}{0}{2} -\beamer@sectionintoc {3}{Conclusions}{18}{0}{3} +\beamer@sectionintoc {2}{Motivation}{8}{0}{2} +\beamer@sectionintoc {3}{Resolution}{10}{0}{3} +\beamer@sectionintoc {4}{Cases \& Examples}{14}{0}{4} +\beamer@subsectionintoc {4}{1}{Programs with disjunctive heads}{15}{0}{4} +\beamer@subsectionintoc {4}{2}{Non-stratified programs}{20}{0}{4} +\beamer@sectionintoc {5}{Conclusions}{25}{0}{5} diff --git a/text/00_PASP.xdv b/text/00_PASP.xdv index 42422e7..a286a18 100644 Binary files a/text/00_PASP.xdv and b/text/00_PASP.xdv differ -- libgit2 0.21.2