From 1d16220c1ce564953551d45e2fa7689b23bd4030 Mon Sep 17 00:00:00 2001
From: Francisco Coelho
Date: Tue, 30 Jan 2024 10:52:07 +0000
Subject: [PATCH] hello 2024
---
2023-11-11--biblio.zip | Bin 0 -> 31598238 bytes
NOVALINCS/00-Application_Form-FINAL.md | 53 +++++++++++++++++++++++++++++++++++++++++++++++++++++
NOVALINCS/00-Application_Form-FINAL.pdf | Bin 0 -> 44220 bytes
NOVALINCS/00-Call-TEMPLATE.md | 54 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
NOVALINCS/00-Call-TEMPLATE.pdf | Bin 0 -> 81806 bytes
NOVALINCS/01-Call-DRAFT.md | 12 ++++++++++++
NOVALINCS/01-Call-DRAFT.pdf | Bin 0 -> 39226 bytes
NOVALINCS/01-Call-Underg_A.md | 17 +++++++++++++++++
NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.docx | Bin 0 -> 12047 bytes
NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.gddoc | 1 +
NOVALINCS/TdOS-JasonMAllen.jpg | Bin 0 -> 87283 bytes
NOVALINCS/bolsas/BI/2023-01-91 | Oficio Juri.gddoc | 1 +
NOVALINCS/bolsas/BI/2023-02-01 _ Ata1.pdf | Bin 0 -> 86182 bytes
NOVALINCS/bolsas/BI/2023-02-01 | Ata1.gddoc | 1 +
NOVALINCS/bolsas/BI/2023-02-03 | Edital | EN.pdf | Bin 0 -> 195634 bytes
NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.gddoc | 1 +
NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.pdf | Bin 0 -> 178158 bytes
NOVALINCS/bolsas/BI/2023-03-01 _ Ata 2.pdf | Bin 0 -> 84759 bytes
NOVALINCS/bolsas/BI/2023-03-01 | Ata 2.gddoc | 1 +
NOVALINCS/bolsas/BI/signed/2023-01-19 | BI | Oficio Juri.pdf | Bin 0 -> 59499 bytes
NOVALINCS/bolsas/BI/signed/2023-02-01 | BI | Ata 01.pdf | Bin 0 -> 213000 bytes
NOVALINCS/bolsas/BI/signed/2023-03-01 | BI | Ata 02.pdf | Bin 0 -> 237056 bytes
NOVALINCS/bolsas/BI/zz_old/Edital BolsaInv.MSc | Zugzwang | EN.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-01-19 | Oficio Homologação Júri.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-01-19 | Oficio Juri BolsaII.Lic Zugzwang.pdf | Bin 0 -> 43085 bytes
NOVALINCS/bolsas/BII/2023-02-01 _ Ata1.pdf | Bin 0 -> 86736 bytes
NOVALINCS/bolsas/BII/2023-02-01 | Ata1.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | EN.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | PT.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-02-03 | Edital PT_bolsa_BII_novalincs.pdf | Bin 0 -> 178392 bytes
NOVALINCS/bolsas/BII/2023-03-01 _ Ata 2.pdf | Bin 0 -> 104085 bytes
NOVALINCS/bolsas/BII/2023-03-01 | Ata 2.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-02 13:23 | Entrevista | Email Convocatória.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista (Respostas).gdsheet | 1 +
NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista.gdform | 1 +
NOVALINCS/bolsas/BII/2023-03-02 18:00 | Ata3.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-02 18_00 _ Ata3.pdf | Bin 0 -> 103451 bytes
NOVALINCS/bolsas/BII/2023-03-03 | Notificação Candidatos.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-07 | BII | Declaração Conflito de Interesses.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-07 | BII | Plano de Trabalhos.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-17 | Ata 4.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-27 | Ofício Início Bolsa II.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa.pdf | Bin 0 -> 63030 bytes
NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf | Bin 0 -> 319132 bytes
NOVALINCS/bolsas/BII/2023-03-29 | BII | Inicio de Bolsa.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-04-26 | Oficio Início de Bolsa.pdf | Bin 0 -> 62087 bytes
NOVALINCS/bolsas/BII/2023-09-01 | Inquérito Atividades Bolseiros.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-09-01 | Oficio Renovação Bolsa.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-09-01 | Relatorio Atividades Bolseiros.gddoc | 1 +
NOVALINCS/bolsas/BII/2023-99-03 | Minuta Contrato Bolsa.gddoc | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf | Bin 0 -> 319132 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.pdf | Bin 0 -> 192703 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.png | Bin 0 -> 225213 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 | Inscrições.png | Bin 0 -> 262616 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 145905 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/AlicE Martins.pdf | Bin 0 -> 111671 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Candidatura à Bolsa de Iniciação à Investigação | Alice Martins.pdf | Bin 0 -> 21679 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Plano de Trabalhos.pdf | Bin 0 -> 52262 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Captura de ecrã de 2023-02-27 16-35-44.png | Bin 0 -> 190194 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Consulta IBAN, BIC e SWIFT 22-05-2023 14 15.pdf | Bin 0 -> 130418 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova.pdf | Bin 0 -> 280470 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_preenchida.pdf | Bin 0 -> 195097 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_prepreenchido.pdf | Bin 0 -> 292899 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/bolsa.pdf | Bin 0 -> 195097 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_aproveitamento_escolar.pdf | Bin 0 -> 487947 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao-2023.pdf | Bin 0 -> 505384 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao.pdf | Bin 0 -> 505384 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/dados.md | 6 ++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 148189 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Inquérito Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Oficio Renovação Bolsa.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/Declaração_Generali_ausência de acidentes (1).docx | Bin 0 -> 1107261 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/12-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334081 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.pdf | Bin 0 -> 70654 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.tex | 31 +++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.pdf | Bin 0 -> 32021 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.tex | 36 ++++++++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.md | 20 ++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.pdf | Bin 0 -> 34146 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.tex | 38 ++++++++++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 148156 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp | Bin 0 -> 17236 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf | Bin 0 -> 134825 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/renovacao-amartins.zip | Bin 0 -> 899307 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/comprovativo_matricula-inscricao-2023.pdf | Bin 0 -> 505384 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/ofício_renovação-signed.pdf | Bin 0 -> 322492 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/parecer_renovação-signed.pdf | Bin 0 -> 32021 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/plano_trabalhos-signed.pdf | Bin 0 -> 33470 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/relatorio_atividades-signed.pdf | Bin 0 -> 133677 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 148189 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Oficio Renovação Bolsa.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/Declaração_Generali_ausência de acidentes (1).docx | Bin 0 -> 1107261 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/12-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334081 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/15-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334114 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.pdf | Bin 0 -> 21028 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.tex | 31 +++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.pdf | Bin 0 -> 32161 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.tex | 36 ++++++++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.md | 20 ++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.pdf | Bin 0 -> 33764 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.tex | 38 ++++++++++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 148156 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp | Bin 0 -> 17236 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf | Bin 0 -> 134825 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf | Bin 0 -> 141472 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf | Bin 0 -> 209307 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/renovacao-amartins.zip | Bin 0 -> 899307 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/15-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334114 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/Declaração_Generali_ausência de acidentes.pdf | Bin 0 -> 144293 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/comprovativo_matricula-inscricao-2023.pdf | Bin 0 -> 505384 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/parecer_renovação.pdf | Bin 0 -> 32161 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/plano-trabalhos.pdf | Bin 0 -> 33751 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/relatorio_atividades-signed_am_fc.pdf | Bin 0 -> 141472 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/renovacao_BII_AliceMartins-documentos.zip | Bin 0 -> 901359 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 148189 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Oficio Renovação Bolsa.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/Declaração_Generali_ausência de acidentes (1).docx | Bin 0 -> 1107261 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/12-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334081 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/15-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334114 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.pdf | Bin 0 -> 21028 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.tex | 31 +++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.pdf | Bin 0 -> 32161 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.tex | 36 ++++++++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.md | 20 ++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.pdf | Bin 0 -> 33764 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.tex | 38 ++++++++++++++++++++++++++++++++++++++
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf | Bin 0 -> 148156 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp | Bin 0 -> 17236 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf | Bin 0 -> 134825 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf | Bin 0 -> 141472 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc | 1 +
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf | Bin 0 -> 209307 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/renovacao-amartins.zip | Bin 0 -> 899307 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/15-renovacao-bolsa-alice_signed.pdf | Bin 0 -> 334114 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/Declaração_Generali_ausência de acidentes.docx | Bin 0 -> 627704 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/comprovativo_matricula-inscricao-2023.pdf | Bin 0 -> 505384 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/parecer_renovação.pdf | Bin 0 -> 32161 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/plano-trabalhos.pdf | Bin 0 -> 33751 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/relatorio_atividades-signed_am_fc.pdf | Bin 0 -> 141472 bytes
NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/renovacao_BII_Alice_Martins-documentos.zip | Bin 0 -> 1526447 bytes
NOVALINCS/bolsas/BII/Ata 02.pdf | Bin 0 -> 104085 bytes
NOVALINCS/bolsas/BII/Ata 04.pdf | Bin 0 -> 970913 bytes
NOVALINCS/bolsas/BII/Ata 04.pdf.jpg | Bin 0 -> 962403 bytes
NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/BII | Candidatura para Projeto | João Branquinho.pdf | Bin 0 -> 69710 bytes
NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/Joao Branquinho.pdf | Bin 0 -> 101902 bytes
NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/comprovativo_matricula_inscricao-1.pdf | Bin 0 -> 505487 bytes
NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/disc + notas.jpg | Bin 0 -> 234157 bytes
NOVALINCS/bolsas/BII/remeter/2023-01-19 | BII | Oficio Homologação Juri.pdf | Bin 0 -> 43085 bytes
NOVALINCS/bolsas/BII/remeter/2023-02-01 | BII | Ata 01.pdf | Bin 0 -> 213051 bytes
NOVALINCS/bolsas/BII/remeter/2023-02-15 | BII | JBranquinho | Comprovativo Matricula Inscrição.pdf | Bin 0 -> 505487 bytes
NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Aproveitamento Escolar.pdf | Bin 0 -> 487947 bytes
NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Matricula Inscricao.pdf | Bin 0 -> 505384 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-01 | BII | Ata 02.pdf | Bin 0 -> 289227 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Ata 03.pdf | Bin 0 -> 267945 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória | src.pdf | Bin 0 -> 30479 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória.pdf | Bin 0 -> 46596 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | AMartins | Email Aceitação.pdf | Bin 0 -> 81724 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | Notificação Candidatos.pdf | Bin 0 -> 98309 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-06 | BII | JBranquinho | Email Aceitação.pdf | Bin 0 -> 82797 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | Bruno.pdf | Bin 0 -> 181064 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | fc.pdf | Bin 0 -> 102357 bytes
NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Oficio Inicio de Bolsa.pdf | Bin 0 -> 80160 bytes
NOVALINCS/bolsas/BII/zz-lostNfound/Edital EN.docx | Bin 0 -> 491247 bytes
NOVALINCS/bolsas/BII/zz-lostNfound/Edital PT.docx | Bin 0 -> 491647 bytes
NOVALINCS/bolsas/BII2/2023-03-03 Oficio Juri BII.pdf | Bin 0 -> 43315 bytes
NOVALINCS/bolsas/BII2/2023-03-07 | BII2 | Oficio Juri.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-B | Ata 1.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-C | Edital | EN.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-C | Edital | PT.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-C | Edital | PT.pdf | Bin 0 -> 178392 bytes
NOVALINCS/bolsas/BII2/2023-D | Ata 2.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-E | Notificação para Entrevista.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-F | Entrevista | Formulário.gdform | 1 +
NOVALINCS/bolsas/BII2/2023-G | Ata 3.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-H | Notificação Candidatos.gddoc | 1 +
NOVALINCS/bolsas/BII2/2023-I | Ata 4.gddoc | 1 +
NOVALINCS/bolsas/Estatuto Bolseiro de Investigação | Consolidação.pdf | Bin 0 -> 123185 bytes
NOVALINCS/bolsas/RegulamentoBolsasFCT2019.pdf | Bin 0 -> 268850 bytes
NOVALINCS/bolsas/Tabela_de_Valores_SMM_2022.pdf | Bin 0 -> 447432 bytes
NOVALINCS/bolsas/kit bolsas_2023/1_minuta de oficio juri bolsa_2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/2_minuta de Ata1_2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_EN.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_PT.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/4_minuta de Ata2_2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/5_Notificaçõesparaentrevista.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/6_minuta de Ata3_2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/7_Notificacao_candidatos.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/8_minuta de Ata4_2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/9_Minuta oficio Inicio de Bolsa.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/A_Regulamentobolsas_FCT.pdf | Bin 0 -> 1510801 bytes
NOVALINCS/bolsas/kit bolsas_2023/B_Estatuto bolseiro_Consolidação.pdf | Bin 0 -> 40995 bytes
NOVALINCS/bolsas/kit bolsas_2023/C_Tabela_de_Valores_SMM_atualizadoJan2022.pdf | Bin 0 -> 447432 bytes
NOVALINCS/bolsas/kit bolsas_2023/Minuta_Contrato_Bolsa 2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/dec conflito de interesses 2023.gddoc | 1 +
NOVALINCS/bolsas/kit bolsas_2023/docx/1_minuta de oficio juri bolsa_2023.doc | Bin 0 -> 54784 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/2_minuta de Ata1_2023.doc | Bin 0 -> 52224 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_EN.docx | Bin 0 -> 64399 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_PT.docx | Bin 0 -> 65499 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/4_minuta de Ata2_2023.docx | Bin 0 -> 41896 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/5_Notificaçõesparaentrevista.docx | Bin 0 -> 42707 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/6_minuta de Ata3_2023.docx | Bin 0 -> 42235 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/7_Notificacao_candidatos.docx | Bin 0 -> 43403 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/8_minuta de Ata4_2023.docx | Bin 0 -> 42188 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/9_Minuta oficio Inicio de Bolsa.docx | Bin 0 -> 47850 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/Minuta_Contrato_Bolsa 2023.docx | Bin 0 -> 80571 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/dec conflito de interesses 2023.docx | Bin 0 -> 41395 bytes
NOVALINCS/bolsas/kit bolsas_2023/docx/modelo_relatorio_atividades_bolseiros_2023.docx | Bin 0 -> 61527 bytes
NOVALINCS/bolsas/kit bolsas_2023/modelo_relatorio_atividades_bolseiros_2023.gddoc | 1 +
NOVALINCS/demo-markdown.md | 32 ++++++++++++++++++++++++++++++++
NOVALINCS/demo-markdown.pdf | Bin 0 -> 160788 bytes
biblio.gdlink | 1 +
biblio/2002 - Answer set programming and plan generation.pdf | Bin 0 -> 116000 bytes
biblio/2013 - Answer Set Solving in Practice - Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub.pdf | Bin 0 -> 2492180 bytes
biblio/2014 - A new method of proving the existence of answer sets for disjunctive logic programs.pdf | Bin 0 -> 197135 bytes
biblio/2018 - Deep Learning, A critical appraisal - Gary Marcus.pdf | Bin 0 -> 264408 bytes
biblio/2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf | Bin 0 -> 12531539 bytes
biblio/2019 - A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms - Bengio et al.pdf | Bin 0 -> 892506 bytes
biblio/2019 - On the Measure of Intelligence - Francois Chollet.pdf | Bin 0 -> 1280262 bytes
biblio/2019 - Potassco User Guide.pdf | Bin 0 -> 764439 bytes
biblio/2020 - ASP-Core-2 Input Language Format - Calimeri et al..pdf | Bin 0 -> 174207 bytes
biblio/2020 - Prolog and Answer Set Programming - Languages in Logic Programming.pdf | Bin 0 -> 243022 bytes
biblio/2020 - The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference - Fabio Gagliardi Cozman, Denis Deratani Mauá.pdf | Bin 0 -> 667074 bytes
biblio/2021 - CASP and SCASP best practices.pdf | Bin 0 -> 88835 bytes
biblio/ASP-DLV_tutorial.html | 1308 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
biblio/ASP-DLV_tutorial.md | 923 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
biblio/Special Issue on Answer Set Programming-Abstract.pdf | 3631 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
biblio/annotated -- 2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf | Bin 0 -> 12594744 bytes
biblio/plingo/2007-ProbLog - a probabilistic prolog and its application in link discovery.pdf | Bin 0 -> 147402 bytes
biblio/plingo/2008-Probabilistic reasoning with answer sets.pdf | Bin 0 -> 768023 bytes
biblio/plingo/2016-Weighted Rules under the Stable Model Semantics.pdf | Bin 0 -> 383958 bytes
biblio/plingo/2017-LPMLN, Weak Constraints and P-log.pdf | 2884 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
biblio/plingo/2021-Solution Enumeration by Optimality in Answer Set Programming.pdf | Bin 0 -> 586396 bytes
code/.vscode/launch.json | 17 +++++++++++++++++
code/asp/drafts/alarm.lp | 5 +++++
code/asp/drafts/assp_pag43.lp | 2 ++
code/asp/drafts/assp_pag46.lp | 1 +
code/asp/drafts/bachelor.lp | 9 +++++++++
code/asp/drafts/bachelor.pl | 6 ++++++
code/asp/drafts/barber.lp | 8 ++++++++
code/asp/drafts/choices_01.lp | 11 +++++++++++
code/asp/drafts/choices_02.lp | 9 +++++++++
code/asp/drafts/choices_03.lp | 10 ++++++++++
code/asp/drafts/choices_04.lp | 5 +++++
code/asp/drafts/choices_05.lp | 8 ++++++++
code/asp/drafts/choices_06.lp | 5 +++++
code/asp/drafts/color.lp | 15 +++++++++++++++
code/asp/drafts/credal_01.lp | 4 ++++
code/asp/drafts/cyclic.lp | 9 +++++++++
code/asp/drafts/cyclic.pl | 14 ++++++++++++++
code/asp/drafts/disj.lp | 3 +++
code/asp/drafts/double_negation.lp | 42 ++++++++++++++++++++++++++++++++++++++++++
code/asp/drafts/ex03.lp | 3 +++
code/asp/drafts/gcE01.lp | 9 +++++++++
code/asp/drafts/gcI01.lp | 8 ++++++++
code/asp/drafts/hanoiE.lp | 21 +++++++++++++++++++++
code/asp/drafts/hanoiI.lp | 11 +++++++++++
code/asp/drafts/heads_tails.lp | 4 ++++
code/asp/drafts/monty_hall.lp | 20 ++++++++++++++++++++
code/asp/drafts/no_model_cyclic.lp | 1 +
code/asp/drafts/no_model_wa.lp | 8 ++++++++
code/asp/drafts/nonstrat.lp | 7 +++++++
code/asp/drafts/onabove.lp | 5 +++++
code/asp/drafts/p01.lp | 4 ++++
code/asp/drafts/p18.lp | 3 +++
code/asp/drafts/p19.lp | 2 ++
code/asp/drafts/p20.lp | 2 ++
code/asp/drafts/pasp01.lp | 3 +++
code/asp/drafts/pasp_general.lp | 49 +++++++++++++++++++++++++++++++++++++++++++++++++
code/asp/drafts/paths.lp | 15 +++++++++++++++
code/asp/drafts/pdist.lp | 2 ++
code/asp/drafts/pqr.lp | 6 ++++++
code/asp/drafts/pqueens.lp | 20 ++++++++++++++++++++
code/asp/drafts/prob01.lp | 5 +++++
code/asp/drafts/prob02.lp | 2 ++
code/asp/drafts/py_01.lp | 22 ++++++++++++++++++++++
code/asp/drafts/py_02.lp | 16 ++++++++++++++++
code/asp/drafts/roads.lp | 14 ++++++++++++++
code/asp/drafts/s.lp | 7 +++++++
code/asp/drafts/toh.lp | 29 +++++++++++++++++++++++++++++
code/asp/drafts/tohE.lp | 26 ++++++++++++++++++++++++++
code/asp/drafts/tohI.lp | 7 +++++++
code/asp/drafts/tutorial_01.pl | 0
code/asp/drafts/tutotial_01.lp | 5 +++++
code/asp/drafts/unsound.lp | 4 ++++
code/asp/fplp/example_05-1.lp | 6 ++++++
code/asp/fplp/example_05-2.lp | 5 +++++
code/asp/plp/alarm.plp | 22 ++++++++++++++++++++++
code/asp/plp/coins.plp | 7 +++++++
code/asp/plp/cplint.plp | 15 +++++++++++++++
code/asp/plp/sbfe.plp | 7 +++++++
code/asplang/ASPLang.jl | 356 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/asplang/asp-core-2_syntax.ebnf | 54 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/asplang/draftASP.jl | 8 ++++++++
code/asplang/drafts.jl | 58 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/asplang/sbf.plp | 2 ++
code/asplang/testASPLang.jl | 45 +++++++++++++++++++++++++++++++++++++++++++++
code/asplang/tests_ASPlang.jl | 132 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/biflang/BIFLang.jl | 157 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/biflang/asia2.bif | 63 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/biflang/bif.ebnf | 63 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/biflang/bif.txt | 562 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/biflang/draft_biflang.jl | 110 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/biflang/notes.md | 142 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/.ipynb_checkpoints/EventLattice-checkpoint.ipynb | 113 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/.ipynb_checkpoints/Untitled-checkpoint.ipynb | 6 ++++++
code/drafts/.ipynb_checkpoints/Untitled1-checkpoint.ipynb | 164 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/.ipynb_checkpoints/sample_analysis-checkpoint.jl | 15 +++++++++++++++
code/drafts/.ipynb_checkpoints/teste-checkpoint.ipynb | 116 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/EventLattice.ipynb | 154 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/Untitled.ipynb | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/Untitled1.ipynb | 160 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/__init__.py | 0
code/drafts/__pycache__/event_lattice.cpython-39.pyc | Bin 0 -> 8094 bytes
code/drafts/algebra.py | 30 ++++++++++++++++++++++++++++++
code/drafts/api_01.py | 26 ++++++++++++++++++++++++++
code/drafts/arithfunclang.jl | 113 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/arithlang.jl | 56 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/drafts.ipynb | 590 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/drafts.jl | 67 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/event_lattice.py | 301 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/explore_01.py | 13 +++++++++++++
code/drafts/model_sample-[0.0;0.3;0.2].csv | 1001 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/model_sample-[0.0;0.3;0.5].csv | 1001 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/model_sample-[0.1;0.3;0.2].csv | 1001 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/model_sample-[0.1;0.3;0.5].csv | 1001 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/model_sample-[0.1;0.3;0.8].csv | 1001 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/model_sample.csv | 1001 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/sample.csv | 101 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/sample_analysis.jl | 77 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/sampling.jl | 91 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/drafts/symbops.py | 41 +++++++++++++++++++++++++++++++++++++++++
code/drafts/teste.ipynb | 116 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/julia/BIFParser.jl | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++
code/julia/asia2.bif | 60 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/julia/asia2.lp | 36 ++++++++++++++++++++++++++++++++++++
code/julia/asplang.jl | 0
code/julia/bif2asp.jl | 163 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/julia/dados.dat | 3 +++
code/julia/drafts.jl | 20 ++++++++++++++++++++
code/julia/forward.jl | 187 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
code/julia/miguel.jl | 7 +++++++
code/problog/alarm.pl | 7 +++++++
code/problog/nats.pl | 2 ++
code/sasp | 1 +
code/zugzwang_code.code-workspace | 11 +++++++++++
cspell.json | 16 ++++++++++++++++
notes.md | 180 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
notes.pdf | Bin 0 -> 183820 bytes
pex2024/FCT-Sessão_esclarecimento-2024-01-23.md | 36 ++++++++++++++++++++++++++++++++++++
pex2024/candidatura.md | 10 ++++++++++
pex2024/documents/Application_Guide_PeX_2023.pdf | Bin 0 -> 1122892 bytes
pex2024/documents/Aviso_de_Abertura_PEX_2023.pdf | Bin 0 -> 479233 bytes
pex2024/documents/Data_Protection_PEX_2023.pdf | Bin 0 -> 246082 bytes
pex2024/documents/Ethics_Self_Assessment_Guide.pdf | Bin 0 -> 271755 bytes
pex2024/documents/Guiao_CIENCIAVITAE.pdf | Bin 0 -> 928750 bytes
pex2024/documents/Regulation_on_projects_FCT_EN.pdf | Bin 0 -> 462502 bytes
sample.csv | 100 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/2023-03-13 | Tarefa 01.eml | 172 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/Untitled.ipynb | 6 ++++++
students/amartins/tarefas/Untitled1.ipynb | 424 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/__pycache__/bninput.cpython-311.pyc | Bin 0 -> 5504 bytes
students/amartins/tarefas/__pycache__/bninput.cpython-39.pyc | Bin 0 -> 2433 bytes
students/amartins/tarefas/__pycache__/tarefa1.cpython-311.pyc | Bin 0 -> 4974 bytes
students/amartins/tarefas/__pycache__/tarefa2.cpython-311.pyc | Bin 0 -> 4259 bytes
students/amartins/tarefas/asia.lp | 43 +++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/asia2.bif | 60 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/asia2.pkl | Bin 0 -> 3471 bytes
students/amartins/tarefas/basic.lp | 3 +++
students/amartins/tarefas/bninput.py | 99 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/bridge_pyasp.py | 22 ++++++++++++++++++++++
students/amartins/tarefas/graph_asia2.png | Bin 0 -> 33454 bytes
students/amartins/tarefas/notas.md | 67 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/t2profile.txt | 9733 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/tarefa1.py | 81 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/tarefa1a.py | 38 ++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/tarefa1b.py | 35 +++++++++++++++++++++++++++++++++++
students/amartins/tarefas/tarefa2.md | 87 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/tarefa2.pdf | Bin 0 -> 117788 bytes
students/amartins/tarefas/tarefa2.py | 79 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
students/amartins/tarefas/test/test_bninput.py | 13 +++++++++++++
students/amartins/tarefas/v01-tarefa1a.py | 31 +++++++++++++++++++++++++++++++
students/biblio/final_paper.pdf | Bin 0 -> 243022 bytes
students/zugzwuang-amartins.code-workspace | 11 +++++++++++
text/backup/probast_draft/probast_draf.pdf | Bin 0 -> 84270 bytes
text/backup/probast_draft/probast_draf.tex | 323 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/00_DRAFTS.md | 21 +++++++++++++++++++++
text/backup/zz_old/00_PASP.pdf | Bin 0 -> 96488 bytes
text/backup/zz_old/00_PASP.tex | 1047 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/00_PROB.pdf | Bin 0 -> 19955 bytes
text/backup/zz_old/Empty File | 0
text/backup/zz_old/Pabc_alpha03.pdf | Bin 0 -> 12659 bytes
text/backup/zz_old/README.md | 67 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/README.pdf | Bin 0 -> 10598 bytes
text/backup/zz_old/SCASP-best-practices.pdf | Bin 0 -> 88835 bytes
text/backup/zz_old/State of the art.txt | 42 ++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/drafts.pdf | Bin 0 -> 4540 bytes
text/backup/zz_old/drafts.tex | 83 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/meetings.pdf | Bin 0 -> 25126 bytes
text/backup/zz_old/probast_draft/probast_draf.pdf | Bin 0 -> 78987 bytes
text/backup/zz_old/probast_draft/probast_draf.tex | 434 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/proposal/Objectivos .md | 1 +
text/backup/zz_old/proposal/proposal.md | 49 +++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/proposal/proposal.pdf | Bin 0 -> 58182 bytes
text/backup/zz_old/proposal/proposal.tex | 111 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/backup/zz_old/proposal/zugzwang.bib | 48 ++++++++++++++++++++++++++++++++++++++++++++++++
text/paper_01/LLNCS/aasasp-llncs.pdf | Bin 0 -> 390738 bytes
text/paper_01/LLNCS/aasasp-llncs.tex | 1336 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/paper_01/LLNCS/asp.bib | 15 +++++++++++++++
text/paper_01/LLNCS/example_annotASP2plainASP.txt | 14 ++++++++++++++
text/paper_01/LLNCS/extended_abstract.txt | 7 +++++++
text/paper_01/LLNCS/foundations.bib | 17 +++++++++++++++++
text/paper_01/LLNCS/llncs.cls | 1208 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/paper_01/LLNCS/zugz-paper_01.code-workspace | 11 +++++++++++
text/paper_01/LLNCS/zugzwang.bib | 251 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/paper_01/asp.bib | 15 +++++++++++++++
text/paper_01/example_annotASP2plainASP.txt | 14 ++++++++++++++
text/paper_01/foundations.bib | 17 +++++++++++++++++
text/paper_01/pre-paper.pdf | Bin 0 -> 451571 bytes
text/paper_01/pre-paper.tex | 1342 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/paper_01/related_papers_plingo.md | 9 +++++++++
text/paper_01/reviews/pre-paperComments.pdf | Bin 0 -> 368312 bytes
text/paper_01/temp.fc/LecBayesNetsAndInference.pdf | Bin 0 -> 999376 bytes
text/paper_01/temp.fc/hj18.pdf | Bin 0 -> 5907106 bytes
text/paper_01/temp.fc/lec15.pdf | Bin 0 -> 992202 bytes
text/paper_01/zugz-paper_01.code-workspace | 11 +++++++++++
text/paper_01/zugzwang.bib | 232 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/00base/abstract.md | 13 +++++++++++++
text/presentation_01/00base/color.lp | 15 +++++++++++++++
text/presentation_01/00base/drafts.ipynb | 11322 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/00base/iris_plot.pdf | Bin 0 -> 14302 bytes
text/presentation_01/00base/iris_plot.svg | 2295 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/00base/pqueens.lp | 21 +++++++++++++++++++++
text/presentation_01/00base/probasp.pdf | Bin 0 -> 122663 bytes
text/presentation_01/00base/probasp.tex | 1203 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/00base/scg.lp | 40 ++++++++++++++++++++++++++++++++++++++++
text/presentation_01/bits_goa/bits_goa-2024-01-10.pdf | Bin 0 -> 122632 bytes
text/presentation_01/bits_goa/bits_goa-2024-01-10.tex | 1210 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/bits_goa/iris_plot.pdf | Bin 0 -> 14302 bytes
text/presentation_01/cima_pdoutmat_2023-12-11/cima_pdoutmat_2023-12-11.pdf | Bin 0 -> 122537 bytes
text/presentation_01/cima_pdoutmat_2023-12-11/cima_pdoutmat_2023-12-11.tex | 1203 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/cima_pdoutmat_2023-12-11/iris_plot.pdf | Bin 0 -> 14302 bytes
text/presentation_01/cima_pdoutmat_2023-12-11/iris_plot.svg | 2295 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/mead/iris_plot.pdf | Bin 0 -> 14302 bytes
text/presentation_01/mead/iris_plot.svg | 2295 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/presentation_01/mead/probasp.pdf | Bin 0 -> 122532 bytes
text/presentation_01/mead/probasp.tex | 1203 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/summaries/00_ASP.md | 239 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/summaries/00_DistSem.md | 111 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/summaries/00_DistSem.pdf | Bin 0 -> 43204 bytes
text/summaries/00_ILP.md | 74 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/summaries/00_ILP.pdf | Bin 0 -> 37760 bytes
text/summaries/00_PASP.pdf | Bin 0 -> 96486 bytes
text/summaries/00_PASP_credal.md | 143 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
text/summaries/00_POTASSCO.md | 13 +++++++++++++
text/summaries/00_PROB.md | 41 +++++++++++++++++++++++++++++++++++++++++
text/summaries/00_Z3.md | 14 ++++++++++++++
text/summaries/00_pasp.md | 18 ++++++++++++++++++
zugzwang.code-workspace | 29 +++++++++++++++++++++++++++++
469 files changed, 62518 insertions(+), 0 deletions(-)
create mode 100644 2023-11-11--biblio.zip
create mode 100644 NOVALINCS/00-Application_Form-FINAL.md
create mode 100644 NOVALINCS/00-Application_Form-FINAL.pdf
create mode 100644 NOVALINCS/00-Call-TEMPLATE.md
create mode 100644 NOVALINCS/00-Call-TEMPLATE.pdf
create mode 100644 NOVALINCS/01-Call-DRAFT.md
create mode 100644 NOVALINCS/01-Call-DRAFT.pdf
create mode 100644 NOVALINCS/01-Call-Underg_A.md
create mode 100644 NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.docx
create mode 100644 NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.gddoc
create mode 100644 NOVALINCS/TdOS-JasonMAllen.jpg
create mode 100644 NOVALINCS/bolsas/BI/2023-01-91 | Oficio Juri.gddoc
create mode 100644 NOVALINCS/bolsas/BI/2023-02-01 _ Ata1.pdf
create mode 100644 NOVALINCS/bolsas/BI/2023-02-01 | Ata1.gddoc
create mode 100644 NOVALINCS/bolsas/BI/2023-02-03 | Edital | EN.pdf
create mode 100644 NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.gddoc
create mode 100644 NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.pdf
create mode 100644 NOVALINCS/bolsas/BI/2023-03-01 _ Ata 2.pdf
create mode 100644 NOVALINCS/bolsas/BI/2023-03-01 | Ata 2.gddoc
create mode 100644 NOVALINCS/bolsas/BI/signed/2023-01-19 | BI | Oficio Juri.pdf
create mode 100644 NOVALINCS/bolsas/BI/signed/2023-02-01 | BI | Ata 01.pdf
create mode 100644 NOVALINCS/bolsas/BI/signed/2023-03-01 | BI | Ata 02.pdf
create mode 100644 NOVALINCS/bolsas/BI/zz_old/Edital BolsaInv.MSc | Zugzwang | EN.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-01-19 | Oficio Homologação Júri.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-01-19 | Oficio Juri BolsaII.Lic Zugzwang.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-02-01 _ Ata1.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-02-01 | Ata1.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | EN.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | PT.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-02-03 | Edital PT_bolsa_BII_novalincs.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-03-01 _ Ata 2.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-03-01 | Ata 2.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-02 13:23 | Entrevista | Email Convocatória.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista (Respostas).gdsheet
create mode 100644 NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista.gdform
create mode 100644 NOVALINCS/bolsas/BII/2023-03-02 18:00 | Ata3.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-02 18_00 _ Ata3.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-03-03 | Notificação Candidatos.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-07 | BII | Declaração Conflito de Interesses.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-07 | BII | Plano de Trabalhos.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-17 | Ata 4.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-27 | Ofício Início Bolsa II.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-03-29 | BII | Inicio de Bolsa.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-04-26 | Oficio Início de Bolsa.pdf
create mode 100644 NOVALINCS/bolsas/BII/2023-09-01 | Inquérito Atividades Bolseiros.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-09-01 | Oficio Renovação Bolsa.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-09-01 | Relatorio Atividades Bolseiros.gddoc
create mode 100644 NOVALINCS/bolsas/BII/2023-99-03 | Minuta Contrato Bolsa.gddoc
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.png
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 | Inscrições.png
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/AlicE Martins.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Candidatura à Bolsa de Iniciação à Investigação | Alice Martins.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Plano de Trabalhos.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Captura de ecrã de 2023-02-27 16-35-44.png
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Consulta IBAN, BIC e SWIFT 22-05-2023 14 15.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_preenchida.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_prepreenchido.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/bolsa.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_aproveitamento_escolar.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao-2023.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/dados.md
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Oficio Renovação Bolsa.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/Declaração_Generali_ausência de acidentes (1).docx
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/12-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.md
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/renovacao-amartins.zip
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/comprovativo_matricula-inscricao-2023.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/ofício_renovação-signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/parecer_renovação-signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/plano_trabalhos-signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/relatorio_atividades-signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Oficio Renovação Bolsa.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/Declaração_Generali_ausência de acidentes (1).docx
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/12-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/15-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.md
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/renovacao-amartins.zip
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/15-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/Declaração_Generali_ausência de acidentes.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/comprovativo_matricula-inscricao-2023.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/parecer_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/plano-trabalhos.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/relatorio_atividades-signed_am_fc.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/renovacao_BII_AliceMartins-documentos.zip
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Oficio Renovação Bolsa.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/Declaração_Generali_ausência de acidentes (1).docx
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/12-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/15-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.md
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.tex
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/renovacao-amartins.zip
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/15-renovacao-bolsa-alice_signed.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/Declaração_Generali_ausência de acidentes.docx
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/comprovativo_matricula-inscricao-2023.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/parecer_renovação.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/plano-trabalhos.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/relatorio_atividades-signed_am_fc.pdf
create mode 100644 NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/renovacao_BII_Alice_Martins-documentos.zip
create mode 100644 NOVALINCS/bolsas/BII/Ata 02.pdf
create mode 100644 NOVALINCS/bolsas/BII/Ata 04.pdf
create mode 100644 NOVALINCS/bolsas/BII/Ata 04.pdf.jpg
create mode 100644 NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/BII | Candidatura para Projeto | João Branquinho.pdf
create mode 100644 NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/Joao Branquinho.pdf
create mode 100644 NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/comprovativo_matricula_inscricao-1.pdf
create mode 100644 NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/disc + notas.jpg
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-01-19 | BII | Oficio Homologação Juri.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-02-01 | BII | Ata 01.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-02-15 | BII | JBranquinho | Comprovativo Matricula Inscrição.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Aproveitamento Escolar.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Matricula Inscricao.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-01 | BII | Ata 02.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Ata 03.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória | src.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | AMartins | Email Aceitação.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | Notificação Candidatos.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-06 | BII | JBranquinho | Email Aceitação.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | Bruno.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | fc.pdf
create mode 100644 NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Oficio Inicio de Bolsa.pdf
create mode 100644 NOVALINCS/bolsas/BII/zz-lostNfound/Edital EN.docx
create mode 100644 NOVALINCS/bolsas/BII/zz-lostNfound/Edital PT.docx
create mode 100644 NOVALINCS/bolsas/BII2/2023-03-03 Oficio Juri BII.pdf
create mode 100644 NOVALINCS/bolsas/BII2/2023-03-07 | BII2 | Oficio Juri.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-B | Ata 1.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-C | Edital | EN.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-C | Edital | PT.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-C | Edital | PT.pdf
create mode 100644 NOVALINCS/bolsas/BII2/2023-D | Ata 2.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-E | Notificação para Entrevista.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-F | Entrevista | Formulário.gdform
create mode 100644 NOVALINCS/bolsas/BII2/2023-G | Ata 3.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-H | Notificação Candidatos.gddoc
create mode 100644 NOVALINCS/bolsas/BII2/2023-I | Ata 4.gddoc
create mode 100644 NOVALINCS/bolsas/Estatuto Bolseiro de Investigação | Consolidação.pdf
create mode 100644 NOVALINCS/bolsas/RegulamentoBolsasFCT2019.pdf
create mode 100644 NOVALINCS/bolsas/Tabela_de_Valores_SMM_2022.pdf
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/1_minuta de oficio juri bolsa_2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/2_minuta de Ata1_2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_EN.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_PT.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/4_minuta de Ata2_2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/5_Notificaçõesparaentrevista.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/6_minuta de Ata3_2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/7_Notificacao_candidatos.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/8_minuta de Ata4_2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/9_Minuta oficio Inicio de Bolsa.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/A_Regulamentobolsas_FCT.pdf
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/B_Estatuto bolseiro_Consolidação.pdf
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/C_Tabela_de_Valores_SMM_atualizadoJan2022.pdf
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/Minuta_Contrato_Bolsa 2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/dec conflito de interesses 2023.gddoc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/1_minuta de oficio juri bolsa_2023.doc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/2_minuta de Ata1_2023.doc
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_EN.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_PT.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/4_minuta de Ata2_2023.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/5_Notificaçõesparaentrevista.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/6_minuta de Ata3_2023.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/7_Notificacao_candidatos.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/8_minuta de Ata4_2023.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/9_Minuta oficio Inicio de Bolsa.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/Minuta_Contrato_Bolsa 2023.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/dec conflito de interesses 2023.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/docx/modelo_relatorio_atividades_bolseiros_2023.docx
create mode 100644 NOVALINCS/bolsas/kit bolsas_2023/modelo_relatorio_atividades_bolseiros_2023.gddoc
create mode 100644 NOVALINCS/demo-markdown.md
create mode 100644 NOVALINCS/demo-markdown.pdf
create mode 100644 biblio.gdlink
create mode 100644 biblio/2002 - Answer set programming and plan generation.pdf
create mode 100644 biblio/2013 - Answer Set Solving in Practice - Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub.pdf
create mode 100644 biblio/2014 - A new method of proving the existence of answer sets for disjunctive logic programs.pdf
create mode 100644 biblio/2018 - Deep Learning, A critical appraisal - Gary Marcus.pdf
create mode 100644 biblio/2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf
create mode 100644 biblio/2019 - A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms - Bengio et al.pdf
create mode 100644 biblio/2019 - On the Measure of Intelligence - Francois Chollet.pdf
create mode 100644 biblio/2019 - Potassco User Guide.pdf
create mode 100644 biblio/2020 - ASP-Core-2 Input Language Format - Calimeri et al..pdf
create mode 100644 biblio/2020 - Prolog and Answer Set Programming - Languages in Logic Programming.pdf
create mode 100644 biblio/2020 - The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference - Fabio Gagliardi Cozman, Denis Deratani Mauá.pdf
create mode 100644 biblio/2021 - CASP and SCASP best practices.pdf
create mode 100644 biblio/ASP-DLV_tutorial.html
create mode 100644 biblio/ASP-DLV_tutorial.md
create mode 100644 biblio/Special Issue on Answer Set Programming-Abstract.pdf
create mode 100644 biblio/annotated -- 2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf
create mode 100644 biblio/plingo/2007-ProbLog - a probabilistic prolog and its application in link discovery.pdf
create mode 100644 biblio/plingo/2008-Probabilistic reasoning with answer sets.pdf
create mode 100644 biblio/plingo/2016-Weighted Rules under the Stable Model Semantics.pdf
create mode 100644 biblio/plingo/2017-LPMLN, Weak Constraints and P-log.pdf
create mode 100644 biblio/plingo/2021-Solution Enumeration by Optimality in Answer Set Programming.pdf
create mode 100644 code/.vscode/launch.json
create mode 100644 code/asp/drafts/alarm.lp
create mode 100644 code/asp/drafts/assp_pag43.lp
create mode 100644 code/asp/drafts/assp_pag46.lp
create mode 100644 code/asp/drafts/bachelor.lp
create mode 100644 code/asp/drafts/bachelor.pl
create mode 100644 code/asp/drafts/barber.lp
create mode 100644 code/asp/drafts/choices_01.lp
create mode 100644 code/asp/drafts/choices_02.lp
create mode 100644 code/asp/drafts/choices_03.lp
create mode 100644 code/asp/drafts/choices_04.lp
create mode 100644 code/asp/drafts/choices_05.lp
create mode 100644 code/asp/drafts/choices_06.lp
create mode 100644 code/asp/drafts/color.lp
create mode 100644 code/asp/drafts/credal_01.lp
create mode 100644 code/asp/drafts/cyclic.lp
create mode 100644 code/asp/drafts/cyclic.pl
create mode 100644 code/asp/drafts/disj.lp
create mode 100644 code/asp/drafts/double_negation.lp
create mode 100644 code/asp/drafts/ex03.lp
create mode 100644 code/asp/drafts/gcE01.lp
create mode 100644 code/asp/drafts/gcI01.lp
create mode 100644 code/asp/drafts/hanoiE.lp
create mode 100644 code/asp/drafts/hanoiI.lp
create mode 100644 code/asp/drafts/heads_tails.lp
create mode 100644 code/asp/drafts/monty_hall.lp
create mode 100644 code/asp/drafts/no_model_cyclic.lp
create mode 100644 code/asp/drafts/no_model_wa.lp
create mode 100644 code/asp/drafts/nonstrat.lp
create mode 100644 code/asp/drafts/onabove.lp
create mode 100644 code/asp/drafts/p01.lp
create mode 100644 code/asp/drafts/p18.lp
create mode 100644 code/asp/drafts/p19.lp
create mode 100644 code/asp/drafts/p20.lp
create mode 100644 code/asp/drafts/pasp01.lp
create mode 100644 code/asp/drafts/pasp_general.lp
create mode 100644 code/asp/drafts/paths.lp
create mode 100644 code/asp/drafts/pdist.lp
create mode 100644 code/asp/drafts/pqr.lp
create mode 100644 code/asp/drafts/pqueens.lp
create mode 100644 code/asp/drafts/prob01.lp
create mode 100644 code/asp/drafts/prob02.lp
create mode 100644 code/asp/drafts/py_01.lp
create mode 100644 code/asp/drafts/py_02.lp
create mode 100644 code/asp/drafts/roads.lp
create mode 100644 code/asp/drafts/s.lp
create mode 100644 code/asp/drafts/toh.lp
create mode 100644 code/asp/drafts/tohE.lp
create mode 100644 code/asp/drafts/tohI.lp
create mode 100644 code/asp/drafts/tutorial_01.pl
create mode 100644 code/asp/drafts/tutotial_01.lp
create mode 100644 code/asp/drafts/unsound.lp
create mode 100644 code/asp/fplp/example_05-1.lp
create mode 100644 code/asp/fplp/example_05-2.lp
create mode 100644 code/asp/plp/alarm.plp
create mode 100644 code/asp/plp/coins.plp
create mode 100644 code/asp/plp/cplint.plp
create mode 100644 code/asp/plp/sbfe.plp
create mode 100644 code/asplang/ASPLang.jl
create mode 100644 code/asplang/asp-core-2_syntax.ebnf
create mode 100644 code/asplang/draftASP.jl
create mode 100644 code/asplang/drafts.jl
create mode 100644 code/asplang/sbf.plp
create mode 100644 code/asplang/testASPLang.jl
create mode 100644 code/asplang/tests_ASPlang.jl
create mode 100644 code/biflang/BIFLang.jl
create mode 100644 code/biflang/asia2.bif
create mode 100644 code/biflang/bif.ebnf
create mode 100644 code/biflang/bif.txt
create mode 100644 code/biflang/draft_biflang.jl
create mode 100644 code/biflang/notes.md
create mode 100644 code/drafts/.ipynb_checkpoints/EventLattice-checkpoint.ipynb
create mode 100644 code/drafts/.ipynb_checkpoints/Untitled-checkpoint.ipynb
create mode 100644 code/drafts/.ipynb_checkpoints/Untitled1-checkpoint.ipynb
create mode 100644 code/drafts/.ipynb_checkpoints/sample_analysis-checkpoint.jl
create mode 100644 code/drafts/.ipynb_checkpoints/teste-checkpoint.ipynb
create mode 100644 code/drafts/EventLattice.ipynb
create mode 100644 code/drafts/Untitled.ipynb
create mode 100644 code/drafts/Untitled1.ipynb
create mode 100644 code/drafts/__init__.py
create mode 100644 code/drafts/__pycache__/event_lattice.cpython-39.pyc
create mode 100644 code/drafts/algebra.py
create mode 100644 code/drafts/api_01.py
create mode 100644 code/drafts/arithfunclang.jl
create mode 100644 code/drafts/arithlang.jl
create mode 100644 code/drafts/drafts.ipynb
create mode 100644 code/drafts/drafts.jl
create mode 100644 code/drafts/event_lattice.py
create mode 100644 code/drafts/explore_01.py
create mode 100644 code/drafts/model_sample-[0.0;0.3;0.2].csv
create mode 100644 code/drafts/model_sample-[0.0;0.3;0.5].csv
create mode 100644 code/drafts/model_sample-[0.1;0.3;0.2].csv
create mode 100644 code/drafts/model_sample-[0.1;0.3;0.5].csv
create mode 100644 code/drafts/model_sample-[0.1;0.3;0.8].csv
create mode 100644 code/drafts/model_sample.csv
create mode 100644 code/drafts/sample.csv
create mode 100644 code/drafts/sample_analysis.jl
create mode 100644 code/drafts/sampling.jl
create mode 100644 code/drafts/symbops.py
create mode 100644 code/drafts/teste.ipynb
create mode 100644 code/julia/BIFParser.jl
create mode 100644 code/julia/asia2.bif
create mode 100644 code/julia/asia2.lp
create mode 100644 code/julia/asplang.jl
create mode 100644 code/julia/bif2asp.jl
create mode 100644 code/julia/dados.dat
create mode 100644 code/julia/drafts.jl
create mode 100644 code/julia/forward.jl
create mode 100644 code/julia/miguel.jl
create mode 100644 code/problog/alarm.pl
create mode 100644 code/problog/nats.pl
create mode 160000 code/sasp
create mode 100644 code/zugzwang_code.code-workspace
create mode 100644 cspell.json
create mode 100644 notes.md
create mode 100644 notes.pdf
create mode 100644 pex2024/FCT-Sessão_esclarecimento-2024-01-23.md
create mode 100644 pex2024/candidatura.md
create mode 100644 pex2024/documents/Application_Guide_PeX_2023.pdf
create mode 100644 pex2024/documents/Aviso_de_Abertura_PEX_2023.pdf
create mode 100644 pex2024/documents/Data_Protection_PEX_2023.pdf
create mode 100644 pex2024/documents/Ethics_Self_Assessment_Guide.pdf
create mode 100644 pex2024/documents/Guiao_CIENCIAVITAE.pdf
create mode 100644 pex2024/documents/Regulation_on_projects_FCT_EN.pdf
create mode 100644 sample.csv
create mode 100644 students/amartins/2023-03-13 | Tarefa 01.eml
create mode 100644 students/amartins/tarefas/Untitled.ipynb
create mode 100644 students/amartins/tarefas/Untitled1.ipynb
create mode 100644 students/amartins/tarefas/__pycache__/bninput.cpython-311.pyc
create mode 100644 students/amartins/tarefas/__pycache__/bninput.cpython-39.pyc
create mode 100644 students/amartins/tarefas/__pycache__/tarefa1.cpython-311.pyc
create mode 100644 students/amartins/tarefas/__pycache__/tarefa2.cpython-311.pyc
create mode 100644 students/amartins/tarefas/asia.lp
create mode 100644 students/amartins/tarefas/asia2.bif
create mode 100644 students/amartins/tarefas/asia2.pkl
create mode 100644 students/amartins/tarefas/basic.lp
create mode 100644 students/amartins/tarefas/bninput.py
create mode 100644 students/amartins/tarefas/bridge_pyasp.py
create mode 100644 students/amartins/tarefas/graph_asia2.png
create mode 100644 students/amartins/tarefas/notas.md
create mode 100644 students/amartins/tarefas/t2profile.txt
create mode 100644 students/amartins/tarefas/tarefa1.py
create mode 100644 students/amartins/tarefas/tarefa1a.py
create mode 100644 students/amartins/tarefas/tarefa1b.py
create mode 100644 students/amartins/tarefas/tarefa2.md
create mode 100644 students/amartins/tarefas/tarefa2.pdf
create mode 100755 students/amartins/tarefas/tarefa2.py
create mode 100644 students/amartins/tarefas/test/test_bninput.py
create mode 100644 students/amartins/tarefas/v01-tarefa1a.py
create mode 100644 students/biblio/final_paper.pdf
create mode 100644 students/zugzwuang-amartins.code-workspace
create mode 100644 text/backup/probast_draft/probast_draf.pdf
create mode 100644 text/backup/probast_draft/probast_draf.tex
create mode 100644 text/backup/zz_old/00_DRAFTS.md
create mode 100644 text/backup/zz_old/00_PASP.pdf
create mode 100644 text/backup/zz_old/00_PASP.tex
create mode 100644 text/backup/zz_old/00_PROB.pdf
create mode 100644 text/backup/zz_old/Empty File
create mode 100644 text/backup/zz_old/Pabc_alpha03.pdf
create mode 100644 text/backup/zz_old/README.md
create mode 100644 text/backup/zz_old/README.pdf
create mode 100644 text/backup/zz_old/SCASP-best-practices.pdf
create mode 100644 text/backup/zz_old/State of the art.txt
create mode 100644 text/backup/zz_old/drafts.pdf
create mode 100644 text/backup/zz_old/drafts.tex
create mode 100644 text/backup/zz_old/meetings.pdf
create mode 100644 text/backup/zz_old/probast_draft/probast_draf.pdf
create mode 100644 text/backup/zz_old/probast_draft/probast_draf.tex
create mode 100644 text/backup/zz_old/proposal/Objectivos .md
create mode 100644 text/backup/zz_old/proposal/proposal.md
create mode 100644 text/backup/zz_old/proposal/proposal.pdf
create mode 100644 text/backup/zz_old/proposal/proposal.tex
create mode 100644 text/backup/zz_old/proposal/zugzwang.bib
create mode 100644 text/paper_01/LLNCS/aasasp-llncs.pdf
create mode 100644 text/paper_01/LLNCS/aasasp-llncs.tex
create mode 100644 text/paper_01/LLNCS/asp.bib
create mode 100644 text/paper_01/LLNCS/example_annotASP2plainASP.txt
create mode 100644 text/paper_01/LLNCS/extended_abstract.txt
create mode 100644 text/paper_01/LLNCS/foundations.bib
create mode 100644 text/paper_01/LLNCS/llncs.cls
create mode 100644 text/paper_01/LLNCS/zugz-paper_01.code-workspace
create mode 100644 text/paper_01/LLNCS/zugzwang.bib
create mode 100644 text/paper_01/asp.bib
create mode 100644 text/paper_01/example_annotASP2plainASP.txt
create mode 100644 text/paper_01/foundations.bib
create mode 100644 text/paper_01/pre-paper.pdf
create mode 100644 text/paper_01/pre-paper.tex
create mode 100644 text/paper_01/related_papers_plingo.md
create mode 100644 text/paper_01/reviews/pre-paperComments.pdf
create mode 100644 text/paper_01/temp.fc/LecBayesNetsAndInference.pdf
create mode 100644 text/paper_01/temp.fc/hj18.pdf
create mode 100644 text/paper_01/temp.fc/lec15.pdf
create mode 100644 text/paper_01/zugz-paper_01.code-workspace
create mode 100644 text/paper_01/zugzwang.bib
create mode 100644 text/presentation_01/00base/abstract.md
create mode 100644 text/presentation_01/00base/color.lp
create mode 100644 text/presentation_01/00base/drafts.ipynb
create mode 100644 text/presentation_01/00base/iris_plot.pdf
create mode 100644 text/presentation_01/00base/iris_plot.svg
create mode 100644 text/presentation_01/00base/pqueens.lp
create mode 100644 text/presentation_01/00base/probasp.pdf
create mode 100644 text/presentation_01/00base/probasp.tex
create mode 100644 text/presentation_01/00base/scg.lp
create mode 100644 text/presentation_01/bits_goa/bits_goa-2024-01-10.pdf
create mode 100644 text/presentation_01/bits_goa/bits_goa-2024-01-10.tex
create mode 100644 text/presentation_01/bits_goa/iris_plot.pdf
create mode 100644 text/presentation_01/cima_pdoutmat_2023-12-11/cima_pdoutmat_2023-12-11.pdf
create mode 100644 text/presentation_01/cima_pdoutmat_2023-12-11/cima_pdoutmat_2023-12-11.tex
create mode 100644 text/presentation_01/cima_pdoutmat_2023-12-11/iris_plot.pdf
create mode 100644 text/presentation_01/cima_pdoutmat_2023-12-11/iris_plot.svg
create mode 100644 text/presentation_01/mead/iris_plot.pdf
create mode 100644 text/presentation_01/mead/iris_plot.svg
create mode 100644 text/presentation_01/mead/probasp.pdf
create mode 100644 text/presentation_01/mead/probasp.tex
create mode 100644 text/summaries/00_ASP.md
create mode 100644 text/summaries/00_DistSem.md
create mode 100644 text/summaries/00_DistSem.pdf
create mode 100644 text/summaries/00_ILP.md
create mode 100644 text/summaries/00_ILP.pdf
create mode 100644 text/summaries/00_PASP.pdf
create mode 100644 text/summaries/00_PASP_credal.md
create mode 100644 text/summaries/00_POTASSCO.md
create mode 100644 text/summaries/00_PROB.md
create mode 100644 text/summaries/00_Z3.md
create mode 100644 text/summaries/00_pasp.md
create mode 100644 zugzwang.code-workspace
diff --git a/2023-11-11--biblio.zip b/2023-11-11--biblio.zip
new file mode 100644
index 0000000..b67ef93
Binary files /dev/null and b/2023-11-11--biblio.zip differ
diff --git a/NOVALINCS/00-Application_Form-FINAL.md b/NOVALINCS/00-Application_Form-FINAL.md
new file mode 100644
index 0000000..1fcb5d5
--- /dev/null
+++ b/NOVALINCS/00-Application_Form-FINAL.md
@@ -0,0 +1,53 @@
+# Zugzwang | Logic and Artificial Intelligence
+
+## Team
+
+- Francisco Coelho
+- Salvador Abreu (PI)
+- Bruno Dinis (External Collaborator)
+
+## Research Questions
+
+How to extend probability annotations on an ASP program to a distribution over the possible observations? In general, the association of probabilities to some facts is not enough to uniquely define a probability of stable models. This lack of information must be carefully expressed and handled, to avoid biased results.
+
+Once made explicit, how to use such distribution, together with an empiric distribution from a dataset, to do general probabilistic tasks such as the estimation of a marginal or of the joint probability? Having a probability on a set of observations, including the stable models, might not cover all the sample space. Again, information and structure entailed from the ASP program must guide unbiased extensions to the sample space.
+
+How to use distribution measures to score ASP programs? We view ASP programs as formalized knowledge about an observable system. Some of those programs will be "better" than others, as determined by a quantitative, objective, measure, rooted on well-known functions such as the Kullback–Leibler divergence.
+
+This last question leads to the application of evolutionary algorithms to inductive logic programming and to a bridge with common machine learning methods, where a model is scored by a dataset. Other important questions lie behind the scope of this project. For example, how to deal with latent, unobserved, variables?
+
+## Novelty/Impact
+
+ASP has some key advantages over Prolog, most of which result from ASP being a truly declarative language and modern APS systems, such as CLASP, apply efficient optimisation techniques. Other systems, like ILASP, learn ASP programs with normal rules, choice rules, and hard and weak constraints. Moreover, ASP can use recent important advances concerning SAT solvers to ILP tasks. However, the assumption that the knowledge base (BK) is perfect, leaving no room for uncertainty, poses here a major limitation.
+
+One approach to overcome this restriction on logic programs is Statistical Relationship Learning (StarAI), that extends the BK with probabilities in order to setup a distribution representation. The formal setting for this approach rests on Sato's Distribution Semantics and frames systems such as Problog and PRISM. But these systems are oriented towards Prolog-like programs and semantic and leave out ASP program learning.
+
+One important ongoing research question is the precise semantic of an ASP program annotated with probabilities. Sato's semantic specify an unique probability distribution over Prolog-like program's atoms, but this uniqueness fails for ASP programs. Efforts to address this problem are either based on Credal sets or on selecting one probability over others, such as the P-log, the LP^MLN or the PrASP languages.
+
+The novelty of this research is to define the semantic of an ASP program + probability annotated facts + observations from the following process: (a) parametrise the uncertainty on stable models and annotations, (b) setup a partition of the sample space around on the stable models and (c) use observations to estimate the value of the uncertainty parameters of step (a).
+If successful, it would have an impact on how logic programs express and are used to deal with real-world problems, where both uncertainty and formal KB are required ingredients. Also, when used in ILP problems the resulting models are logic programs, much simpler to understand than numeric models.
+
+## Expected Results / Demonstrators
+
+Our aim is to develop a set of software tools to apply and evaluate the theoretical results on well-known, and relevant, problems. The initial target framework is the Potassco suite, that provides a Python API to state-of-the-art grounding (CLASP) and solving (CLINGO) tools, as well as ASP-Core-2 Language support.
+
+The researchers will do the theoretical study and supervise one to three undergraduate, master or Ph.D. students on the implementation tasks. Theoretical work includes formalization and assessment of methods; The students will implement the tools required to experiment, explore and test those methods. The degree of complexity of the implementation tasks must be adapted to the individual competences and interests of the students.
+
+The theoretical work is to be reported in one or two papers with intermediate results and a final comprehensive paper for a conference.
+
+## Relationship of activity w/ NOVA LINCS strategic program and Research Group work plan
+
+This project involves two members from the NOVA LINCS "Knowledge-Based Systems" research group, from the Universidade de Évora pole and a member of the CIMA center from the Universidade de Évora.
+
+Part of the proposed research and software is currently being developed.
+
+## Resources required and justification
+
+Students are expected to benefit from a BIC or a BI scholarship. Depending on the candidates the respective durations can range from 3 to 12 months and the respective amounts from 486.12€ to 1144.64€ per month.
+
+Considering one undergraduate student with a 3 month scholarship:
+
+- 972.24 € = 3 months x 486.12 €/month;
+- TOTAL: 972.24 €
+
+
diff --git a/NOVALINCS/00-Application_Form-FINAL.pdf b/NOVALINCS/00-Application_Form-FINAL.pdf
new file mode 100644
index 0000000..1e371bc
Binary files /dev/null and b/NOVALINCS/00-Application_Form-FINAL.pdf differ
diff --git a/NOVALINCS/00-Call-TEMPLATE.md b/NOVALINCS/00-Call-TEMPLATE.md
new file mode 100644
index 0000000..b4b0cb0
--- /dev/null
+++ b/NOVALINCS/00-Call-TEMPLATE.md
@@ -0,0 +1,54 @@
+# Concurso Bolsa | TEMPLATE
+
+- _centro de investigação ou departamento_
+
+- _identificação da tipologia de bolsa oferecida e número de vagas_
+
+- _dia_ de _mês_ de 2023
+
+Encontra-se aberto concurso para a atribuição de _número_ Bolsas _tipo_ no âmbito do projeto _título do projeto_, _referência_, financiado por fundos nacionais através da _…_ exemplo: FCT/MCTES e cofinanciado pelo Fundo Europeu de Desenvolvimento Regional _FEDER_ através do COMPETE – Programa Operacional Fatores de Competitividade _POFC_ _quando aplicável_, nas seguintes condições:
+
+- **Área Científica:** …
+
+- **Requisitos de admissão:** _indicar a habilitação académica necessária, bem como a experiência exigida em investigação e outros requisitos de admissão, incluindo fatores preferenciais_
+Escolher uma opção:
+
+ - Conforme o Regulamento de Bolsas de Investigação da FCT nº950/2019 de 16 de dezembro de 2019, artigo 3º e 6º, os candidatos a BI _Bolsas de Investigação_ devem cumprir como condição para a atribuição da bolsa, a inserção efetiva em ciclos de estudos conducentes à atribuição de graus académicos ou em cursos não conferentes de grau académico. Os cursos não conferentes de grau académico correspondem aos cursos previstos na alínea e_ do nº 3 do artigo 4º do Decreto-Lei nº74/2006 de 24 de março e deverão ser desenvolvidos numa instituição de ensino superior em associação a pelo menos uma unidade de I&D, incluindo-se o plano do curso numa ou em várias áreas de investigação da unidade.
+ - Conforme o Regulamento de Bolsas de Investigação da FCT nº950/2019 de 16 de dezembro de 2019, artigo 5º, — As BII _Bolsas de Iniciação à Investigação_ não podem ser atribuídas a quem já tenha beneficiado de bolsas de investigação direta ou indiretamente financiadas pela FCT, atribuídas nos termos do Estatuto do Bolseiro de Investigação.
+ - Relativamente às BIPD _Bolsas de Investigação Pós-doutoral_, ao nível dos requisitos a verificar para atribuição das mesmas _artigo 7º do Regulamento de Bolsas de Investigação da FCT nº950/2019_ destaca-se a necessidade do grau de doutor ter sido obtido nos 3 anos anteriores à data de submissão da candidatura à bolsa e, ao nível da sua execução, o facto de apenas poder ser renovada até ao prazo máximo de 3 anos.
+
+- **Plano de trabalhos:** _apresentar um resumo dos trabalhos a desenvolver e dos objetivos a atingir_
+
+- **Legislação e regulamentação aplicável:** A concessão da Bolsa de Investigação será realizada mediante a celebração de um contrato entre a Universidade de Évora e o bolseiro conforme minuta , nos termos do Estatuto do Bolseiro de Investigação _Lei nº40/2004 de 18 de agosto e decreto-lei nº 123/2019 de 28 de agosto_ e de acordo com a legislação e Regulamento de Bolsas de Investigação da Fundação para a Ciência e a Tecnologia, I.P em vigor, regulamento nº950/2019 de 16 de dezembro de 2019: e demais normas aplicáveis.
+
+- **Local de trabalho:** O trabalho será desenvolvido no(a) _denominação da unidade de investigação_ da Universidade de Évora, sob a orientação científica do Professor(a)/Doutor(a) ………
+
+- **Duração da(s) bolsa(s):** A bolsa terá a duração de ..... meses, com início previsto em ..... _mês_ de .......... _ano_. O contrato de bolsa poderá ser renovado até _ex._ ao máximo de ….. meses ou até ao final da dotação orçamental do projeto de financiamento _…_.
+
+- **Valor do subsídio de manutenção mensal:** O montante da bolsa corresponde a €………., conforme tabela de valores das bolsas atribuídas diretamente pela FCT, I.P. no País _http://fct.pt/apoios/bolsas/valores_, sendo os pagamentos efetuados mensalmente, através de cheque ou transferência bancária.
+
+- **Métodos de seleção:** Os métodos de seleção a utilizar serão os seguintes: _avaliação curricular, entrevista, provas de conhecimento, ou outros_, com a respetiva valoração de _indicar os valores atribuídos a cada critério ou item avaliado e sua ponderação percentual_.
+
+- **Composição do Júri de Seleção:** _identificação do Presidente do Júri e dos vogais efetivos e suplentes_
+
+- **Forma de publicitação/notificação dos resultados:** Os resultados finais da avaliação serão publicitados, através de lista ordenada _alfabeticamente, por nota final obtida ou outra_ afixada em local visível e público do(a) _indicar local da instituição_, sendo o candidato(a) aprovado(a) notificado através de _email, ofício ou outro_.
+Nos termos de direito de audiência prévia dos interessados o projeto de Classificação Final será anunciado por qualquer meio escrito a todos os interessados.
+Após comunicação da lista provisória dos resultados da avaliação, os candidatos dispõem de um período de 10 dias úteis para, querendo, se pronunciarem em sede de audiência prévia de interessados.
+
+- **Prazo de candidatura e forma de apresentação das candidaturas:** O concurso encontra-se aberto no período de ......................... a ......................... de 2022 e os resultados da seleção serão publicados até………………..de………………….de 2022. _O prazo de apresentação de candidaturas não deve ser inferior a 10 dias úteis_.
+
+- **As candidaturas devem ser formalizadas**, obrigatoriamente, através do envio de carta de candidatura acompanhada dos seguintes documentos: _ex: Curriculum Vitae, certificado de habilitações, cartas de referência ou recomendação e outros documentos comprovativos considerados relevantes_.
+ - Para efeitos de candidatura os comprovativos podem ser substituídos por declaração de honra do candidato, mas a não demonstração, em fase de contratualização, da posse do grau exigido à data limite da candidatura ou a não apresentação dos comprovativos de matrícula ou inscrição em ciclo de estudos ou curso não conferente de grau, para as bolsas com essa componente, implicam a anulação da avaliação do candidato.
+ - Os graus académicos obtidos em países estrangeiros necessitam de registo por uma Instituição Portuguesa de acordo com o Decreto-lei nº. 66/2018, de 16 de agosto e a Portaria nº. 33/2019, de 25 de janeiro. A apresentação do certificado é obrigatória para a assinatura do contrato.
+ Mais informação poderá ser obtida em:
+
+
+- **As candidaturas deverão ser remetidas por e-mail para:**
+ - Prof. Doutor(a)………………….
+ - _Centro/Dep._……………………………….. da Universidade de Évora
+ - e-mail:
+
+
+
+_logos do programa de financiamento quando aplicável_
+
diff --git a/NOVALINCS/00-Call-TEMPLATE.pdf b/NOVALINCS/00-Call-TEMPLATE.pdf
new file mode 100644
index 0000000..a8670c5
Binary files /dev/null and b/NOVALINCS/00-Call-TEMPLATE.pdf differ
diff --git a/NOVALINCS/01-Call-DRAFT.md b/NOVALINCS/01-Call-DRAFT.md
new file mode 100644
index 0000000..1f0f4d1
--- /dev/null
+++ b/NOVALINCS/01-Call-DRAFT.md
@@ -0,0 +1,12 @@
+# Concurso Bolsa | Zugzwang | DRAFT
+
+> A minuta das candidatura define vários campos a preencher. Quase todos são triviais mas os restantes são **críticos**. Estes necessitam de consenso entre nós.
+>
+> Além disso, no projeto ficou em aberto o número e tipologia de bolsas. Agora temos de concretizar essas opções: **Exatamente,** quantas bolsas de que tipo?
+
+## Campos Críticos
+
+- **Requisitos de admissão:** _indicar a habilitação académica necessária, bem como a experiência exigida em investigação e outros requisitos de admissão, incluindo fatores preferenciais_
+- **Plano de trabalhos:** _apresentar um resumo dos trabalhos a desenvolver e dos objetivos a atingir_
+- **Métodos de seleção:** Os métodos de seleção a utilizar serão os seguintes: _avaliação curricular, entrevista, provas de conhecimento, ou outros_, com a respetiva valoração de _indicar os valores atribuídos a cada critério ou item avaliado e sua ponderação percentual_.
+- **As candidaturas devem ser formalizadas**, obrigatoriamente, através do envio de carta de candidatura acompanhada dos seguintes documentos: _ex: Curriculum Vitae, certificado de habilitações, cartas de referência ou recomendação e outros documentos comprovativos considerados relevantes_.<<<>>>
\ No newline at end of file
diff --git a/NOVALINCS/01-Call-DRAFT.pdf b/NOVALINCS/01-Call-DRAFT.pdf
new file mode 100644
index 0000000..e0a5a52
Binary files /dev/null and b/NOVALINCS/01-Call-DRAFT.pdf differ
diff --git a/NOVALINCS/01-Call-Underg_A.md b/NOVALINCS/01-Call-Underg_A.md
new file mode 100644
index 0000000..927d500
--- /dev/null
+++ b/NOVALINCS/01-Call-Underg_A.md
@@ -0,0 +1,17 @@
+# Concurso para "Bolsa de Iniciação à Investigação"
+
+- **Requisitos de admissão:**
+ - Estudante inscrito numa licenciatura, que não tenha já beneficiado de bolsa de investigação direta ou indiretamente financiadas pela FCT, atribuída nos termos do Estatuto do Bolseiro de Investigação.
+ - Aprovação a, pelo menos, uma unidade curricular de programação, preferencialmente em `Python`.
+- **Plano de trabalhos:** Implementação duma biblioteca `Python` para processar ficheiros de código _ASP_ anotados com probabilidades com as seguintes funcionalidades:
+ 1. Extração das anotações e associação aos factos relevantes.
+ 2. Comunicação com o sistema `Potassco` para obtenção dos resultados do programa _ASP_ subjacente.
+ 3. Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+- **Métodos de seleção:** A seleção do candidato resulta de ordenar a classificação obtida pelos seguintes critérios/pesos:
+ - Entrevista: 40%
+ - Avaliação Curricular: 30%
+ - Prova de Conhecimento: 30%
+- **As candidaturas devem ser formalizadas**, obrigatoriamente, através do envio de carta de candidatura acompanhada dos seguintes documentos
+ - Curriculum Vitæ.
+ - Certificado de Matrícula.
+ - Certificado de Disciplinas concluídas com as respetivas classificações.
\ No newline at end of file
diff --git a/NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.docx b/NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.docx
new file mode 100644
index 0000000..aa6532a
Binary files /dev/null and b/NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.docx differ
diff --git a/NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.gddoc b/NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.gddoc
new file mode 100644
index 0000000..4d842a7
--- /dev/null
+++ b/NOVALINCS/NOVA LINCS.UE TRA Application Form | Zugzwang.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1QJoGGUPBseRCBnC_Y1QkZj62-J78XdwiVbW6ZN9MIsw/edit?usp=drivesdk", "file_id": "1QJoGGUPBseRCBnC_Y1QkZj62-J78XdwiVbW6ZN9MIsw", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/TdOS-JasonMAllen.jpg b/NOVALINCS/TdOS-JasonMAllen.jpg
new file mode 100644
index 0000000..682415b
Binary files /dev/null and b/NOVALINCS/TdOS-JasonMAllen.jpg differ
diff --git a/NOVALINCS/bolsas/BI/2023-01-91 | Oficio Juri.gddoc b/NOVALINCS/bolsas/BI/2023-01-91 | Oficio Juri.gddoc
new file mode 100644
index 0000000..bbc81bd
--- /dev/null
+++ b/NOVALINCS/bolsas/BI/2023-01-91 | Oficio Juri.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1zewyZW4jOU5VbG4OKZ-N-6eevVgXWVRh78KDL498O4k/edit?usp=drivesdk", "file_id": "1zewyZW4jOU5VbG4OKZ-N-6eevVgXWVRh78KDL498O4k", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BI/2023-02-01 _ Ata1.pdf b/NOVALINCS/bolsas/BI/2023-02-01 _ Ata1.pdf
new file mode 100644
index 0000000..f09cb2e
Binary files /dev/null and b/NOVALINCS/bolsas/BI/2023-02-01 _ Ata1.pdf differ
diff --git a/NOVALINCS/bolsas/BI/2023-02-01 | Ata1.gddoc b/NOVALINCS/bolsas/BI/2023-02-01 | Ata1.gddoc
new file mode 100644
index 0000000..d653e7c
--- /dev/null
+++ b/NOVALINCS/bolsas/BI/2023-02-01 | Ata1.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1O6m829y9Lb2tfJwdxzNNbU7cjkmeu2B0j1D8kaKYEq4/edit?usp=drivesdk", "file_id": "1O6m829y9Lb2tfJwdxzNNbU7cjkmeu2B0j1D8kaKYEq4", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BI/2023-02-03 | Edital | EN.pdf b/NOVALINCS/bolsas/BI/2023-02-03 | Edital | EN.pdf
new file mode 100644
index 0000000..19ca9ac
Binary files /dev/null and b/NOVALINCS/bolsas/BI/2023-02-03 | Edital | EN.pdf differ
diff --git a/NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.gddoc b/NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.gddoc
new file mode 100644
index 0000000..2fd171e
--- /dev/null
+++ b/NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1RxEd05B3bfVkyogNLUjL5jE5uH84t0b9de1RvbSnWgE/edit?usp=drivesdk", "file_id": "1RxEd05B3bfVkyogNLUjL5jE5uH84t0b9de1RvbSnWgE", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.pdf b/NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.pdf
new file mode 100644
index 0000000..fdc9391
Binary files /dev/null and b/NOVALINCS/bolsas/BI/2023-02-03 | Edital | PT.pdf differ
diff --git a/NOVALINCS/bolsas/BI/2023-03-01 _ Ata 2.pdf b/NOVALINCS/bolsas/BI/2023-03-01 _ Ata 2.pdf
new file mode 100644
index 0000000..2a3aa7e
Binary files /dev/null and b/NOVALINCS/bolsas/BI/2023-03-01 _ Ata 2.pdf differ
diff --git a/NOVALINCS/bolsas/BI/2023-03-01 | Ata 2.gddoc b/NOVALINCS/bolsas/BI/2023-03-01 | Ata 2.gddoc
new file mode 100644
index 0000000..da25876
--- /dev/null
+++ b/NOVALINCS/bolsas/BI/2023-03-01 | Ata 2.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1tQCVyhvLHJz7xnrCmHhtw0PeRxchWTodGXhHECD3LRE/edit?usp=drivesdk", "file_id": "1tQCVyhvLHJz7xnrCmHhtw0PeRxchWTodGXhHECD3LRE", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BI/signed/2023-01-19 | BI | Oficio Juri.pdf b/NOVALINCS/bolsas/BI/signed/2023-01-19 | BI | Oficio Juri.pdf
new file mode 100644
index 0000000..f6f8361
Binary files /dev/null and b/NOVALINCS/bolsas/BI/signed/2023-01-19 | BI | Oficio Juri.pdf differ
diff --git a/NOVALINCS/bolsas/BI/signed/2023-02-01 | BI | Ata 01.pdf b/NOVALINCS/bolsas/BI/signed/2023-02-01 | BI | Ata 01.pdf
new file mode 100644
index 0000000..c2274d2
Binary files /dev/null and b/NOVALINCS/bolsas/BI/signed/2023-02-01 | BI | Ata 01.pdf differ
diff --git a/NOVALINCS/bolsas/BI/signed/2023-03-01 | BI | Ata 02.pdf b/NOVALINCS/bolsas/BI/signed/2023-03-01 | BI | Ata 02.pdf
new file mode 100644
index 0000000..83d503f
Binary files /dev/null and b/NOVALINCS/bolsas/BI/signed/2023-03-01 | BI | Ata 02.pdf differ
diff --git a/NOVALINCS/bolsas/BI/zz_old/Edital BolsaInv.MSc | Zugzwang | EN.gddoc b/NOVALINCS/bolsas/BI/zz_old/Edital BolsaInv.MSc | Zugzwang | EN.gddoc
new file mode 100644
index 0000000..c1ee22d
--- /dev/null
+++ b/NOVALINCS/bolsas/BI/zz_old/Edital BolsaInv.MSc | Zugzwang | EN.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1yWggKwa9e-B_4qoUUsvC5VF2krmT7zUsJxECwDtS0vU/edit?usp=drivesdk", "file_id": "1yWggKwa9e-B_4qoUUsvC5VF2krmT7zUsJxECwDtS0vU", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-01-19 | Oficio Homologação Júri.gddoc b/NOVALINCS/bolsas/BII/2023-01-19 | Oficio Homologação Júri.gddoc
new file mode 100644
index 0000000..6c719b4
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-01-19 | Oficio Homologação Júri.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1yC43JtmZ6uji1tMDW6sUcrLGRICNK5OBdq-53kOqpv0/edit?usp=drivesdk", "file_id": "1yC43JtmZ6uji1tMDW6sUcrLGRICNK5OBdq-53kOqpv0", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-01-19 | Oficio Juri BolsaII.Lic Zugzwang.pdf b/NOVALINCS/bolsas/BII/2023-01-19 | Oficio Juri BolsaII.Lic Zugzwang.pdf
new file mode 100644
index 0000000..2b85a53
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-01-19 | Oficio Juri BolsaII.Lic Zugzwang.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-02-01 _ Ata1.pdf b/NOVALINCS/bolsas/BII/2023-02-01 _ Ata1.pdf
new file mode 100644
index 0000000..ff699d8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-02-01 _ Ata1.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-02-01 | Ata1.gddoc b/NOVALINCS/bolsas/BII/2023-02-01 | Ata1.gddoc
new file mode 100644
index 0000000..6b7392f
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-02-01 | Ata1.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1bywLHput61PQF_QaiX2IYOgaY6eHSiyo1eoduxTlC6M/edit?usp=drivesdk", "file_id": "1bywLHput61PQF_QaiX2IYOgaY6eHSiyo1eoduxTlC6M", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | EN.gddoc b/NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | EN.gddoc
new file mode 100644
index 0000000..f7d5dc7
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | EN.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1nCjnOt4Cj4EBQPtpu5x7As82z9UEU57mnX8Pd0ZMhDU/edit?usp=drivesdk", "file_id": "1nCjnOt4Cj4EBQPtpu5x7As82z9UEU57mnX8Pd0ZMhDU", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | PT.gddoc b/NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | PT.gddoc
new file mode 100644
index 0000000..90d6a69
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-02-02 | Edital BolsaII.Lic | Zugzwang | PT.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1QMSAgVgF3ct4NK_X4N7x3skYAuO8liu8QaCRpKCIi_Y/edit?usp=drivesdk", "file_id": "1QMSAgVgF3ct4NK_X4N7x3skYAuO8liu8QaCRpKCIi_Y", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-02-03 | Edital PT_bolsa_BII_novalincs.pdf b/NOVALINCS/bolsas/BII/2023-02-03 | Edital PT_bolsa_BII_novalincs.pdf
new file mode 100644
index 0000000..ca5b1fd
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-02-03 | Edital PT_bolsa_BII_novalincs.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-03-01 _ Ata 2.pdf b/NOVALINCS/bolsas/BII/2023-03-01 _ Ata 2.pdf
new file mode 100644
index 0000000..d36233e
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-03-01 _ Ata 2.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-03-01 | Ata 2.gddoc b/NOVALINCS/bolsas/BII/2023-03-01 | Ata 2.gddoc
new file mode 100644
index 0000000..f6a1b32
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-01 | Ata 2.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1ecoOox4N_HZG1o3u-BYKPRpu4wMSAX3KXvvX8PSMhTE/edit?usp=drivesdk", "file_id": "1ecoOox4N_HZG1o3u-BYKPRpu4wMSAX3KXvvX8PSMhTE", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-02 13:23 | Entrevista | Email Convocatória.gddoc b/NOVALINCS/bolsas/BII/2023-03-02 13:23 | Entrevista | Email Convocatória.gddoc
new file mode 100644
index 0000000..47e91a9
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-02 13:23 | Entrevista | Email Convocatória.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1csNIV1LHBfXxEpVAsn806ThyywrXALSV1KPXMrP_4Zc/edit?usp=drivesdk", "file_id": "1csNIV1LHBfXxEpVAsn806ThyywrXALSV1KPXMrP_4Zc", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista (Respostas).gdsheet b/NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista (Respostas).gdsheet
new file mode 100644
index 0000000..5ee6186
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista (Respostas).gdsheet
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/spreadsheets/d/1zL6SCQ0OTPsW4KWK6CbO93kjE8m8Z5kZgqOzDJpKREI/edit?usp=drivesdk", "file_id": "1zL6SCQ0OTPsW4KWK6CbO93kjE8m8Z5kZgqOzDJpKREI", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista.gdform b/NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista.gdform
new file mode 100644
index 0000000..eecbfe2
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-02 17:00 | Entrevista.gdform
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/forms/d/1IiL_cFAJTFaUSf8g7-LOepJS_xMDVvd83pJoTS2D32Q/edit?usp=drivesdk", "file_id": "1IiL_cFAJTFaUSf8g7-LOepJS_xMDVvd83pJoTS2D32Q", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-02 18:00 | Ata3.gddoc b/NOVALINCS/bolsas/BII/2023-03-02 18:00 | Ata3.gddoc
new file mode 100644
index 0000000..a896d96
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-02 18:00 | Ata3.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1O4A7nuqD5rK3xg2BEaWdzkP78-6aA-TUSnFIQKwxFgg/edit?usp=drivesdk", "file_id": "1O4A7nuqD5rK3xg2BEaWdzkP78-6aA-TUSnFIQKwxFgg", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-02 18_00 _ Ata3.pdf b/NOVALINCS/bolsas/BII/2023-03-02 18_00 _ Ata3.pdf
new file mode 100644
index 0000000..85ec51f
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-03-02 18_00 _ Ata3.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-03-03 | Notificação Candidatos.gddoc b/NOVALINCS/bolsas/BII/2023-03-03 | Notificação Candidatos.gddoc
new file mode 100644
index 0000000..e3eac2c
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-03 | Notificação Candidatos.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/19-Kqbj-OvRtQM2jkAdH4XVl0_LMU0JbkfZw87SfAW6U/edit?usp=drivesdk", "file_id": "19-Kqbj-OvRtQM2jkAdH4XVl0_LMU0JbkfZw87SfAW6U", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-07 | BII | Declaração Conflito de Interesses.gddoc b/NOVALINCS/bolsas/BII/2023-03-07 | BII | Declaração Conflito de Interesses.gddoc
new file mode 100644
index 0000000..a6561c0
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-07 | BII | Declaração Conflito de Interesses.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1t_sQhJ3UtoAeSAR2sYizjL4-euBxpJdDo16W82rJiZc/edit?usp=drivesdk", "file_id": "1t_sQhJ3UtoAeSAR2sYizjL4-euBxpJdDo16W82rJiZc", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-07 | BII | Plano de Trabalhos.gddoc b/NOVALINCS/bolsas/BII/2023-03-07 | BII | Plano de Trabalhos.gddoc
new file mode 100644
index 0000000..db54822
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-07 | BII | Plano de Trabalhos.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1nskb1s1EO-nhTMzS4aXZN7xjGUvk2H7dvILX5eb5PgY/edit?usp=drivesdk", "file_id": "1nskb1s1EO-nhTMzS4aXZN7xjGUvk2H7dvILX5eb5PgY", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-17 | Ata 4.gddoc b/NOVALINCS/bolsas/BII/2023-03-17 | Ata 4.gddoc
new file mode 100644
index 0000000..6f15bc3
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-17 | Ata 4.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/13AAkZDZH1brLz18e4QGfBjVjlKKyW0zM_yz86B46_4M/edit?usp=drivesdk", "file_id": "13AAkZDZH1brLz18e4QGfBjVjlKKyW0zM_yz86B46_4M", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-27 | Ofício Início Bolsa II.gddoc b/NOVALINCS/bolsas/BII/2023-03-27 | Ofício Início Bolsa II.gddoc
new file mode 100644
index 0000000..4f3b1c7
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-27 | Ofício Início Bolsa II.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1Oe_TfNecoJ376EYXZBT6WK6DmUc7hSNxk63bmyQfavQ/edit?usp=drivesdk", "file_id": "1Oe_TfNecoJ376EYXZBT6WK6DmUc7hSNxk63bmyQfavQ", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa.pdf b/NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa.pdf
new file mode 100644
index 0000000..5b510cf
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf b/NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf
new file mode 100644
index 0000000..945d56a
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-03-29 | BII | Inicio de Bolsa.gddoc b/NOVALINCS/bolsas/BII/2023-03-29 | BII | Inicio de Bolsa.gddoc
new file mode 100644
index 0000000..bca11c9
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-03-29 | BII | Inicio de Bolsa.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1cbW_SM5eXGWliN1FQ0cLdf11KgsUNFuAbgHsrpZ6wrA/edit?usp=drivesdk", "file_id": "1cbW_SM5eXGWliN1FQ0cLdf11KgsUNFuAbgHsrpZ6wrA", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-04-26 | Oficio Início de Bolsa.pdf b/NOVALINCS/bolsas/BII/2023-04-26 | Oficio Início de Bolsa.pdf
new file mode 100644
index 0000000..274d6a8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/2023-04-26 | Oficio Início de Bolsa.pdf differ
diff --git a/NOVALINCS/bolsas/BII/2023-09-01 | Inquérito Atividades Bolseiros.gddoc b/NOVALINCS/bolsas/BII/2023-09-01 | Inquérito Atividades Bolseiros.gddoc
new file mode 100644
index 0000000..e458239
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-09-01 | Inquérito Atividades Bolseiros.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1oXVe5x18ulKlnfa2LuzfNCkrsNuabG3H8uE4nbuJ_kk/edit?usp=drivesdk", "file_id": "1oXVe5x18ulKlnfa2LuzfNCkrsNuabG3H8uE4nbuJ_kk", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-09-01 | Oficio Renovação Bolsa.gddoc b/NOVALINCS/bolsas/BII/2023-09-01 | Oficio Renovação Bolsa.gddoc
new file mode 100644
index 0000000..8979e49
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-09-01 | Oficio Renovação Bolsa.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1xstDZUgp4Rrl8R26HP6XvCyZy2bQwQ9V4gGxawcUrbc/edit?usp=drivesdk", "file_id": "1xstDZUgp4Rrl8R26HP6XvCyZy2bQwQ9V4gGxawcUrbc", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-09-01 | Relatorio Atividades Bolseiros.gddoc b/NOVALINCS/bolsas/BII/2023-09-01 | Relatorio Atividades Bolseiros.gddoc
new file mode 100644
index 0000000..2888bb0
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-09-01 | Relatorio Atividades Bolseiros.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1vn-3iNbAYMheKxOTDRgL8io2HPENFlQvnWPI08bhK8Y/edit?usp=drivesdk", "file_id": "1vn-3iNbAYMheKxOTDRgL8io2HPENFlQvnWPI08bhK8Y", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/2023-99-03 | Minuta Contrato Bolsa.gddoc b/NOVALINCS/bolsas/BII/2023-99-03 | Minuta Contrato Bolsa.gddoc
new file mode 100644
index 0000000..024e6aa
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/2023-99-03 | Minuta Contrato Bolsa.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1WjjjgQoNzqNXZWqr5NHJwu1sUU7BPiJ5GDQ_BAa1gLk/edit?usp=drivesdk", "file_id": "1WjjjgQoNzqNXZWqr5NHJwu1sUU7BPiJ5GDQ_BAa1gLk", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf
new file mode 100644
index 0000000..945d56a
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-03-29 _ BII _ Inicio de Bolsa_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.pdf
new file mode 100644
index 0000000..b0e6080
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.png b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.png
new file mode 100644
index 0000000..fbd5d43
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 Inscrições.png differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 | Inscrições.png b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 | Inscrições.png
new file mode 100644
index 0000000..dee859d
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-05-03 | Inscrições.png differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..0221954
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/AlicE Martins.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/AlicE Martins.pdf
new file mode 100644
index 0000000..a23aaaa
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/AlicE Martins.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Candidatura à Bolsa de Iniciação à Investigação | Alice Martins.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Candidatura à Bolsa de Iniciação à Investigação | Alice Martins.pdf
new file mode 100644
index 0000000..7d170b9
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Candidatura à Bolsa de Iniciação à Investigação | Alice Martins.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Plano de Trabalhos.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Plano de Trabalhos.pdf
new file mode 100644
index 0000000..c49a4a5
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/BII | Plano de Trabalhos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Captura de ecrã de 2023-02-27 16-35-44.png b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Captura de ecrã de 2023-02-27 16-35-44.png
new file mode 100644
index 0000000..8d94b0b
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Captura de ecrã de 2023-02-27 16-35-44.png differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Consulta IBAN, BIC e SWIFT 22-05-2023 14 15.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Consulta IBAN, BIC e SWIFT 22-05-2023 14 15.pdf
new file mode 100644
index 0000000..bb2abea
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Consulta IBAN, BIC e SWIFT 22-05-2023 14 15.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova.pdf
new file mode 100644
index 0000000..1ad8091
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_preenchida.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_preenchida.pdf
new file mode 100644
index 0000000..9ae0f53
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_preenchida.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_prepreenchido.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_prepreenchido.pdf
new file mode 100644
index 0000000..7873c9d
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/Ficha_DRHSC_bolseiros_Nova_prepreenchido.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/bolsa.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/bolsa.pdf
new file mode 100644
index 0000000..9ae0f53
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/bolsa.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_aproveitamento_escolar.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_aproveitamento_escolar.pdf
new file mode 100644
index 0000000..d0b1656
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_aproveitamento_escolar.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao-2023.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao-2023.pdf
new file mode 100644
index 0000000..35cee79
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao-2023.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao.pdf
new file mode 100644
index 0000000..35cee79
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/comprovativo_matricula_inscricao.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/dados.md b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/dados.md
new file mode 100644
index 0000000..766c43f
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/01-candidatura/dados.md
@@ -0,0 +1,6 @@
+Número do Cartão de Cidadão: 14594754 8 ZX5
+Número de Contribuinte: 259379174
+Morada:
+ Rua Joaquim Marques Saias, Lote 19, Moradia D
+ 2130-299 Benavente
+Ciencia-ID: 861B-FBEF-B218
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..2fd9fd8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
new file mode 100644
index 0000000..d2f85e1
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1CMfE5UpqGZK0fl0CVbME83S_ey24jU78/view?usp=drivesdk", "file_id": "1CMfE5UpqGZK0fl0CVbME83S_ey24jU78", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Inquérito Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..fd8c1a9
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1MHGJ_MbMEDN7D6DZx8_IAk_tchGiA640/view?usp=drivesdk", "file_id": "1MHGJ_MbMEDN7D6DZx8_IAk_tchGiA640", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Oficio Renovação Bolsa.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Oficio Renovação Bolsa.gdlink
new file mode 100644
index 0000000..5424539
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/2023-09-01 | Oficio Renovação Bolsa.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1j2LPs2GGxj1JBZWQSIarRo8dK1bEJT6d/view?usp=drivesdk", "file_id": "1j2LPs2GGxj1JBZWQSIarRo8dK1bEJT6d", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/Declaração_Generali_ausência de acidentes (1).docx b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/Declaração_Generali_ausência de acidentes (1).docx
new file mode 100644
index 0000000..978d059
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/Declaração_Generali_ausência de acidentes (1).docx differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/12-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/12-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..2693937
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/12-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.pdf
new file mode 100644
index 0000000..8f35e37
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.tex
new file mode 100644
index 0000000..d56a29d
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/ofício/ofício_renovação.tex
@@ -0,0 +1,31 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+\usepackage{xcolor}
+
+
+\def\LOGO{\LOGOECT}
+\def\DESTINATARIO{\\
+Magnífica Reitora da\\
+Universidade de Évora\\
+Professora Doutora Hermínia Vilar
+}
+\def\EU{Salvador Pinto Abreu}
+\def\ASSINATURA{\vspace{5mm}}
+\def\QUALIDADE{Professor Catedrático}
+
+\begin{document}
+
+\unidade{\textsc{\textcolor{gray}{NOVA-LINCS (Pólo de Évora)}}}
+
+\documento
+ {12/DI.SPA/23}
+ {Renovação de Bolsa de Iniciação à Investigação}
+ {31 de julho de 2023}
+
+Na qualidade de Coordenador do pólo de Évora do NOVA-LINCS, solicito que, em acordo com o parecer do orientador, seja renovada a bolsa de iniciação à investigação (para licenciada) com a aluna Alice Fernandes Martins, para o perı́odo de 2 de agosto a 2 de novembro de 2023, no âmbito do Financiamento Plurianual da unidade de I\&D com a referência: \texttt{UIDP/04516/2020} (NOVA LINCS: Financiamento Programático 2020–2023), cofinanciado pela Fundação para Ciência e a Tecnologia.
+
+\CHAU{Évora, julho de 2023,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.pdf
new file mode 100644
index 0000000..3936907
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.tex
new file mode 100644
index 0000000..099894d
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/parecer/parecer_renovação.tex
@@ -0,0 +1,36 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+
+\def\ASSINATURA{\includegraphics{fcsig.pdf}}
+
+\begin{document}
+\unidade{\textsc{\DI}}
+\documento{%
+NL/ZZ/BII/1/AM/1
+}{%
+Renovação de BII --- Parecer}{%
+31 de julho de 2023}
+%\EU{}
+
+\qualidade{(Professor Auxiliar)}
+
+A aluna
+%
+Alice Fernandes Martins,
+%
+detentora de uma \emph{Bolsa de Iniciação à Investigação} no âmbito do Financiamento Plurianual da unidade I\&D Referência: UIDP/04516/2020 (NOVA LINCS: Financiamento Programático 2020-2023) cofinanciado pela Fundação para Ciência e a Tecnologia
+%
+\textbf{completou corretamente todas as tarefas propostas no âmbito desta bolsa}.
+%
+
+%
+Como orientador científico,
+%
+dado o excelente desempenho da bolseira e a necessidade, no projeto Zugzwang, de continuar o desenvolvimento destas tarefas, \textbf{recomendo a renovação da bolsa}.
+
+\CHAU{Com os melhores cumprimentos,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.md b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.md
new file mode 100644
index 0000000..333cb92
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.md
@@ -0,0 +1,20 @@
+# Plano de Trabalhos - Renovação de BII
+
+
+Évora, 4 de setembro de 2023
+
+
+
+Considerando que foi já implementada uma biblioteca Python que proporciona as seguintes funcionalidades:
+- Ler a descrição de uma rede Bayesiana num formato comum (BIF) para uma representação intermédia.
+- Escrever uma especificação ASP anotada com probabilidades a partir da representação intermédia indicada no ponto anterior.
+
+e que, com esta biblioteca é possível aplicar métodos e ferramentas desenvolvidos no âmbito do projeto “Zugzwang | Lógica e Inteligência Artificial” a um conjunto alargado de problemas, **pretende-se continuar,** com a implementação duma biblioteca Python para processar ficheiros de código ASP anotados com probabilidades incluindo as seguintes funcionalidades:
+
+- Extração das anotações e associação aos factos relevantes.
+- Comunicação com o sistema Potassco para obtenção dos resultados do programa ASP subjacente.
+- Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+
+
+(Francisco Coelho)
+
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.pdf
new file mode 100644
index 0000000..a3e00fa
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.tex
new file mode 100644
index 0000000..5ea5c5f
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/plano-trab/plano-trabalhos.tex
@@ -0,0 +1,38 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+
+\def\ASSINATURA{\includegraphics{fcsig.pdf}}
+
+\begin{document}
+\unidade{\textsc{\DI}}
+\documento{%
+NL/ZZ/BII/1/AM/2
+}{%
+Renovação de BII --- Plano de Trabalhos}{%
+31 de julho de}
+%\EU{}
+
+\qualidade{(Professor Auxiliar)}
+
+Considerando que foi já implementada uma biblioteca \texttt{Python} que proporciona as seguintes funcionalidades:
+%
+\begin{itemize}
+ \item Ler a descrição de uma rede Bayesiana num formato comum (\texttt{BIF}) para uma representação intermédia.
+ \item Escrever uma especificação \texttt{ASP} anotada com probabilidades a partir da representação intermédia indicada no ponto anterior.
+\end{itemize}
+%
+e que, com esta biblioteca é possível aplicar métodos e ferramentas desenvolvidos no âmbito do projeto ``\emph{Zugzwang | Lógica e Inteligência Artificial}'' a um conjunto alargado de problemas, \textbf{pretende-se continuar,} com a implementação duma biblioteca \texttt{Python} para processar ficheiros de código ASP anotados com probabilidades incluindo as seguintes funcionalidades:
+
+\begin{itemize}
+
+ \item Extração das anotações e associação aos factos relevantes.
+ \item Comunicação com o sistema Potassco para obtenção dos resultados do programa ASP subjacente.
+ \item Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+\end{itemize}
+
+\CHAU{Com os melhores cumprimentos,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..b6c4e5d
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp
new file mode 100644
index 0000000..1ec164a
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf
new file mode 100644
index 0000000..14cf9af
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..6f5eb5f
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1XsRrztaU7vHaCaCihabO1jaaIw_Owafu/view?usp=drivesdk", "file_id": "1XsRrztaU7vHaCaCihabO1jaaIw_Owafu", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/renovacao-amartins.zip b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/renovacao-amartins.zip
new file mode 100644
index 0000000..a22e786
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/renovacao-amartins.zip differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/comprovativo_matricula-inscricao-2023.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/comprovativo_matricula-inscricao-2023.pdf
new file mode 100644
index 0000000..35cee79
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/comprovativo_matricula-inscricao-2023.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/ofício_renovação-signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/ofício_renovação-signed.pdf
new file mode 100644
index 0000000..ca4a8b8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/ofício_renovação-signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/parecer_renovação-signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/parecer_renovação-signed.pdf
new file mode 100644
index 0000000..3936907
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/parecer_renovação-signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/plano_trabalhos-signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/plano_trabalhos-signed.pdf
new file mode 100644
index 0000000..e8475f7
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/plano_trabalhos-signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/relatorio_atividades-signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/relatorio_atividades-signed.pdf
new file mode 100644
index 0000000..66b9ad3
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/02-renovação/zz-send/relatorio_atividades-signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..2fd9fd8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
new file mode 100644
index 0000000..e8a4241
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1rOXG01KpycJggWJk9zFTkfcHue7SXRgy/view?usp=drivesdk", "file_id": "1rOXG01KpycJggWJk9zFTkfcHue7SXRgy", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..fd8c1a9
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1MHGJ_MbMEDN7D6DZx8_IAk_tchGiA640/view?usp=drivesdk", "file_id": "1MHGJ_MbMEDN7D6DZx8_IAk_tchGiA640", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Oficio Renovação Bolsa.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Oficio Renovação Bolsa.gdlink
new file mode 100644
index 0000000..5424539
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-09-01 | Oficio Renovação Bolsa.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1j2LPs2GGxj1JBZWQSIarRo8dK1bEJT6d/view?usp=drivesdk", "file_id": "1j2LPs2GGxj1JBZWQSIarRo8dK1bEJT6d", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..ef90555
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1I7sfMTiLxUeqjx4E5C-g1xxjxsSRtt5b/view?usp=drivesdk", "file_id": "1I7sfMTiLxUeqjx4E5C-g1xxjxsSRtt5b", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/Declaração_Generali_ausência de acidentes (1).docx b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/Declaração_Generali_ausência de acidentes (1).docx
new file mode 100644
index 0000000..978d059
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/Declaração_Generali_ausência de acidentes (1).docx differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/12-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/12-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..2693937
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/12-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/15-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/15-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..26e9781
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/15-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.pdf
new file mode 100644
index 0000000..2ff6822
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.tex
new file mode 100644
index 0000000..2c43559
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/ofício/ofício_renovação.tex
@@ -0,0 +1,31 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+\usepackage{xcolor}
+
+
+\def\LOGO{\LOGOECT}
+\def\DESTINATARIO{\\
+Magnífica Reitora da\\
+Universidade de Évora\\
+Professora Doutora Hermínia Vilar
+}
+\def\EU{Salvador Pinto Abreu}
+\def\ASSINATURA{\vspace{5mm}}
+\def\QUALIDADE{Professor Catedrático}
+
+\begin{document}
+
+\unidade{\textsc{\textcolor{gray}{NOVA-LINCS (Pólo de Évora)}}}
+
+\documento
+ {12/DI.SPA/23}
+ {Renovação de Bolsa de Iniciação à Investigação}
+ {31 de outubro de 2023}
+
+Na qualidade de Coordenador do pólo de Évora do NOVA-LINCS, solicito que, em acordo com o parecer do orientador, seja renovada a bolsa de iniciação à investigação (para licenciada) com a aluna Alice Fernandes Martins, para o perı́odo de 2 de novembro de 2023 a 2 de janeiro de 2024, no âmbito do Financiamento Plurianual da unidade de I\&D com a referência: \texttt{UIDP/04516/2020} (NOVA LINCS: Financiamento Programático 2020–2023), cofinanciado pela Fundação para Ciência e a Tecnologia.
+
+\CHAU{Évora, outubro de 2023,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.pdf
new file mode 100644
index 0000000..c53fa62
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.tex
new file mode 100644
index 0000000..0fa4e67
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/parecer/parecer_renovação.tex
@@ -0,0 +1,36 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+
+\def\ASSINATURA{\includegraphics{fcsig.pdf}}
+
+\begin{document}
+\unidade{\textsc{\DI}}
+\documento{%
+NL/ZZ/BII/1/AM/3
+}{%
+Renovação de BII --- Parecer}
+{31 de outubro de 2023}
+%\EU{}
+
+\qualidade{(Professor Auxiliar)}
+
+A aluna
+%
+Alice Fernandes Martins,
+%
+detentora de uma \emph{Bolsa de Iniciação à Investigação} no âmbito do Financiamento Plurianual da unidade I\&D Referência: UIDP/04516/2020 (NOVA LINCS: Financiamento Programático 2020-2023) cofinanciado pela Fundação para Ciência e a Tecnologia
+%
+\textbf{completou corretamente todas as tarefas propostas no âmbito desta bolsa}.
+%
+
+%
+Como orientador científico,
+%
+dado o excelente desempenho da bolseira e a necessidade, no projeto Zugzwang, de continuar o desenvolvimento destas tarefas, \textbf{recomendo a renovação da bolsa}.
+
+\CHAU{Com os melhores cumprimentos,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.md b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.md
new file mode 100644
index 0000000..333cb92
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.md
@@ -0,0 +1,20 @@
+# Plano de Trabalhos - Renovação de BII
+
+
+Évora, 4 de setembro de 2023
+
+
+
+Considerando que foi já implementada uma biblioteca Python que proporciona as seguintes funcionalidades:
+- Ler a descrição de uma rede Bayesiana num formato comum (BIF) para uma representação intermédia.
+- Escrever uma especificação ASP anotada com probabilidades a partir da representação intermédia indicada no ponto anterior.
+
+e que, com esta biblioteca é possível aplicar métodos e ferramentas desenvolvidos no âmbito do projeto “Zugzwang | Lógica e Inteligência Artificial” a um conjunto alargado de problemas, **pretende-se continuar,** com a implementação duma biblioteca Python para processar ficheiros de código ASP anotados com probabilidades incluindo as seguintes funcionalidades:
+
+- Extração das anotações e associação aos factos relevantes.
+- Comunicação com o sistema Potassco para obtenção dos resultados do programa ASP subjacente.
+- Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+
+
+(Francisco Coelho)
+
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.pdf
new file mode 100644
index 0000000..d5f9f31
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.tex
new file mode 100644
index 0000000..894fd92
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/plano-trab/plano-trabalhos.tex
@@ -0,0 +1,38 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+
+\def\ASSINATURA{\includegraphics{fcsig.pdf}}
+
+\begin{document}
+\unidade{\textsc{\DI}}
+\documento{%
+NL/ZZ/BII/1/AM/4
+}{%
+Renovação de BII --- Plano de Trabalhos}{%
+31 de outubro de 2023}
+%\EU{}
+
+\qualidade{(Professor Auxiliar)}
+
+Considerando que foram já implementadas biblioteca \texttt{Python} que proporcionam as seguintes funcionalidades:
+%
+\begin{itemize}
+ \item Ler a descrição de uma rede Bayesiana num formato comum (\texttt{BIF}) para uma representação intermédia.
+ \item Escrever uma especificação \texttt{ASP} anotada com probabilidades a partir da representação intermédia indicada no ponto anterior.
+\end{itemize}
+%
+e que, com esta biblioteca é possível aplicar métodos e ferramentas desenvolvidos no âmbito do projeto ``\emph{Zugzwang | Lógica e Inteligência Artificial}'' a um conjunto alargado de problemas, \textbf{pretende-se continuar,} com a implementação duma biblioteca \texttt{Python} para processar ficheiros de código ASP anotados com probabilidades, incluindo as seguintes funcionalidades:
+
+\begin{itemize}
+
+ \item Extração das anotações e associação aos factos relevantes.
+ \item Comunicação com o sistema \texttt{Potassco} para obtenção dos resultados do programa \texttt{ASP} subjacente.
+ \item Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+\end{itemize}
+
+\CHAU{Com os melhores cumprimentos,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..b6c4e5d
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp
new file mode 100644
index 0000000..1ec164a
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf
new file mode 100644
index 0000000..14cf9af
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..cc891d6
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1WphuifxTG3e1NcMPfI4FiiDMRlLX9P8r/view?usp=drivesdk", "file_id": "1WphuifxTG3e1NcMPfI4FiiDMRlLX9P8r", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf
new file mode 100644
index 0000000..485503b
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc
new file mode 100644
index 0000000..1f77fe3
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1Ua0fco35d52jX0TpmPSzsuK_PetQUbqc00RWfLCPRaE/edit?usp=drivesdk", "file_id": "1Ua0fco35d52jX0TpmPSzsuK_PetQUbqc00RWfLCPRaE", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf
new file mode 100644
index 0000000..cd0e895
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/renovacao-amartins.zip b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/renovacao-amartins.zip
new file mode 100644
index 0000000..a22e786
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/renovacao-amartins.zip differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/15-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/15-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..26e9781
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/15-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/Declaração_Generali_ausência de acidentes.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/Declaração_Generali_ausência de acidentes.pdf
new file mode 100644
index 0000000..9507a12
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/Declaração_Generali_ausência de acidentes.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/comprovativo_matricula-inscricao-2023.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/comprovativo_matricula-inscricao-2023.pdf
new file mode 100644
index 0000000..35cee79
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/comprovativo_matricula-inscricao-2023.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/parecer_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/parecer_renovação.pdf
new file mode 100644
index 0000000..c53fa62
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/parecer_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/plano-trabalhos.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/plano-trabalhos.pdf
new file mode 100644
index 0000000..fafa033
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/plano-trabalhos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/relatorio_atividades-signed_am_fc.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/relatorio_atividades-signed_am_fc.pdf
new file mode 100644
index 0000000..485503b
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/relatorio_atividades-signed_am_fc.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/renovacao_BII_AliceMartins-documentos.zip b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/renovacao_BII_AliceMartins-documentos.zip
new file mode 100644
index 0000000..8fc8931
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/03-renovação (nov)/zz-send/renovacao_BII_AliceMartins-documentos.zip differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..2fd9fd8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
new file mode 100644
index 0000000..e8a4241
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 Relatorio Atividades Bolseiros.pdf.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1rOXG01KpycJggWJk9zFTkfcHue7SXRgy/view?usp=drivesdk", "file_id": "1rOXG01KpycJggWJk9zFTkfcHue7SXRgy", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..fd8c1a9
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Inquérito Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1MHGJ_MbMEDN7D6DZx8_IAk_tchGiA640/view?usp=drivesdk", "file_id": "1MHGJ_MbMEDN7D6DZx8_IAk_tchGiA640", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Oficio Renovação Bolsa.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Oficio Renovação Bolsa.gdlink
new file mode 100644
index 0000000..5424539
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-09-01 | Oficio Renovação Bolsa.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1j2LPs2GGxj1JBZWQSIarRo8dK1bEJT6d/view?usp=drivesdk", "file_id": "1j2LPs2GGxj1JBZWQSIarRo8dK1bEJT6d", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..ef90555
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/2023-10-31 | Inquérito Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1I7sfMTiLxUeqjx4E5C-g1xxjxsSRtt5b/view?usp=drivesdk", "file_id": "1I7sfMTiLxUeqjx4E5C-g1xxjxsSRtt5b", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/Declaração_Generali_ausência de acidentes (1).docx b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/Declaração_Generali_ausência de acidentes (1).docx
new file mode 100644
index 0000000..978d059
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/Declaração_Generali_ausência de acidentes (1).docx differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/12-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/12-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..2693937
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/12-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/15-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/15-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..26e9781
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/15-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.pdf
new file mode 100644
index 0000000..2ff6822
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.tex
new file mode 100644
index 0000000..2c43559
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/ofício/ofício_renovação.tex
@@ -0,0 +1,31 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+\usepackage{xcolor}
+
+
+\def\LOGO{\LOGOECT}
+\def\DESTINATARIO{\\
+Magnífica Reitora da\\
+Universidade de Évora\\
+Professora Doutora Hermínia Vilar
+}
+\def\EU{Salvador Pinto Abreu}
+\def\ASSINATURA{\vspace{5mm}}
+\def\QUALIDADE{Professor Catedrático}
+
+\begin{document}
+
+\unidade{\textsc{\textcolor{gray}{NOVA-LINCS (Pólo de Évora)}}}
+
+\documento
+ {12/DI.SPA/23}
+ {Renovação de Bolsa de Iniciação à Investigação}
+ {31 de outubro de 2023}
+
+Na qualidade de Coordenador do pólo de Évora do NOVA-LINCS, solicito que, em acordo com o parecer do orientador, seja renovada a bolsa de iniciação à investigação (para licenciada) com a aluna Alice Fernandes Martins, para o perı́odo de 2 de novembro de 2023 a 2 de janeiro de 2024, no âmbito do Financiamento Plurianual da unidade de I\&D com a referência: \texttt{UIDP/04516/2020} (NOVA LINCS: Financiamento Programático 2020–2023), cofinanciado pela Fundação para Ciência e a Tecnologia.
+
+\CHAU{Évora, outubro de 2023,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.pdf
new file mode 100644
index 0000000..c53fa62
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.tex
new file mode 100644
index 0000000..0fa4e67
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/parecer/parecer_renovação.tex
@@ -0,0 +1,36 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+
+\def\ASSINATURA{\includegraphics{fcsig.pdf}}
+
+\begin{document}
+\unidade{\textsc{\DI}}
+\documento{%
+NL/ZZ/BII/1/AM/3
+}{%
+Renovação de BII --- Parecer}
+{31 de outubro de 2023}
+%\EU{}
+
+\qualidade{(Professor Auxiliar)}
+
+A aluna
+%
+Alice Fernandes Martins,
+%
+detentora de uma \emph{Bolsa de Iniciação à Investigação} no âmbito do Financiamento Plurianual da unidade I\&D Referência: UIDP/04516/2020 (NOVA LINCS: Financiamento Programático 2020-2023) cofinanciado pela Fundação para Ciência e a Tecnologia
+%
+\textbf{completou corretamente todas as tarefas propostas no âmbito desta bolsa}.
+%
+
+%
+Como orientador científico,
+%
+dado o excelente desempenho da bolseira e a necessidade, no projeto Zugzwang, de continuar o desenvolvimento destas tarefas, \textbf{recomendo a renovação da bolsa}.
+
+\CHAU{Com os melhores cumprimentos,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.md b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.md
new file mode 100644
index 0000000..333cb92
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.md
@@ -0,0 +1,20 @@
+# Plano de Trabalhos - Renovação de BII
+
+
+Évora, 4 de setembro de 2023
+
+
+
+Considerando que foi já implementada uma biblioteca Python que proporciona as seguintes funcionalidades:
+- Ler a descrição de uma rede Bayesiana num formato comum (BIF) para uma representação intermédia.
+- Escrever uma especificação ASP anotada com probabilidades a partir da representação intermédia indicada no ponto anterior.
+
+e que, com esta biblioteca é possível aplicar métodos e ferramentas desenvolvidos no âmbito do projeto “Zugzwang | Lógica e Inteligência Artificial” a um conjunto alargado de problemas, **pretende-se continuar,** com a implementação duma biblioteca Python para processar ficheiros de código ASP anotados com probabilidades incluindo as seguintes funcionalidades:
+
+- Extração das anotações e associação aos factos relevantes.
+- Comunicação com o sistema Potassco para obtenção dos resultados do programa ASP subjacente.
+- Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+
+
+(Francisco Coelho)
+
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.pdf
new file mode 100644
index 0000000..d5f9f31
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.tex b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.tex
new file mode 100644
index 0000000..894fd92
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/plano-trab/plano-trabalhos.tex
@@ -0,0 +1,38 @@
+% !TeX program = xelatex
+\documentclass{oficio}
+
+\usepackage{polyglossia}
+\setmainlanguage{portuges}
+
+\def\ASSINATURA{\includegraphics{fcsig.pdf}}
+
+\begin{document}
+\unidade{\textsc{\DI}}
+\documento{%
+NL/ZZ/BII/1/AM/4
+}{%
+Renovação de BII --- Plano de Trabalhos}{%
+31 de outubro de 2023}
+%\EU{}
+
+\qualidade{(Professor Auxiliar)}
+
+Considerando que foram já implementadas biblioteca \texttt{Python} que proporcionam as seguintes funcionalidades:
+%
+\begin{itemize}
+ \item Ler a descrição de uma rede Bayesiana num formato comum (\texttt{BIF}) para uma representação intermédia.
+ \item Escrever uma especificação \texttt{ASP} anotada com probabilidades a partir da representação intermédia indicada no ponto anterior.
+\end{itemize}
+%
+e que, com esta biblioteca é possível aplicar métodos e ferramentas desenvolvidos no âmbito do projeto ``\emph{Zugzwang | Lógica e Inteligência Artificial}'' a um conjunto alargado de problemas, \textbf{pretende-se continuar,} com a implementação duma biblioteca \texttt{Python} para processar ficheiros de código ASP anotados com probabilidades, incluindo as seguintes funcionalidades:
+
+\begin{itemize}
+
+ \item Extração das anotações e associação aos factos relevantes.
+ \item Comunicação com o sistema \texttt{Potassco} para obtenção dos resultados do programa \texttt{ASP} subjacente.
+ \item Cálculos de probabilidades com base nos modelos estáveis obtidos no passo anterior, nas anotações extraídas no passo 1, e nos resultados teóricos deste projeto.
+\end{itemize}
+
+\CHAU{Com os melhores cumprimentos,}
+
+\end{document}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf
new file mode 100644
index 0000000..b6c4e5d
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp
new file mode 100644
index 0000000..1ec164a
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros.xopp differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf
new file mode 100644
index 0000000..14cf9af
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 Relatorio Atividades Bolseiros_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
new file mode 100644
index 0000000..3b073e2
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-09-01 | Relatorio Atividades Bolseiros.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/1XGRVkcw8nfIOdzlbOFHKXwB987NZ4aOv/view?usp=drivesdk", "file_id": "1XGRVkcw8nfIOdzlbOFHKXwB987NZ4aOv", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf
new file mode 100644
index 0000000..485503b
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros - signed_am_fc.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc
new file mode 100644
index 0000000..ba6dccb
--- /dev/null
+++ b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1kHLIawg9_qcolQxqCuYepsvFTS1crej8g-DD8B0cYdQ/edit?usp=drivesdk", "file_id": "1kHLIawg9_qcolQxqCuYepsvFTS1crej8g-DD8B0cYdQ", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf
new file mode 100644
index 0000000..cd0e895
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/relatório/2023-10-31 - Relatorio Atividades Bolseiros_231120_170319.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/renovacao-amartins.zip b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/renovacao-amartins.zip
new file mode 100644
index 0000000..a22e786
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/renovacao-amartins.zip differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/15-renovacao-bolsa-alice_signed.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/15-renovacao-bolsa-alice_signed.pdf
new file mode 100644
index 0000000..26e9781
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/15-renovacao-bolsa-alice_signed.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/Declaração_Generali_ausência de acidentes.docx b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/Declaração_Generali_ausência de acidentes.docx
new file mode 100644
index 0000000..fe52c04
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/Declaração_Generali_ausência de acidentes.docx differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/comprovativo_matricula-inscricao-2023.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/comprovativo_matricula-inscricao-2023.pdf
new file mode 100644
index 0000000..35cee79
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/comprovativo_matricula-inscricao-2023.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/parecer_renovação.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/parecer_renovação.pdf
new file mode 100644
index 0000000..c53fa62
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/parecer_renovação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/plano-trabalhos.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/plano-trabalhos.pdf
new file mode 100644
index 0000000..fafa033
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/plano-trabalhos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/relatorio_atividades-signed_am_fc.pdf b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/relatorio_atividades-signed_am_fc.pdf
new file mode 100644
index 0000000..485503b
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/relatorio_atividades-signed_am_fc.pdf differ
diff --git a/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/renovacao_BII_Alice_Martins-documentos.zip b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/renovacao_BII_Alice_Martins-documentos.zip
new file mode 100644
index 0000000..ae6b6a8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/AliceMartins-l52768/04-renovação (jan)/zz-send/renovacao_BII_Alice_Martins-documentos.zip differ
diff --git a/NOVALINCS/bolsas/BII/Ata 02.pdf b/NOVALINCS/bolsas/BII/Ata 02.pdf
new file mode 100644
index 0000000..d36233e
Binary files /dev/null and b/NOVALINCS/bolsas/BII/Ata 02.pdf differ
diff --git a/NOVALINCS/bolsas/BII/Ata 04.pdf b/NOVALINCS/bolsas/BII/Ata 04.pdf
new file mode 100644
index 0000000..2e2fef1
Binary files /dev/null and b/NOVALINCS/bolsas/BII/Ata 04.pdf differ
diff --git a/NOVALINCS/bolsas/BII/Ata 04.pdf.jpg b/NOVALINCS/bolsas/BII/Ata 04.pdf.jpg
new file mode 100644
index 0000000..9ca5541
Binary files /dev/null and b/NOVALINCS/bolsas/BII/Ata 04.pdf.jpg differ
diff --git a/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/BII | Candidatura para Projeto | João Branquinho.pdf b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/BII | Candidatura para Projeto | João Branquinho.pdf
new file mode 100644
index 0000000..6bc4a9f
Binary files /dev/null and b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/BII | Candidatura para Projeto | João Branquinho.pdf differ
diff --git a/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/Joao Branquinho.pdf b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/Joao Branquinho.pdf
new file mode 100644
index 0000000..106413d
Binary files /dev/null and b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/Joao Branquinho.pdf differ
diff --git a/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/comprovativo_matricula_inscricao-1.pdf b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/comprovativo_matricula_inscricao-1.pdf
new file mode 100644
index 0000000..a59ba15
Binary files /dev/null and b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/comprovativo_matricula_inscricao-1.pdf differ
diff --git a/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/disc + notas.jpg b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/disc + notas.jpg
new file mode 100644
index 0000000..0d0198b
Binary files /dev/null and b/NOVALINCS/bolsas/BII/JoãoBranquinho-l42713/disc + notas.jpg differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-01-19 | BII | Oficio Homologação Juri.pdf b/NOVALINCS/bolsas/BII/remeter/2023-01-19 | BII | Oficio Homologação Juri.pdf
new file mode 100644
index 0000000..2b85a53
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-01-19 | BII | Oficio Homologação Juri.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-02-01 | BII | Ata 01.pdf b/NOVALINCS/bolsas/BII/remeter/2023-02-01 | BII | Ata 01.pdf
new file mode 100644
index 0000000..a6cd054
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-02-01 | BII | Ata 01.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-02-15 | BII | JBranquinho | Comprovativo Matricula Inscrição.pdf b/NOVALINCS/bolsas/BII/remeter/2023-02-15 | BII | JBranquinho | Comprovativo Matricula Inscrição.pdf
new file mode 100644
index 0000000..a59ba15
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-02-15 | BII | JBranquinho | Comprovativo Matricula Inscrição.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Aproveitamento Escolar.pdf b/NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Aproveitamento Escolar.pdf
new file mode 100644
index 0000000..d0b1656
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Aproveitamento Escolar.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Matricula Inscricao.pdf b/NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Matricula Inscricao.pdf
new file mode 100644
index 0000000..35cee79
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-02-27 | BII | AMartins | Comprovativo Matricula Inscricao.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-01 | BII | Ata 02.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-01 | BII | Ata 02.pdf
new file mode 100644
index 0000000..35c7b43
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-01 | BII | Ata 02.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Ata 03.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Ata 03.pdf
new file mode 100644
index 0000000..c7db74f
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Ata 03.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória | src.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória | src.pdf
new file mode 100644
index 0000000..f13ddda
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória | src.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória.pdf
new file mode 100644
index 0000000..a94e0a7
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-02 | BII | Entrevista | Email Convocatória.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | AMartins | Email Aceitação.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | AMartins | Email Aceitação.pdf
new file mode 100644
index 0000000..ce3f17e
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | AMartins | Email Aceitação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | Notificação Candidatos.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | Notificação Candidatos.pdf
new file mode 100644
index 0000000..7a69937
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-03 | BII | Notificação Candidatos.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-06 | BII | JBranquinho | Email Aceitação.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-06 | BII | JBranquinho | Email Aceitação.pdf
new file mode 100644
index 0000000..0de2882
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-06 | BII | JBranquinho | Email Aceitação.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | Bruno.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | Bruno.pdf
new file mode 100644
index 0000000..755a6d8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | Bruno.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | fc.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | fc.pdf
new file mode 100644
index 0000000..b56a646
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Declaração Conflito de Interesses | fc.pdf differ
diff --git a/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Oficio Inicio de Bolsa.pdf b/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Oficio Inicio de Bolsa.pdf
new file mode 100644
index 0000000..3b1bfbc
Binary files /dev/null and b/NOVALINCS/bolsas/BII/remeter/2023-03-07 | BII | Oficio Inicio de Bolsa.pdf differ
diff --git a/NOVALINCS/bolsas/BII/zz-lostNfound/Edital EN.docx b/NOVALINCS/bolsas/BII/zz-lostNfound/Edital EN.docx
new file mode 100644
index 0000000..60e9539
Binary files /dev/null and b/NOVALINCS/bolsas/BII/zz-lostNfound/Edital EN.docx differ
diff --git a/NOVALINCS/bolsas/BII/zz-lostNfound/Edital PT.docx b/NOVALINCS/bolsas/BII/zz-lostNfound/Edital PT.docx
new file mode 100644
index 0000000..1661df8
Binary files /dev/null and b/NOVALINCS/bolsas/BII/zz-lostNfound/Edital PT.docx differ
diff --git a/NOVALINCS/bolsas/BII2/2023-03-03 Oficio Juri BII.pdf b/NOVALINCS/bolsas/BII2/2023-03-03 Oficio Juri BII.pdf
new file mode 100644
index 0000000..7230a74
Binary files /dev/null and b/NOVALINCS/bolsas/BII2/2023-03-03 Oficio Juri BII.pdf differ
diff --git a/NOVALINCS/bolsas/BII2/2023-03-07 | BII2 | Oficio Juri.gddoc b/NOVALINCS/bolsas/BII2/2023-03-07 | BII2 | Oficio Juri.gddoc
new file mode 100644
index 0000000..51743b1
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-03-07 | BII2 | Oficio Juri.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1fwocnP_NC71_69Z9SROegvKEjmubqdSxc_ixbxG0l04/edit?usp=drivesdk", "file_id": "1fwocnP_NC71_69Z9SROegvKEjmubqdSxc_ixbxG0l04", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-B | Ata 1.gddoc b/NOVALINCS/bolsas/BII2/2023-B | Ata 1.gddoc
new file mode 100644
index 0000000..61b66ad
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-B | Ata 1.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1OUZNpS5fXyxIh-TplozkhFliYJ-buVV3iojUjMJgrzI/edit?usp=drivesdk", "file_id": "1OUZNpS5fXyxIh-TplozkhFliYJ-buVV3iojUjMJgrzI", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-C | Edital | EN.gddoc b/NOVALINCS/bolsas/BII2/2023-C | Edital | EN.gddoc
new file mode 100644
index 0000000..40f8ed9
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-C | Edital | EN.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1ChH7dfzZzY7fomUjMrgcCScw5a_OGIgOTJYDjw1lLgU/edit?usp=drivesdk", "file_id": "1ChH7dfzZzY7fomUjMrgcCScw5a_OGIgOTJYDjw1lLgU", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-C | Edital | PT.gddoc b/NOVALINCS/bolsas/BII2/2023-C | Edital | PT.gddoc
new file mode 100644
index 0000000..896ec9c
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-C | Edital | PT.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1q04X9sIf7DJe1XxVC2cX7T50QkookZM1RcZT0eh3KMQ/edit?usp=drivesdk", "file_id": "1q04X9sIf7DJe1XxVC2cX7T50QkookZM1RcZT0eh3KMQ", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-C | Edital | PT.pdf b/NOVALINCS/bolsas/BII2/2023-C | Edital | PT.pdf
new file mode 100644
index 0000000..ca5b1fd
Binary files /dev/null and b/NOVALINCS/bolsas/BII2/2023-C | Edital | PT.pdf differ
diff --git a/NOVALINCS/bolsas/BII2/2023-D | Ata 2.gddoc b/NOVALINCS/bolsas/BII2/2023-D | Ata 2.gddoc
new file mode 100644
index 0000000..f565328
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-D | Ata 2.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/11zQzLN1tbx8Xu62YmbVsQU6Q-kCTG_N7xaT9wd7eez4/edit?usp=drivesdk", "file_id": "11zQzLN1tbx8Xu62YmbVsQU6Q-kCTG_N7xaT9wd7eez4", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-E | Notificação para Entrevista.gddoc b/NOVALINCS/bolsas/BII2/2023-E | Notificação para Entrevista.gddoc
new file mode 100644
index 0000000..d151b1a
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-E | Notificação para Entrevista.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1qvbTUCmdaHq4JsGHpgolmTVzRynxedy9YSq19GymJp8/edit?usp=drivesdk", "file_id": "1qvbTUCmdaHq4JsGHpgolmTVzRynxedy9YSq19GymJp8", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-F | Entrevista | Formulário.gdform b/NOVALINCS/bolsas/BII2/2023-F | Entrevista | Formulário.gdform
new file mode 100644
index 0000000..66de228
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-F | Entrevista | Formulário.gdform
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/forms/d/13V9H_revMLCmeM_IlhGkg0bOLUNZrP4PgMmeHYhgrAI/edit?usp=drivesdk", "file_id": "13V9H_revMLCmeM_IlhGkg0bOLUNZrP4PgMmeHYhgrAI", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-G | Ata 3.gddoc b/NOVALINCS/bolsas/BII2/2023-G | Ata 3.gddoc
new file mode 100644
index 0000000..81476e2
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-G | Ata 3.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1HQmwrMoSylbcI9dZmCwGaZSp3BogumGh6KCEu6L-vUE/edit?usp=drivesdk", "file_id": "1HQmwrMoSylbcI9dZmCwGaZSp3BogumGh6KCEu6L-vUE", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-H | Notificação Candidatos.gddoc b/NOVALINCS/bolsas/BII2/2023-H | Notificação Candidatos.gddoc
new file mode 100644
index 0000000..3e28b20
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-H | Notificação Candidatos.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1GLc9jY3tkgPYU9EAgKY-Y-EpSeq3i_p855tA3nLFVVc/edit?usp=drivesdk", "file_id": "1GLc9jY3tkgPYU9EAgKY-Y-EpSeq3i_p855tA3nLFVVc", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/BII2/2023-I | Ata 4.gddoc b/NOVALINCS/bolsas/BII2/2023-I | Ata 4.gddoc
new file mode 100644
index 0000000..7dce9fb
--- /dev/null
+++ b/NOVALINCS/bolsas/BII2/2023-I | Ata 4.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1pw5brFuL9MVSUEQ8cPEwyf4qq2luAvgzhDjJWqpB_Ko/edit?usp=drivesdk", "file_id": "1pw5brFuL9MVSUEQ8cPEwyf4qq2luAvgzhDjJWqpB_Ko", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/Estatuto Bolseiro de Investigação | Consolidação.pdf b/NOVALINCS/bolsas/Estatuto Bolseiro de Investigação | Consolidação.pdf
new file mode 100644
index 0000000..fec1e7b
Binary files /dev/null and b/NOVALINCS/bolsas/Estatuto Bolseiro de Investigação | Consolidação.pdf differ
diff --git a/NOVALINCS/bolsas/RegulamentoBolsasFCT2019.pdf b/NOVALINCS/bolsas/RegulamentoBolsasFCT2019.pdf
new file mode 100644
index 0000000..2ccde09
Binary files /dev/null and b/NOVALINCS/bolsas/RegulamentoBolsasFCT2019.pdf differ
diff --git a/NOVALINCS/bolsas/Tabela_de_Valores_SMM_2022.pdf b/NOVALINCS/bolsas/Tabela_de_Valores_SMM_2022.pdf
new file mode 100644
index 0000000..53936f5
Binary files /dev/null and b/NOVALINCS/bolsas/Tabela_de_Valores_SMM_2022.pdf differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/1_minuta de oficio juri bolsa_2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/1_minuta de oficio juri bolsa_2023.gddoc
new file mode 100644
index 0000000..85af252
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/1_minuta de oficio juri bolsa_2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1AF0m9JRcVEhnkB8nYLrhpQ8ARXtOCtSY31Bq8q1vQDU/edit?usp=drivesdk", "file_id": "1AF0m9JRcVEhnkB8nYLrhpQ8ARXtOCtSY31Bq8q1vQDU", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/2_minuta de Ata1_2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/2_minuta de Ata1_2023.gddoc
new file mode 100644
index 0000000..d0eb917
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/2_minuta de Ata1_2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1f7O-hvU6BCYvkKuX3D8x9bvoABZvlmQ39GXWw2Ex49I/edit?usp=drivesdk", "file_id": "1f7O-hvU6BCYvkKuX3D8x9bvoABZvlmQ39GXWw2Ex49I", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_EN.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_EN.gddoc
new file mode 100644
index 0000000..80e9e99
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_EN.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1rQahv7xXSZnI1KQu04zAXgTAeVLwg8QGzjeJt_9a6EY/edit?usp=drivesdk", "file_id": "1rQahv7xXSZnI1KQu04zAXgTAeVLwg8QGzjeJt_9a6EY", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_PT.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_PT.gddoc
new file mode 100644
index 0000000..ace13ec
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/3_minuta_edital_bolsa_2023_PT.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1aO0p81Ho1dfA3yYN1AFr3h3QRf9eEYgL9IApxPhvBKE/edit?usp=drivesdk", "file_id": "1aO0p81Ho1dfA3yYN1AFr3h3QRf9eEYgL9IApxPhvBKE", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/4_minuta de Ata2_2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/4_minuta de Ata2_2023.gddoc
new file mode 100644
index 0000000..fd9da37
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/4_minuta de Ata2_2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1M8Sp3j4masU-DghBDefDxK5cyIvP4driSyCLfmcjsXk/edit?usp=drivesdk", "file_id": "1M8Sp3j4masU-DghBDefDxK5cyIvP4driSyCLfmcjsXk", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/5_Notificaçõesparaentrevista.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/5_Notificaçõesparaentrevista.gddoc
new file mode 100644
index 0000000..adbd830
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/5_Notificaçõesparaentrevista.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1fZCpLL_9HKNurn2nZUwK7w-Zsaf5LREvPURIS-ROwvQ/edit?usp=drivesdk", "file_id": "1fZCpLL_9HKNurn2nZUwK7w-Zsaf5LREvPURIS-ROwvQ", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/6_minuta de Ata3_2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/6_minuta de Ata3_2023.gddoc
new file mode 100644
index 0000000..fcde673
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/6_minuta de Ata3_2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1wblMOejvScyDnOsibhdfuSMyPlosjKns7oVHMlPeNeI/edit?usp=drivesdk", "file_id": "1wblMOejvScyDnOsibhdfuSMyPlosjKns7oVHMlPeNeI", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/7_Notificacao_candidatos.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/7_Notificacao_candidatos.gddoc
new file mode 100644
index 0000000..23cfc9b
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/7_Notificacao_candidatos.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1qpxnG3LfekInEnGvKGrF9hUDVwSxIQyxeBQR2r_JgcU/edit?usp=drivesdk", "file_id": "1qpxnG3LfekInEnGvKGrF9hUDVwSxIQyxeBQR2r_JgcU", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/8_minuta de Ata4_2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/8_minuta de Ata4_2023.gddoc
new file mode 100644
index 0000000..60a623f
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/8_minuta de Ata4_2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1llF0b9W0SYnOrYZIUvy3hC1zYZr-YHBxushKQDFqnWs/edit?usp=drivesdk", "file_id": "1llF0b9W0SYnOrYZIUvy3hC1zYZr-YHBxushKQDFqnWs", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/9_Minuta oficio Inicio de Bolsa.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/9_Minuta oficio Inicio de Bolsa.gddoc
new file mode 100644
index 0000000..78c2b31
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/9_Minuta oficio Inicio de Bolsa.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1V-ArQu0G_cKT3HtmYa5rsq3ESzCl6jwCSVCjkkq0rGQ/edit?usp=drivesdk", "file_id": "1V-ArQu0G_cKT3HtmYa5rsq3ESzCl6jwCSVCjkkq0rGQ", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/A_Regulamentobolsas_FCT.pdf b/NOVALINCS/bolsas/kit bolsas_2023/A_Regulamentobolsas_FCT.pdf
new file mode 100644
index 0000000..e636281
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/A_Regulamentobolsas_FCT.pdf differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/B_Estatuto bolseiro_Consolidação.pdf b/NOVALINCS/bolsas/kit bolsas_2023/B_Estatuto bolseiro_Consolidação.pdf
new file mode 100644
index 0000000..477b65a
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/B_Estatuto bolseiro_Consolidação.pdf differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/C_Tabela_de_Valores_SMM_atualizadoJan2022.pdf b/NOVALINCS/bolsas/kit bolsas_2023/C_Tabela_de_Valores_SMM_atualizadoJan2022.pdf
new file mode 100644
index 0000000..53936f5
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/C_Tabela_de_Valores_SMM_atualizadoJan2022.pdf differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/Minuta_Contrato_Bolsa 2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/Minuta_Contrato_Bolsa 2023.gddoc
new file mode 100644
index 0000000..fe9519c
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/Minuta_Contrato_Bolsa 2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1H-WephUfnAzYRSz7Iy5MpGKq3DGJfJLh2NKuDjh7VjY/edit?usp=drivesdk", "file_id": "1H-WephUfnAzYRSz7Iy5MpGKq3DGJfJLh2NKuDjh7VjY", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/dec conflito de interesses 2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/dec conflito de interesses 2023.gddoc
new file mode 100644
index 0000000..cf2a520
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/dec conflito de interesses 2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1zuzCQybKxQfaEErf4xDKHeTALXV4rh841sJ94h9BfAI/edit?usp=drivesdk", "file_id": "1zuzCQybKxQfaEErf4xDKHeTALXV4rh841sJ94h9BfAI", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/1_minuta de oficio juri bolsa_2023.doc b/NOVALINCS/bolsas/kit bolsas_2023/docx/1_minuta de oficio juri bolsa_2023.doc
new file mode 100644
index 0000000..eaf7b03
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/1_minuta de oficio juri bolsa_2023.doc differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/2_minuta de Ata1_2023.doc b/NOVALINCS/bolsas/kit bolsas_2023/docx/2_minuta de Ata1_2023.doc
new file mode 100644
index 0000000..901445e
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/2_minuta de Ata1_2023.doc differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_EN.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_EN.docx
new file mode 100644
index 0000000..82ee427
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_EN.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_PT.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_PT.docx
new file mode 100644
index 0000000..768309b
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/3_minuta_edital_bolsa_2023_PT.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/4_minuta de Ata2_2023.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/4_minuta de Ata2_2023.docx
new file mode 100644
index 0000000..80a0434
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/4_minuta de Ata2_2023.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/5_Notificaçõesparaentrevista.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/5_Notificaçõesparaentrevista.docx
new file mode 100644
index 0000000..53a2cbe
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/5_Notificaçõesparaentrevista.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/6_minuta de Ata3_2023.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/6_minuta de Ata3_2023.docx
new file mode 100644
index 0000000..4d03bd8
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/6_minuta de Ata3_2023.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/7_Notificacao_candidatos.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/7_Notificacao_candidatos.docx
new file mode 100644
index 0000000..9c7454e
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/7_Notificacao_candidatos.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/8_minuta de Ata4_2023.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/8_minuta de Ata4_2023.docx
new file mode 100644
index 0000000..31f20f7
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/8_minuta de Ata4_2023.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/9_Minuta oficio Inicio de Bolsa.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/9_Minuta oficio Inicio de Bolsa.docx
new file mode 100644
index 0000000..86c3784
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/9_Minuta oficio Inicio de Bolsa.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/Minuta_Contrato_Bolsa 2023.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/Minuta_Contrato_Bolsa 2023.docx
new file mode 100644
index 0000000..43bdac4
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/Minuta_Contrato_Bolsa 2023.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/dec conflito de interesses 2023.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/dec conflito de interesses 2023.docx
new file mode 100644
index 0000000..a61d7d0
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/dec conflito de interesses 2023.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/docx/modelo_relatorio_atividades_bolseiros_2023.docx b/NOVALINCS/bolsas/kit bolsas_2023/docx/modelo_relatorio_atividades_bolseiros_2023.docx
new file mode 100644
index 0000000..eab67f6
Binary files /dev/null and b/NOVALINCS/bolsas/kit bolsas_2023/docx/modelo_relatorio_atividades_bolseiros_2023.docx differ
diff --git a/NOVALINCS/bolsas/kit bolsas_2023/modelo_relatorio_atividades_bolseiros_2023.gddoc b/NOVALINCS/bolsas/kit bolsas_2023/modelo_relatorio_atividades_bolseiros_2023.gddoc
new file mode 100644
index 0000000..e3d4118
--- /dev/null
+++ b/NOVALINCS/bolsas/kit bolsas_2023/modelo_relatorio_atividades_bolseiros_2023.gddoc
@@ -0,0 +1 @@
+{"url": "https://docs.google.com/document/d/1E9YwFN9lJy9zjFpyzguEuIGQfEPYYegbf1OI7jxUGKI/edit?usp=drivesdk", "file_id": "1E9YwFN9lJy9zjFpyzguEuIGQfEPYYegbf1OI7jxUGKI", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/NOVALINCS/demo-markdown.md b/NOVALINCS/demo-markdown.md
new file mode 100644
index 0000000..7f75c7d
--- /dev/null
+++ b/NOVALINCS/demo-markdown.md
@@ -0,0 +1,32 @@
+# Título
+
+> O `markdown` permite formatar um documento seguindo algumas convenções facilmente legíveis, ao contrário, por exemplo, do `LaTeX`.
+>
+> Este fragmento de texto é uma "citação" e pode ter vários parágrafos.
+> Como no `LaTeX`, é precisa uma linha de intervalo entre parágrafos.
+
+A formatação de `markdown` é muito simples: usam-se dois `**` para **negrito** e um `_` para _itálico_. Para `fonte fixa` usa-se o acento agudo, "\`".
+
+Não há muito mais formatação:
+- As listas consistem em linhas que começam por `-` e podem ter sub-listas:
+ - Como esta.
+- É possível, em certos casos, usar os comandos `LaTeX` para fórmulas, que podem ser _inline_ $e^{i\pi} = -1$ ou _display_:
+$$\alpha = \sum_{i=1}^{\infty} a_i.$$
+
+As listas _numeradas_ também são visualmente definidas:
+1. Mexer os ovos.
+2. Derreter a manteiga na frigideira.
+3. Quando a manteiga estiver a ferver, deitar os ovos na frigideira.
+ 1. Cuidado! Não deixe a manteiga queimar!
+4. Deixar cozinhar a gosto.
+
+## Organização de Documentos
+
+Usam-se os `#` no início das linhas para indicar o nível da divisão:
+- Um `#` é o _título_ do documento.
+- Dois `##` é um "_capítulo_", três uma "_secção_", _etc._
+
+---
+
+Ah! Podem-se incluir _links_ para a [_web_](https://en.wikipedia.org/wiki/Markdown) e também imagens: 
diff --git a/NOVALINCS/demo-markdown.pdf b/NOVALINCS/demo-markdown.pdf
new file mode 100644
index 0000000..3cc6250
Binary files /dev/null and b/NOVALINCS/demo-markdown.pdf differ
diff --git a/biblio.gdlink b/biblio.gdlink
new file mode 100644
index 0000000..8d01dea
--- /dev/null
+++ b/biblio.gdlink
@@ -0,0 +1 @@
+{"url": "https://drive.google.com/file/d/19ZBN9zT4YyLOEeMNvpA9Baqw9KKWd-dx/view?usp=drivesdk", "file_id": "19ZBN9zT4YyLOEeMNvpA9Baqw9KKWd-dx", "account_email": "mangon@gmail.com"}
\ No newline at end of file
diff --git a/biblio/2002 - Answer set programming and plan generation.pdf b/biblio/2002 - Answer set programming and plan generation.pdf
new file mode 100644
index 0000000..91a3f2b
Binary files /dev/null and b/biblio/2002 - Answer set programming and plan generation.pdf differ
diff --git a/biblio/2013 - Answer Set Solving in Practice - Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub.pdf b/biblio/2013 - Answer Set Solving in Practice - Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub.pdf
new file mode 100644
index 0000000..11d340f
Binary files /dev/null and b/biblio/2013 - Answer Set Solving in Practice - Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub.pdf differ
diff --git a/biblio/2014 - A new method of proving the existence of answer sets for disjunctive logic programs.pdf b/biblio/2014 - A new method of proving the existence of answer sets for disjunctive logic programs.pdf
new file mode 100644
index 0000000..6fe313d
Binary files /dev/null and b/biblio/2014 - A new method of proving the existence of answer sets for disjunctive logic programs.pdf differ
diff --git a/biblio/2018 - Deep Learning, A critical appraisal - Gary Marcus.pdf b/biblio/2018 - Deep Learning, A critical appraisal - Gary Marcus.pdf
new file mode 100644
index 0000000..f4cce60
Binary files /dev/null and b/biblio/2018 - Deep Learning, A critical appraisal - Gary Marcus.pdf differ
diff --git a/biblio/2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf b/biblio/2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf
new file mode 100644
index 0000000..7d52d6b
Binary files /dev/null and b/biblio/2018 - Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning - Fabrizio Riguzzi.pdf differ
diff --git a/biblio/2019 - A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms - Bengio et al.pdf b/biblio/2019 - A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms - Bengio et al.pdf
new file mode 100644
index 0000000..0d5fe02
Binary files /dev/null and b/biblio/2019 - A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms - Bengio et al.pdf differ
diff --git a/biblio/2019 - On the Measure of Intelligence - Francois Chollet.pdf b/biblio/2019 - On the Measure of Intelligence - Francois Chollet.pdf
new file mode 100644
index 0000000..3bd1857
Binary files /dev/null and b/biblio/2019 - On the Measure of Intelligence - Francois Chollet.pdf differ
diff --git a/biblio/2019 - Potassco User Guide.pdf b/biblio/2019 - Potassco User Guide.pdf
new file mode 100644
index 0000000..f3c3f95
Binary files /dev/null and b/biblio/2019 - Potassco User Guide.pdf differ
diff --git a/biblio/2020 - ASP-Core-2 Input Language Format - Calimeri et al..pdf b/biblio/2020 - ASP-Core-2 Input Language Format - Calimeri et al..pdf
new file mode 100644
index 0000000..84c91a3
Binary files /dev/null and b/biblio/2020 - ASP-Core-2 Input Language Format - Calimeri et al..pdf differ
diff --git a/biblio/2020 - Prolog and Answer Set Programming - Languages in Logic Programming.pdf b/biblio/2020 - Prolog and Answer Set Programming - Languages in Logic Programming.pdf
new file mode 100644
index 0000000..e99d73f
Binary files /dev/null and b/biblio/2020 - Prolog and Answer Set Programming - Languages in Logic Programming.pdf differ
diff --git a/biblio/2020 - The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference - Fabio Gagliardi Cozman, Denis Deratani Mauá.pdf b/biblio/2020 - The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference - Fabio Gagliardi Cozman, Denis Deratani Mauá.pdf
new file mode 100644
index 0000000..5fec7bc
Binary files /dev/null and b/biblio/2020 - The joy of Probabilistic Answer Set Programming: Semantics - complexity, expressivity, inference - Fabio Gagliardi Cozman, Denis Deratani Mauá.pdf differ
diff --git a/biblio/2021 - CASP and SCASP best practices.pdf b/biblio/2021 - CASP and SCASP best practices.pdf
new file mode 100644
index 0000000..ea0feef
Binary files /dev/null and b/biblio/2021 - CASP and SCASP best practices.pdf differ
diff --git a/biblio/ASP-DLV_tutorial.html b/biblio/ASP-DLV_tutorial.html
new file mode 100644
index 0000000..c3fbbcf
--- /dev/null
+++ b/biblio/ASP-DLV_tutorial.html
@@ -0,0 +1,1308 @@
+
+
+
+
+The DLV Tutorial
+
+
+
+
+
+
+The DLV
Tutorial
+
+
+In this tutorial, we give an introduction to Disjunctive Datalog
+(using some of the extensions of DLV
).
+The tutorial does not give a full description of the usage and capabilities of
+DLV
.
+For a more complete account of these, see the
+DLV
+homepage and the
+
+DLV
online user manual.
+
+The examples shown in this tutorial work with every recent
+DLV
release.
+Executables of the DLV
system for various platforms
+can be downloaded from the
+
+DLV
homepage.
+
+
+The tutorial consists of the following sections, each of them being built
+around a guiding example:
+
+
+- The First Example : Rules and Facts
+- The Second Example : Negation and the Complete World Assumption
+- The Family Tree Example : Predicates, Variables, and Recursion
+-
DLV
as a Deductive Database System; Comparison Operators
+-
+The Railway Crossing Example : True Negation and Negation as Finite Failure
+
+-
+The Broken Arm Example : Disjunctive Datalog and the Stable Model Semantics
+
+- Strong Constraints
+- Graph Coloring: Guess&Check Programming
+- The Fibonacci Example: Built-in Predicates and Integer Arithmetics
+- The 8-Queens Example: Guess&Check Programming with Integers
+- A simple Physics Diagnosis example
+- A different way to implement the Physics Diagnosis example
+- The Monkey&Banana Example: Planning
+
+
+This page is quite long. People who are in a hurry might appreciate the
+information that the tutorial is fully on this page, there will be no branches
+and no links to further pages.
+
+
+This tutorial is written for computer-literate people with a background
+different from computer science, or students new to this area.
+It was originally written for physicists at CERN, and some examples are
+tailored towards this community.
+
+
+
+
+
+Introduction
+
+
+
+Datalog is a declarative (programming) language.
+This means that the programmer does not write a program that solves some
+problem but instead specifies what the solution should look like, and a
+Datalog inference engine (or Deductive Database System) tries
+to find the the way to solve the problem and the solution itself.
+This is done with rules and facts.
+Facts are the input data, and rules can be used to derive more facts, and
+hopefully, the solution of the given problem.
+
+
+
+Disjunctive datalog is an extension of datalog in which the logical OR
+expression (the disjunction)
+is allowed to appear in the rules - this is not allowed in basic datalog.
+
+
+
+DLV
(= datalog with disjunction) is a powerful though
+freely available deductive database system.
+It is based on the declarative programming language datalog,
+which is known for being a convenient tool for knowledge representation.
+With its disjunctive extensions, it is well suited for all kinds of
+nonmonotonic reasoning, including diagnosis and planning.
+
+
+
+Finally, we have to mention to the more advanced reader that
+DLV
is relevant to two communities. Firstly, as mentioned,
+it is a deductive database engine and can therefore be seen as a way to query
+data from databases which is strictly more powerful than for example SQL
+(everything that can be done with the core SQL language can also be done with
+DLV
, and more), but it is also often described as a
+system for answer set programming (ASP). This is a powerful new paradigm
+from the area of "Nonmonotonic Reasoning" which allows to formulate even very
+complicated problems in a straightforward and highly declarative way.
+One may call this paradigm even more declarative than classical logic.
+Of course, every programming language to be processed by a computer has to
+have both fixed syntax (i.e. a grammar that specifies what programs of this
+language have to look like, and what combinations of symbols make a valid
+program) and semantics (which abstractly specifies what the computer has to
+do with the program by declaring how a program is to be translated into the/a
+correct result). There is wide agreement (and also some excitement) that
+both the syntax and semantics of the language of DLV
+are very simple and intuitive. In fact, we do not know of any way to make
+the language even simpler while preserving its characteristics.
+
+
+
+Both the syntax and semantics of DLV
will be described in
+this tutorial.
+
+
+
+
+
+The First Example : Rules and Facts
+
+
+
+Suppose we want to model that every time somebody tells us a joke, we laugh.
+Furthermore, somebody now tells us a joke.
+This could be done in the following way:
+
+
+joke.
+laugh :- joke.
+
+
+The first line is called a fact and expresses that joke
+is true (a simple word such as joke
appearing in a rule or fact
+which has a truth value is called a proposition. A more general
+name - which we will use in the following - for the constituents of rules
+and facts is atom.).
+The second line is called a rule.
+It is read as "if joke is true, laugh must also be true".
+(The sign ":-" is meant to be an arrow to the left, the logic programming
+version of the implication.)
+
+
+
+If the author of such a program decides it appropriate, one can also interpret
+some causality into a rule and read this one as "from joke follows laugh".
+This is pure matter of choice of the human, and DLV
+does not care about it.
+The left side of a rule is called its head, while the right side is
+called its body.
+
+
+
+A result of a Datalog computation is called a model.
+The meaning of this is clear: it is a consistent explanation (model)
+of the world, as far as the Datalog system can derive it.
+If a datalog program is inconsistent, i.e., it is contradictory, there is
+simply no model (we will see examples of this later).
+
+
+
+Of course, since in this example joke
is certainly true (this is
+given by the fact), laugh
is also true.
+DLV
now tries to find all those models of the world that correctly
+and consistently explain the observations made (= the program).
+
+A model assigns a truth value (either true or false) to
+each atom appearing in the program,
+and is written as the set of atoms that are true in a certain model.
+The model of the above program is {joke, laugh}
.
+When all atoms are false in a model, we talk about an empty model
+(written as {}
). Note that having an empty model is very different
+from finding no model. We will see examples for this later.
+
+
+
+Simple datalog programs like the one above always have exactly one model.
+In general, though, DLV
programs may have zero
+(as mentioned) or even many models. We will see examples of such programs later.
+
+
+
+
+
+
+The Second Example : Negation and the Complete World Assumption
+
+
+
+Next, suppose we are not aware of being told a joke. In this case, the
+correct datalog program looks like this:
+
+
+laugh :- joke.
+
+
+The program itself does not express that joke is false, but the so-called
+Complete World Assumption (CWA) does. It is one of the foundations
+DLV
bases its computations on and says that everything about which
+nothing is known is assumed to be false.
+Therefore, the model for this program is {}
. (This means that
+there is a model but it is empty. It is also possible that for a given
+program there is no model.)
+We will come back to the CWA in more detail later in the section that
+discusses DLV
as a deductive database system.
+
+
+
+Next, we elaborate a bit on this example.
+First, we want to express that to be able to understand a joke, one has to
+hear it and must not be stupid. To hear it, one must not be deaf and there
+must be a joke.
+Finally, to laugh about the joke, one must understand it.
+Alternatively, stupid people might laugh without being told a joke.
+
+
+joke.
+hear_joke :- joke, not deaf.
+understand_joke :- hear_joke, not stupid.
+laugh :- understand_joke.
+laugh :- stupid, not joke.
+
+
+In two of the rules, we encounter negated atoms. These are true if the
+atoms themselves are false.
+We also encounter rules that contain more than one atom in the
+body. In such a case, a body is true if each of the literals are true
+(a literal is a possibly negated atom).
+For example,
+
+
+hear_joke :- joke, not deaf.
+
+
+is read as
+"if joke
is true and deaf
is false then
+hear_joke
must be true".
+
+
+
+The model for this program is
+{joke, hear_joke, understand_joke, laugh}
.
+Again, by virtue of the CWA, deaf
and stupid
+are assumed to be false - there are no facts making these atoms
+true and no rules which can derive their truth.
+Now suppose we remove joke.
from the program and add
+stupid.
instead. Then, the resulting model would be
+{stupid, laugh}
.
+
+
+Please note the following things:
+(i) Those atoms that are not listed as elements of the models above are
+not automatically rendered false. Rather, they are unknown.
+(ii) Suppose the program would look like this:
+
+
+stupid.
+laugh :- stupid, not joke.
+
+
+The model of this program is {stupid, laugh}
. If we now add the
+fact joke.
we get the model {stupid, joke}
, from
+which the atom laugh
got lost. In other words, you may add
+more information and lose information that could be derived before because of
+that. Due to this property,
+the formalism of DLV
is called nonmonotonic, just
+as mathematical functions which are neither monotonically increasing nor
+decreasing are called nonmonotonic.
+
+At first sight, this may look like an ugly property of this formalism, but in
+fact, it allows to do many useful things.
+
+
+
+
+
+
+The Family Tree Example : Predicates, Variables, and Recursion
+
+
+So far we have studied simple atoms as the building blocks of our rules.
+In fact, atoms may be constructed to hold a number of arguments - they are
+then also called predicates.
+
+
+In the following program, we have two binary predicates, parent
+and grandparent
. (They are called binary because they both have
+two arguments.)
+
+
+We have to map some semantics to the two arguments of the predicates. Here,
+the first argument is assumed to be the older person
+(the parent or grandparent), while
+the second argument refers to the younger person (the child or grandchild).
+Certainly, we could do it the other way as well, but then we would have to
+adjust all the rules that will follow.
+
+
+parent(john, james).
+parent(james, bill).
+grandparent(john, bill) :- parent(john, james), parent(james, bill).
+
+
+Of course, the model of this program is
+{parent(john, james), parent(james, bill), grandparent(john,bill)}
.
+
+
+With predicates, it is allowed to use variables, which begin with an upper-case
+character, differently from the constants of the previous program that begin
+with a lower-case letter. The following program has the same model as the
+previous example:
+
+
+parent(john, james).
+parent(james, bill).
+grandparent(X, Y) :- parent(X, Z), parent(Z, Y).
+
+
+This new grandparent rule which uses variables simply models that every
+parent of a parent is a grandparent.
+
+
+
+Note that the facts of a program are often called the
+Extensional Database (EDB), while the remaining rules are called
+the Intensional Database (IDB).
+With DLV
, the EDB can be read either from a relational
+or object-oriented database, or just simply from files, where no separation
+of rules and facts is required.
+
+
+
+We can now extend this example a bit to show how DLV
+can be used to model knowledge as datalog rules and exploit it.
+
+First we add a few more facts to add more people and to express their gender:
+
+
+parent(william, john).
+parent(john, james).
+parent(james, bill).
+parent(sue, bill).
+parent(james, carol).
+parent(sue, carol).
+
+male(john).
+male(james).
+female(sue).
+male(bill).
+female(carol).
+
+
+Then we can add more rules that model family relationships.
+
+
+grandparent(X, Y) :- parent(X, Z), parent(Z, Y).
+father(X, Y) :- parent(X, Y), male(X).
+mother(X, Y) :- parent(X, Y), female(X).
+brother(X, Y) :- parent(P, X), parent(P, Y), male(X), X != Y.
+sister(X, Y) :- parent(P, X), parent(P, Y), female(X), X != Y.
+
+
+The rules for brother and sister use X != Y
to require that
+X and Y are different (one cannot be his own brother). This is called a
+built-in predicate, since it could be written as something like
+not_equal(X, Y)
. DLV
knows quite a few of
+these built-in predicates.
+For this program, DLV
finds the following model
+(to simplify readability, the facts already listed above were removed from the
+model below; of course, they still belong there):
+
+
+{grandparent(william,james), grandparent(john,bill), grandparent(john,carol),
+father(john,james), father(james,bill), father(james,carol),
+mother(sue,bill), mother(sue,carol),
+brother(bill,carol), sister(carol,bill)}
+
+
+Let us now exchange the IDB rules against the following (the EDB facts remain
+the same):
+
+
+ancestor(X, Y) :- parent(X, Y).
+ancestor(X, Y) :- parent(X, Z), ancestor(Z, Y).
+
+
+These rules are interesting, since they use recursion
+to implement transitivity.
+They express that, to start with, every parent is an ancestor, and, secondly,
+that every parent of an ancestor is an ancestor.
+Please note that the semantics used ensures that it is impossible that there
+be any problems with left-recursion as they occur in languages as Prolog.
+In DLV
, the programmer can safely ignore such
+considerations.
+
+
+
+The model of this program combined with the six-entries parent
+facts base above results in the following model (where the parent
+facts were again removed for readability):
+
+
+{ancestor(william,john), ancestor(william,james), ancestor(william,bill),
+ancestor(william,carol), ancestor(john,james), ancestor(john,bill),
+ancestor(john,carol), ancestor(james,bill), ancestor(james,carol),
+ancestor(sue,bill), ancestor(sue,carol)}
+
+
+
+
+Finally, some subtle detail has to be noted which is quite useful to improve
+the readability of the rules. In the case that a certain argument of a
+predicate is irrelevant for a certain rule, no dummy variable has to be
+inserted, but the _
can be used. For instance, suppose we want
+to derive the persons from the parent facts. For this, we can write the
+following rules:
+
+
+person(X) :- parent(X, _).
+person(X) :- parent(_, X).
+
+
+
+Finally, please avoid calling a predicate as shown in this section a
+proposition. (It is fine to call them atoms.)
+
+
+
+
+
+
+DLV
as a Deductive Database System; Comparison Operators
+
+
+
+When you use the CWA in one of your programs, you basically view the
+DLV
system as a deductive database system, since you
+do not ask for what is logically right, but what you can usefully derive
+from your facts base.
+Following this approach, you can perform queries on the existing data (the
+facts base), derive (and "store") new data using queries(=rules),
+which again can be used to deduce even more data, and, using the CWA, even
+ask queries as to what is not in (or derivable from) your database.
+
+
+Consider the following example in SQL in the well know business domain (which
+many relational database systems examples use). Emp is a relational table
+containing employee information, and dept contains data on departmens of a
+company in which the employees work.
+
+
+SELECT e.name, e.salary, d.location
+FROM emp e, dept d
+WHERE e.dept = d.dept_id
+AND e.salary > 31000;
+
+
+When the relational tables are encoded as a facts base, we can rewrite the
+above query into a datalog rule:
+
+
+emp("Jones", 30000, 35, "Accounting").
+emp("Miller", 38000, 29, "Marketing").
+emp("Koch", 2000000, 24, "IT").
+emp("Nguyen", 35000, 42, "Marketing").
+emp("Gruber", 32000, 39, "IT").
+
+dept("IT", "Atlanta").
+dept("Marketing", "New York").
+dept("Accounting", "Los Angeles").
+
+q1(Ename, Esalary, Dlocation) :- emp(Ename, Esalary, _, D), dept(D, Dlocation),
+ Esalary > 31000.
+
+
+
+As you can see, joins are achieved via variable binding (we use the same
+variable D both in emp and in dept), selections can for example be achieved
+by the comparison operators, and projections (i.e. where unwanted data columns
+are excluded from a query result) can be accomplished by using _ or an
+unbound variable.
+
+
+
+You can use DLV
to ask all the queries that are possible in the
+core SQL language. Furthermore, (as you will see when the full expressive power
+of DLV
is unveiled later in this tutorial) you can also encode
+many useful queries that cannot be expressed in SQL.
+
+
+
+This example used another feature of DLV
that has not been
+introduced yet: comparison operators. DLV
supports the operators
+<, >, >=, <=, and = for integers, floating point values, and strings.
+This is an extension that is not part of basic datalog, but it is convenient
+and also compatible with the philosophy of datalog, as you can think of an
+expression X > Y as a predicate
+greater_than(X,Y)
for which the facts base of all the greater-than
+relationships between constant symbols in your program are automatically
+generated.
+Therefore, we call these comparison operators built-in predicates.
+
+
+
+Note that you could also rewrite q1
to use the operator = for the
+join. The rule below obtains the same result as the one shown earlier:
+
+
+q1(Ename, Esalary, Dlocation) :- emp(Ename, Esalary, _, D1),
+ dept(D2, Dlocation), D1 = D2,
+ Esalary > 31000.
+
+
+
+Download example program.
+
+
+
+
+
+
+
+
+The Railway Crossing Example : True Negation and Negation as Finite Failure
+
+
+
+DLV
supports two kinds of negation.
+
+Here, we emphasize the difference between explicitly expressing the falseness
+of an atom and having it done by the Complete World Assumption.
+
+The following program uses the CWA. It has the model
+{cross}
because train_approaching is assumed to be false (as it
+being true is not stated anywhere).
+This kind of negation is called
+negation as (finite) failure or naf.
+
+cross :- not train_approaching.
+
+
+The next program uses so-called true or classical negation.
+Since -train_approaching
is not known to be true, the following
+program has only an empty model.
+
+
+cross :- -train_approaching.
+
+
+The difference between the two kinds of negation is quite important:
+In the first example, we cross the railroad track if we have no information
+on any trains approaching, which is quite dangerous,
+while in the second example, we only cross if we know for
+sure that no train comes.
+In particular, the left side of the previous rule will only be true if
+
+
+-train_approaching.
+
+
+is in the facts base of the program.
+
+
+
+True negation is stronger than negation as finite failure. If something is
+true via true negation, it is always also true if negated by negation as
+finite failure.
+For example, the program
+
+
+
+cross :- not train_approaching.
+-train_approaching.
+
+
+has the model {cross, -train_approaching}
.
+
+
+Using True Negation also allows to build programs that are contradictory and
+have no models. Consider the following example:
+
+
+cross.
+-cross.
+
+
+Certainly, this program cannot have a model.
+This is very different from a program that has an empty model, which would just
+mean that the program represents a possible situation but that all of its atoms
+are assumed to be false.
+
+
+
+
+
+
+The Broken Arm Example : Disjunctive Datalog and the Stable Model Semantics
+
+
+Suppose you have met a friend recently and you know that he
+had one of his arms broken, but you don't know which one.
+Now you didn't receive a greeting card for your birthday and
+wonder if you should be angry on him or if he just cannot
+write because of his broken arm.
+Finally, you know that he writes with his right hand.
+The following DLV program computes the two possible
+explanations for the observations you made.
+
+
+left_arm_broken v right_arm_broken.
+can_write :- left_arm_broken.
+be_angry :- can_write.
+
+
+The first rule is called a disjunctive rule; The v is read as "or"
+and the whole rule is read as
+"For sure, either the left or the right arm is broken."
+As we can see here, a disjunctive rule may (but does not have to) have an
+empty body (= lack a body).
+It is still called a rule, since it is certainly not a fact.
+(It is unknown if the left or the right arm is broken.)
+
+
+Being able to process incomplete information (i.e. being unsure if the
+left or the right arm is broken) is one of the great strengths of
+DLV
.
+
+The resulting models of this query are
+{left_arm_broken, can_write, be_angry}
and
+{right_arm_broken}
.
+
+
+In fact, the disjunction left_arm_broken v right_arm_broken.
+also allows both left_arm_broken
and right_arm_broken
+to be true at the same time. Still, DLV
does not output
+the model {left_arm_broken, right_arm_broken, can_write, be_angry}
+due to the computing paradigm that it uses to cope with uncertainty, and which
+is called the Stable Model Semantics.
+Under this semantics, a model is not stable if there is a smaller model which
+is a subset of it (which is the case for both stable models shown
+above with respect to the "big" model containing left_arm_broken
+and right_arm_broken
).
+While this might seem complicated, it is a very powerful feature of
+DLV
which is very useful for all kinds of reasoning.
+We will come back to this later in this tutorial.
+(For the moment, we want to emphasize that this one "big" model which
+is not stable would be obviously wrong in this application.)
+
+
+
+Note that the same uncertainty can also be expressed by the following program:
+
+
+left_arm_broken :- not right_arm_broken.
+right_arm_broken :- not left_arm_broken.
+can_write :- left_arm_broken.
+be_angry :- can_write.
+
+
+
+This program results in the same pair of models. The method used here is called
+Unstratified Negation and is considered less elegant than the first
+method. Also, there are certain interesting reasoning problems that
+DLV
can solve and which can only be expressed with true
+disjunction but not with unstratified negation.
+
+
+
+Finally, please note that rule bodies may either contain positive (nonnegated)
+atoms, atoms negated by true negation, and atoms negated by negation as
+failure, while rule heads may only contain positive atoms and true negation,
+but no negation as failure. In other words, a rule such as
+
+
+not a :- b. % INVALID !!!
+
+
+is not valid! (The % sign in a DLV
program
+starts a comment which goes to the right to the end of the line.)
+
+
+
+
+
+
+Strong Constraints
+
+
+
+DLV
also supports integrity constraints
+(strong constraints).
+A constraint is a rule with an empty head. If its body is true (which is of
+course the case exactly if all the literals in the body are true at the same
+time), a model is made inconsistent and is removed.
+
+For example, in the family tree example which was presented earlier, we
+can easily write an integrity constraint to assure that the facts base does not
+erroneously contain contradicting facts saying that a person is male and
+female at the same time.
+
+
+:- male(X), female(X).
+
+
+This kind of constraints is called strong constraints because there
+is also a different kind (weak constraints) supported by
+DLV
which is not addressed in this tutorial.
+This other kind of constraints is very useful to solve optimization problems.
+
+
+
+
+
+
+Graph Coloring: Guess&Check Programming
+
+
+
+Graph 3-colorability is a hard (NP-complete) problem.
+It is the problem of deciding if there exists a coloring of a map of
+countries corresponding to the given graph using no more than three colors in
+which no two neighbour countries (nodes connected by an arc) have the same
+color.
+It is known that every map can be colored given these constraints if four
+colors are available.
+
+
+
+
+ |
+
+node(minnesota).
+node(wisconsin).
+node(illinois).
+node(iowa).
+node(indiana).
+node(michigan).
+node(ohio).
+
+arc(minnesota, wisconsin).
+arc(illinois, iowa).
+arc(illinois, michigan).
+arc(illinois, wisconsin).
+arc(illinois, indiana).
+arc(indiana, ohio).
+arc(michigan, indiana).
+arc(michigan, ohio).
+arc(michigan, wisconsin).
+arc(minnesota, iowa).
+arc(wisconsin, iowa).
+arc(minnesota, michigan).
+
+ |
+
+This problem can now be solved with a very simple datalog program, in which
+we first guess a coloring by using a disjunctive rule and then check it by
+adding a (strong) constraint which deletes all those colorings that do not
+satisfy our requirements (that there may be no arc between two nodes of
+equal color):
+
+
+% guess coloring
+col(Country, red) v col(Country, green) v col(Country, blue) :- node(Country).
+
+% check coloring
+:- arc(Country1, Country2), col(Country1, CommonColor), col(Country2, CommonColor).
+
+
+This problem instance has 6 solutions (stable models), therefore, it is
+3-colorable. Below, one solution is shown, in which the facts base has again
+be removed for better readability:
+
+
+{col(minnesota,green), col(wisconsin,red), col(illinois,green),
+ col(iowa,blue), col(indiana,red), col(michigan,blue), col(ohio,green)}
+
+
+
+This method (guess&check programming) allows to encode a large number of
+complicated problems in an intuitive way. DLV
can then
+use such an encoding to solve the problems surprisingly efficiently.
+
+
+
+Download example program.
+
+
+
+As an exercise, you can use DLV
to prove that a
+map of Germany, Belgium, Luxembourg and France
+is not 3-colorable.
+
+
+
+
+
+
+The Fibonacci Example: Built-in Predicates and Integer Arithmetics
+
+
+Note that this section introduces some features of DLV
+which are not part of standard datalog.
+
+
+In the following example, the Fibonacci function is defined,
+which is relevant in areas as disparate as Chaos Theory and Botanics.
+Its starts with the following values:
+1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, ...
+(Apart from the first two values, each value is defined as the sum of the
+previous two.)
+
+
+true.
+fibonacci(1, 1) :- true.
+fibonacci(1, 2) :- true.
+fibonacci(F, Index) :- +(F1, F2, F),
+ fibonacci(F1, Index1),
+ fibonacci(F2, Index2),
+ #succ(Index1, Index2),
+ #succ(Index2, Index).
+
+
+This program uses the built-in predicates +
(which adds or
+subtracts integer numbers) and #succ
(the successor function).
+Note that for better readability, it is also correct to write
+F = F1 + F2
instead of +(F1, F2, F)
and
+Index2 = Index1 + 1
instead of
+#succ(Index1, Index2)
.
+Still, these simple equations always map to the built-in predicates and
+may not be extended any further. (It is not allowed to write
+A = B + C + D
, this has to be split into two parts.)
+
+
+
+The second topic that has to be discussed at this point is why the fact
+true.
was introduced.
+The reason for this is the strong separation that is made between EDB and
+IDB predicates. Since fibonacci
is used on the left-hand side
+of a rule, it is in the IDB. IDB predicates cannot be used in facts (because
+then they would have to be in the EDB).
+Because of that, a fact is introduced and rules are built that are always true
+and are therefore equivalent to facts.
+
+Note that this distinction between IDB and EDB predicates is not necessary
+anymore in the most recent versions of DLV
. Therefore,
+you can now declare fibonacci(1, 1)
and
+fibonacci(1, 2)
simply as facts.
+
+
+
+Whenever integer arithmetics are used, the range of possible values has to
+be restricted, since DLV
requires the space of possible
+solutions to be finite. This is done by invoking DLV
+with the option -N
. (For a full description of
+DLV
usage, refer to the
+
+DLV
manual.)
+
+For example, invoking DLV
with
+
+
+dl -N=100 fibonacci.dl
+
+
+results in the model
+
+
+{true, fibonacci(1,1), fibonacci(1,2), fibonacci(2,3), fibonacci(3,4),
+ fibonacci(5,5), fibonacci(8,6), fibonacci(13,7), fibonacci(21,8),
+ fibonacci(34,9), fibonacci(55,10), fibonacci(89,11)}
+
+
+These are all the Fibonacci numbers not greater than 100.
+
+
+
+Download example program.
+
+
+
+
+
+
+
+Click
+here
+for some interesting material on Fibonacci numbers.
+
+
+
+
+
+The 8-Queens Example: Guess&Check Programming with Integers
+
+
+The 8 queens problem asks for a solution in which 8 queens are placed on a
+8 x 8 chess board without threatening eachother. A queen threatens another
+if it is in the same row, column, or on a diagonal.
+
+
+% guess horizontal position for each row
+q(X,1) v q(X,2) v q(X,3) v q(X,4) v q(X,5) v q(X,6) v q(X, 7) v q(X,8) :- #int(X), X > 0.
+
+% check
+
+% assert that each column may only contain (at most) one queen
+:- q(X1,Y), q(X2,Y), X1 <> X2.
+
+% assert that no two queens are in a diagonal from top left to bottom right
+:- q(X1,Y1), q(X2,Y2), X2=X1+N, Y2=Y1+N, N > 0.
+
+% assert that no two queens are in a diagonal from top right to bottom left
+:- q(X1,Y1), q(X2,Y2), X2=X1+N, Y1=Y2+N, N > 0.
+
+
+To run this program with DLV
, type the following:
+
+
+dl -n=1 -N=8 8queens.dl
+
+
+This will return a result like
+
+
+{q(1,3), q(2,7), q(3,2), q(4,8), q(5,5), q(6,1), q(7,4), q(8,6)}
+
+
+To get all 92 correct solutions, type
+
+
+dl -N=8 8queens.dl
+
+
+
+Download example program.
+
+
+
+
+
+
+A simple Physics Diagnosis example
+
+
+We will now show how to use DLV
to do diagnosis.
+We choose a physics application domain, a simplified version of ECAL
+pre-calibration.
+
+
+
+
+As shown in the picture, a test beam is directed onto a scintillating crystal
+whose light emission is measured by an avalanche photodiode (APD).
+The measurement is then read with some readout electronics.
+Alternatively to the beam reading, the APD can receive a test pulse signal,
+which allows to check the correct functioning of the APD independently from
+the crystal.
+The following program allows to automatically diagnose malfunctioning parts:
+
+
+ok(testpulse_reading).
+ok(beam_reading).
+
+good(crystal) v bad(crystal).
+good(apd) v bad(apd).
+
+:- good(X), bad(X).
+
+good(crystal) :- ok(beam_reading).
+good(apd) :- ok(beam_reading).
+bad(apd) v bad(crystal) :- not ok(beam_reading).
+good(apd) :- ok(testpulse_reading).
+bad(apd) :- not ok(testpulse_reading).
+
+
+The program starts with two facts expressing our observations.
+Here, both the testpulse reading and the beam reading were found to be correct;
+below, we will evaluate the program with different observations.
+The following two rules tell the system that crystals and APDs are either
+working or broken. After this follows a constraint that assures that they
+cannot be both at the same time.
+
+Finally, there are five rules that are a collection of expert knowledge.
+They model the knowledge about the domain and show quite clearly why the
+test pulse is available as a separate input to the APDs: it allows to
+find out if the APD works correctly without having to make any assumptions
+about the crystal.
+If the reaout of the beam on the other hand were not correct, one could
+not be sure if the responsible part is the crystal or the APD.
+
+
+Here, the unique result is the model {good(crystal), good(apd)}
.
+Suppose we exchange the two EDB facts (the first two lines of this program)
+to ok(testpulse_reading).
then the result changes to
+{good(apd), bad(crystal)}
.
+The whole set of different cases is shown in the following table:
+
+
+
+
+EDB |
+Model(s) |
+
+
+
+ {ok(testpulse_reading). ok(beam_reading).} |
+ {good(crystal), good(apd)} |
+
+
+
+ {ok(testpulse_reading).} |
+ {good(apd), bad(crystal)} |
+
+
+
+ {ok(beam_reading).} |
+ no model |
+
+
+
+ {} |
+ {bad(apd), good(crystal)},
+{bad(apd), bad(crystal)} |
+
+
+
+
+The case that the facts base is {ok(beam_reading).}
+is also interesting:
+According to our program, if ok(beam_reading)
is true,
+ok(testpulse_reading)
also has to be true.
+Therefore, there is no consistent model in this case.
+In other words, according to our program, such observations cannot be made.
+
+
+
+
+
+
+A different way to implement the Physics Diagnosis example
+
+
+The way to do diagnosis that was presented in the previous section has two
+drawbacks:
+It requires that more knowledge than necessary has to be coded in the program,
+and resulting from this, the program does not really do anything original.
+Also, it it hard to extend.
+Here, we show a different (better) way to do diagnosis in the same
+application domain.
+We represent the system as a graph of its units:
+
+
+connected(beam, crystal).
+connected(crystal, apd).
+connected(testpulse_injector, apd).
+connected(apd, readout).
+
+good_path(X,Y) :- not bad(X), not bad(Y), connected(X, Y).
+good_path(X,Z) :- good_path(X,Y), good_path(Y, Z).
+
+bad(crystal) v bad(apd).
+
+testpulse_readout_ok :- good_path(testpulse_injector, readout).
+beam_readout_ok :- good_path(beam, readout).
+
+
+In this example program, we have left away all the possible observations,
+which we implement as constraints, as shown in the following table:
+
+
+
+
+Observations (Constraints) |
+Model(s) (good_path predicates omitted) |
+
+
+
+ {} |
+
+{bad(crystal), testpulse_readout_ok},
+
+{bad(apd)}
+ |
+
+
+
+ {:- testpulse_readout_ok.} |
+ {bad(apd)} |
+
+
+
+ {:- beam_readout_ok.} |
+
+{bad(crystal), testpulse_readout_ok},
+
+{bad(apd)}
+ |
+
+
+
+ {:- beam_readout_ok. :- testpulse_readout_ok.} |
+ {bad(apd)} |
+
+
+
+ {:- not testpulse_readout_ok.} |
+
+{bad(crystal), testpulse_readout_ok}
+ |
+
+
+
+ {:- not beam_readout_ok.} |
+ no model |
+
+
+
+ {:- not beam_readout_ok.
+:- not testpulse_readout_ok.} |
+ no model |
+
+
+
+
+
+Download example program.
+
+
+
+
+
+
+The Monkey&Banana Example: Planning
+
+
+
+The following example shall give an idea of how DLV
+can be used to do planning.
+
+
+
+Please note that there is a DLV
planning frontend
+that uses a convenient special-purpose planning language and which is not
+described in this tutorial. Instead, we use plain disjunctive datalog for
+solving planning problems here.
+If you are interested in this frontend, please refer to the
+DLV
+homepage for further information.
+
+
+
+Consider the following classic planning problem.
+A monkey is in a room with a chair and a banana which is fixed to the
+ceiling.
+The monkey cannot reach the banana unless it stands on the chair; it is simply
+too high up. The chair is now at a position different from the place
+where the banana is hung up, and the monkey itself initially is at again
+a different place.
+
+
+Since the program is quite long compared to the earlier examples, it will
+be explained step by step.
+
+
+walk(Time) v move_chair(Time) v ascend(Time) v idle(Time) :- #int(Time).
+
+
+At each discrete point in time, the monkey performs one of the following
+for actions: it walks, it moves the chair (while doing this, it also moves
+through the room), it climbs up the chair, or it does nothing.
+#int is again a built-in predicate which is true exactly if its
+argument is an integer value.
+
+
+monkey_motion(T) :- walk(T).
+monkey_motion(T) :- move_chair(T).
+
+stands_on_chair(T2) :- ascend(T), T2 = T + 1.
+:- stands_on_chair(T), ascend(T).
+:- stands_on_chair(T), monkey_motion(T).
+stands_on_chair(T2) :- stands_on_chair(T), T2 = T + 1.
+
+
+After climbing up the chair, it is on it. If is is already on it, it cannot
+climb up any further. While on the chair, it cannot walk around.
+If it was on the chair earlier, it will be there in the future.
+
+
+chair_at_place(X, T2) :- chair_at_place(X, T1), T2 = T1 + 1, not move_chair(T1).
+chair_at_place(Pos, T2) :- move_chair(T1), T2 = T1 + 1,
+ monkey_at_place(Pos, T2).
+
+
+If the chair is not moved, it will stay at the same place.
+If the monkey moves the chair, it changes its position.
+
+
+monkey_at_place(monkey_starting_point, T) v
+monkey_at_place(chair_starting_point, T) v
+monkey_at_place(below_banana, T) :- #int(T).
+
+
+The monkey is somewhere in the room. (For simplicity, only three positions are
+possible.)
+
+
+:- monkey_at_place(Pos1, T2), monkey_at_place(Pos2, T1),
+ T2 = T1 + 1, Pos1 != Pos2, not monkey_motion(T1).
+
+:- monkey_at_place(Pos, T2), monkey_at_place(Pos, T1), T2 = T1 + 1,
+ monkey_motion(T1).
+
+:- ascend(T), monkey_at_place(Pos1, T), chair_at_place(Pos2, T), Pos1 != Pos2.
+
+:- move_chair(T), monkey_at_place(Pos1, T), chair_at_place(Pos2, T),
+ Pos1 != Pos2.
+
+
+The monkey cannot change its position without moving.
+The monkey cannot stay at the same place if it moves.
+It cannot climb up the chair if it is somewhere else.
+It cannot move the chair if it is somewhere else.
+
+
+monkey_at_place(monkey_starting_point, 0) :- true.
+chair_at_place(chair_starting_point, 0) :- true.
+true.
+
+
+Initially, the monkey and the chair are at different positions.
+
+
+can_reach_banana :- stands_on_chair(T), chair_at_place(below_banana, T).
+eats_banana :- can_reach_banana.
+happy :- eats_banana.
+
+:- not happy.
+
+
+The monkey can only reach the banana if it stands on the chair and the
+chair is below the banana.
+If it can reach the banana, it will eat it, and this will make it happy.
+Our goal is to make the monkey happy.
+
+
+step(N, walk, Destination) :- walk(N), monkey_at_place(Destination, N2),
+ N2 = N + 1.
+step(N, move_chair, Destination) :- move_chair(N),
+ monkey_at_place(Destination, N2),
+ N2 = N + 1.
+step(N, ascend, " ") :- ascend(N).
+
+
+
+The step rules collect all the things we can derive from the situation and
+build a consistent plan. (There is no step rule for the action idle
+since we are not interested in it.)
+
+
+This program again uses integer arithmetics; to find a plan, the maximum
+integer variable has to be set to at least 3:
+
+
+dl -N=3 banana.dl
+
+
+This results in the following model (If N is set to a value greater than 3,
+DLV
will find other plans that make the monkey happy.)
+
+
+{chair_at_place(chair_starting_point,0),
+monkey_at_place(monkey_starting_point,0),
+monkey_at_place(chair_starting_point,1),
+monkey_at_place(below_banana,2),
+monkey_at_place(below_banana,3),
+walk(0), move_chair(1), ascend(2), idle(3),
+chair_at_place(chair_starting_point,1),
+chair_at_place(below_banana,2),
+chair_at_place(below_banana,3),
+monkey_motion(0), monkey_motion(1),
+step(0,walk,chair_starting_point),
+step(1,move_chair,below_banana),
+step(2,ascend," "),
+stands_on_chair(3), can_reach_banana, eats_banana, happy}
+
+
+Download example program.
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/biblio/ASP-DLV_tutorial.md b/biblio/ASP-DLV_tutorial.md
new file mode 100644
index 0000000..b152ce6
--- /dev/null
+++ b/biblio/ASP-DLV_tutorial.md
@@ -0,0 +1,923 @@
+## The **`DLV`** Tutorial
+
+In this tutorial, we give an introduction to *Disjunctive Datalog*
+(using some of the extensions of **`DLV`**). The tutorial does not give
+a full description of the usage and capabilities of **`DLV`**. For a
+more complete account of these, see the [**`DLV`**
+homepage](http://www.dlvsystem.com/) and the [**`DLV`** online user
+manual](http://www.dlvsystem.com/man/). The examples shown in this
+tutorial work with every recent **`DLV`** release. Executables of the
+**`DLV`** system for various platforms can be downloaded from the
+[**`DLV`** homepage](http://www.dlvsystem.com/).
+
+The tutorial consists of the following sections, each of them being
+built around a guiding example:
+
+- The First Example : Rules and Facts
+- The Second Example : Negation and the Complete World Assumption
+- The Family Tree Example : Predicates, Variables, and Recursion
+- `DLV` as a Deductive Database System; Comparison Operators
+- The Railway Crossing Example : True Negation and Negation as Finite
+ Failure
+- The Broken Arm Example : Disjunctive Datalog and the Stable Model
+ Semantics
+- Strong Constraints
+- Graph Coloring: Guess&Check Programming
+- The Fibonacci Example: Built-in Predicates and Integer Arithmetics
+- The 8-Queens Example: Guess&Check Programming with Integers
+- A simple Physics Diagnosis example
+- A different way to implement the Physics Diagnosis example
+- The Monkey&Banana Example: Planning
+
+This page is quite long. People who are in a hurry might appreciate the
+information that the tutorial is fully on this page, there will be no
+branches and no links to further pages.
+
+**This tutorial is written for computer-literate people with a
+background different from computer science, or students new to this
+area. It was originally written for physicists at CERN, and some
+examples are tailored towards this community.**
+
+------------------------------------------------------------------------
+
+### Introduction
+
+Datalog is a *declarative* (programming) language. This means that the
+programmer does not write a program that solves some problem but instead
+specifies what the solution should look like, and a Datalog inference
+engine (or *Deductive Database System*) tries to find the the way to
+solve the problem and the solution itself. This is done with *rules* and
+*facts*. Facts are the input data, and rules can be used to derive more
+facts, and hopefully, the solution of the given problem.
+
+Disjunctive datalog is an extension of datalog in which the logical OR
+expression (the disjunction) is allowed to appear in the rules - this is
+not allowed in basic datalog.
+
+**`DLV`** (= datalog with disjunction) is a powerful though freely
+available deductive database system. It is based on the declarative
+programming language *datalog*, which is known for being a convenient
+tool for knowledge representation. With its disjunctive extensions, it
+is well suited for all kinds of nonmonotonic reasoning, including
+diagnosis and planning.
+
+Finally, we have to mention to the more advanced reader that **`DLV`**
+is relevant to two communities. Firstly, as mentioned, it is a deductive
+database engine and can therefore be seen as a way to query data from
+databases which is strictly more powerful than for example SQL
+(everything that can be done with the core SQL language can also be done
+with **`DLV`**, and more), but it is also often described as a system
+for answer set programming (ASP). This is a powerful new paradigm from
+the area of \"Nonmonotonic Reasoning\" which allows to formulate even
+very complicated problems in a straightforward and highly declarative
+way. One may call this paradigm even more declarative than classical
+logic. Of course, every programming language to be processed by a
+computer has to have both fixed syntax (i.e. a grammar that specifies
+what programs of this language have to look like, and what combinations
+of symbols make a valid program) and semantics (which abstractly
+specifies what the computer has to do with the program by declaring how
+a program is to be translated into the/a correct result). There is wide
+agreement (and also some excitement) that both the syntax and semantics
+of the language of **`DLV`** are very simple and intuitive. In fact, we
+do not know of any way to make the language even simpler while
+preserving its characteristics.
+
+Both the syntax and semantics of **`DLV`** will be described in this
+tutorial.
+
+------------------------------------------------------------------------
+
+### The First Example : Rules and Facts
+
+Suppose we want to model that every time somebody tells us a joke, we
+laugh. Furthermore, somebody now tells us a joke. This could be done in
+the following way:
+
+> joke.
+> laugh :- joke.
+
+The first line is called a fact and expresses that `joke` is true (a
+simple word such as `joke` appearing in a rule or fact which has a truth
+value is called a *proposition*. A more general name - which we will use
+in the following - for the constituents of rules and facts is *atom*.).
+The second line is called a rule. It is read as \"if joke is true, laugh
+must also be true\". (The sign \":-\" is meant to be an arrow to the
+left, the logic programming version of the implication.)
+
+If the author of such a program decides it appropriate, one can also
+interpret some causality into a rule and read this one as \"from joke
+follows laugh\". This is pure matter of choice of the human, and
+**`DLV`** does not care about it. The left side of a rule is called its
+*head*, while the right side is called its *body*.
+
+A result of a Datalog computation is called a *model*. The meaning of
+this is clear: it is a consistent explanation (model) of the world, as
+far as the Datalog system can derive it. If a datalog program is
+inconsistent, i.e., it is contradictory, there is simply no model (we
+will see examples of this later).
+
+Of course, since in this example `joke` is certainly true (this is given
+by the fact), `laugh` is also true. `DLV` now tries to find all those
+models of the world that correctly and consistently explain the
+observations made (= the program). A model assigns a truth value (either
+*true* or *false*) to each atom appearing in the program, and is written
+as the set of atoms that are true in a certain model. The model of the
+above program is `{joke, laugh}`. When all atoms are false in a model,
+we talk about an empty model (written as `{}`). Note that having an
+empty model is very different from finding no model. We will see
+examples for this later.
+
+Simple datalog programs like the one above always have exactly one
+model. In general, though, **`DLV`** programs may have zero (as
+mentioned) or even many models. We will see examples of such programs
+later.
+
+------------------------------------------------------------------------
+
+### The Second Example : Negation and the Complete World Assumption
+
+Next, suppose we are not aware of being told a joke. In this case, the
+correct datalog program looks like this:
+
+> laugh :- joke.
+
+The program itself does not express that joke is false, but the
+so-called *Complete World Assumption (CWA)* does. It is one of the
+foundations `DLV` bases its computations on and says that everything
+about which nothing is known is assumed to be false. Therefore, the
+model for this program is `{}`. (This means that there is a model but it
+is empty. It is also possible that for a given program there is no
+model.) We will come back to the CWA in more detail later in the section
+that discusses `DLV` as a deductive database system.
+
+Next, we elaborate a bit on this example. First, we want to express that
+to be able to understand a joke, one has to hear it and must not be
+stupid. To hear it, one must not be deaf and there must be a joke.
+Finally, to laugh about the joke, one must understand it. Alternatively,
+stupid people might laugh without being told a joke.
+
+> joke.
+> hear_joke :- joke, not deaf.
+> understand_joke :- hear_joke, not stupid.
+> laugh :- understand_joke.
+> laugh :- stupid, not joke.
+
+In two of the rules, we encounter negated atoms. These are true if the
+atoms themselves are false. We also encounter rules that contain more
+than one atom in the body. In such a case, a body is true if each of the
+literals are true (a literal is a possibly negated atom). For example,
+
+> hear_joke :- joke, not deaf.
+
+is read as \"if `joke` is true and `deaf` is false then `hear_joke` must
+be true\".
+
+The model for this program is
+`{joke, hear_joke, understand_joke, laugh}`. Again, by virtue of the
+CWA, `deaf` and `stupid` are assumed to be false - there are no facts
+making these atoms true and no rules which can derive their truth. Now
+suppose we remove `joke.` from the program and add `stupid.` instead.
+Then, the resulting model would be `{stupid, laugh}`.
+
+Please note the following things: (i) Those atoms that are not listed as
+elements of the models above are *not* automatically rendered false.
+Rather, they are unknown. (ii) Suppose the program would look like this:
+
+> stupid.
+> laugh :- stupid, not joke.
+
+The model of this program is `{stupid, laugh}`. If we now add the fact
+`joke.` we get the model `{stupid, joke}`, from which the atom `laugh`
+got lost. In other words, you may add more information and lose
+information that could be derived before because of that. Due to this
+property, the formalism of **`DLV`** is called *nonmonotonic*, just as
+mathematical functions which are neither monotonically increasing nor
+decreasing are called nonmonotonic. At first sight, this may look like
+an ugly property of this formalism, but in fact, it allows to do many
+useful things.
+
+------------------------------------------------------------------------
+
+### The Family Tree Example : Predicates, Variables, and Recursion
+
+So far we have studied simple atoms as the building blocks of our rules.
+In fact, atoms may be constructed to hold a number of arguments - they
+are then also called *predicates*.
+
+In the following program, we have two binary predicates, `parent` and
+`grandparent`. (They are called binary because they both have two
+arguments.)
+
+We have to map some semantics to the two arguments of the predicates.
+Here, the first argument is assumed to be the older person (the parent
+or grandparent), while the second argument refers to the younger person
+(the child or grandchild). Certainly, we could do it the other way as
+well, but then we would have to adjust all the rules that will follow.
+
+> parent(john, james).
+> parent(james, bill).
+> grandparent(john, bill) :- parent(john, james), parent(james, bill).
+
+Of course, the model of this program is
+`{parent(john, james), parent(james, bill), grandparent(john,bill)}`.
+
+With predicates, it is allowed to use variables, which begin with an
+upper-case character, differently from the constants of the previous
+program that begin with a lower-case letter. The following program has
+the same model as the previous example:
+
+> parent(john, james).
+> parent(james, bill).
+> grandparent(X, Y) :- parent(X, Z), parent(Z, Y).
+
+This new grandparent rule which uses variables simply models that every
+parent of a parent is a grandparent.
+
+Note that the facts of a program are often called the *Extensional
+Database (EDB)*, while the remaining rules are called the *Intensional
+Database (IDB)*. With **`DLV`**, the EDB can be read either from a
+relational or object-oriented database, or just simply from files, where
+no separation of rules and facts is required.
+
+We can now extend this example a bit to show how **`DLV`** can be used
+to model knowledge as datalog rules and exploit it. First we add a few
+more facts to add more people and to express their gender:
+
+> parent(william, john).
+> parent(john, james).
+> parent(james, bill).
+> parent(sue, bill).
+> parent(james, carol).
+> parent(sue, carol).
+>
+> male(john).
+> male(james).
+> female(sue).
+> male(bill).
+> female(carol).
+
+Then we can add more rules that model family relationships.
+
+> grandparent(X, Y) :- parent(X, Z), parent(Z, Y).
+> father(X, Y) :- parent(X, Y), male(X).
+> mother(X, Y) :- parent(X, Y), female(X).
+> brother(X, Y) :- parent(P, X), parent(P, Y), male(X), X != Y.
+> sister(X, Y) :- parent(P, X), parent(P, Y), female(X), X != Y.
+
+The rules for brother and sister use `X != Y` to require that X and Y
+are different (one cannot be his own brother). This is called a built-in
+predicate, since it could be written as something like
+`not_equal(X, Y)`. **`DLV`** knows quite a few of these built-in
+predicates. For this program, **`DLV`** finds the following model (to
+simplify readability, the facts already listed above were removed from
+the model below; of course, they still belong there):
+
+> {grandparent(william,james), grandparent(john,bill), grandparent(john,carol),
+> father(john,james), father(james,bill), father(james,carol),
+> mother(sue,bill), mother(sue,carol),
+> brother(bill,carol), sister(carol,bill)}
+
+Let us now exchange the IDB rules against the following (the EDB facts
+remain the same):
+
+> ancestor(X, Y) :- parent(X, Y).
+> ancestor(X, Y) :- parent(X, Z), ancestor(Z, Y).
+
+These rules are interesting, since they use recursion to implement
+transitivity. They express that, to start with, every parent is an
+ancestor, and, secondly, that every parent of an ancestor is an
+ancestor. Please note that the semantics used ensures that it is
+impossible that there be any problems with left-recursion as they occur
+in languages as Prolog. In **`DLV`**, the programmer can safely ignore
+such considerations.
+
+The model of this program combined with the six-entries `parent` facts
+base above results in the following model (where the `parent` facts were
+again removed for readability):
+
+> {ancestor(william,john), ancestor(william,james), ancestor(william,bill),
+> ancestor(william,carol), ancestor(john,james), ancestor(john,bill),
+> ancestor(john,carol), ancestor(james,bill), ancestor(james,carol),
+> ancestor(sue,bill), ancestor(sue,carol)}
+
+Finally, some subtle detail has to be noted which is quite useful to
+improve the readability of the rules. In the case that a certain
+argument of a predicate is irrelevant for a certain rule, no dummy
+variable has to be inserted, but the `_` can be used. For instance,
+suppose we want to derive the persons from the parent facts. For this,
+we can write the following rules:
+
+> person(X) :- parent(X, _).
+> person(X) :- parent(_, X).
+
+Finally, please *avoid* calling a predicate as shown in this section a
+proposition. (It is fine to call them atoms.)
+
+------------------------------------------------------------------------
+
+### `DLV` as a Deductive Database System; Comparison Operators
+
+When you use the CWA in one of your programs, you basically view the
+`DLV` system as a *deductive* database system, since you do not ask for
+what is logically right, but what you can usefully derive from your
+facts base. Following this approach, you can perform queries on the
+existing data (the facts base), derive (and \"store\") new data using
+queries(=rules), which again can be used to deduce even more data, and,
+using the CWA, even ask queries as to what is *not* in (or derivable
+from) your database.
+
+Consider the following example in SQL in the well know business domain
+(which many relational database systems examples use). Emp is a
+relational table containing employee information, and dept contains data
+on departmens of a company in which the employees work.
+
+> SELECT e.name, e.salary, d.location
+> FROM emp e, dept d
+> WHERE e.dept = d.dept_id
+> AND e.salary > 31000;
+
+When the relational tables are encoded as a facts base, we can rewrite
+the above query into a datalog rule:
+
+> emp("Jones", 30000, 35, "Accounting").
+> emp("Miller", 38000, 29, "Marketing").
+> emp("Koch", 2000000, 24, "IT").
+> emp("Nguyen", 35000, 42, "Marketing").
+> emp("Gruber", 32000, 39, "IT").
+>
+> dept("IT", "Atlanta").
+> dept("Marketing", "New York").
+> dept("Accounting", "Los Angeles").
+>
+> q1(Ename, Esalary, Dlocation) :- emp(Ename, Esalary, _, D), dept(D, Dlocation),
+> Esalary > 31000.
+
+As you can see, joins are achieved via variable binding (we use the same
+variable D both in emp and in dept), selections can for example be
+achieved by the comparison operators, and projections (i.e. where
+unwanted data columns are excluded from a query result) can be
+accomplished by using \_ or an unbound variable.
+
+You can use `DLV` to ask all the queries that are possible in the core
+SQL language. Furthermore, (as you will see when the full expressive
+power of `DLV` is unveiled later in this tutorial) you can also encode
+many useful queries that cannot be expressed in SQL.
+
+This example used another feature of `DLV` that has not been introduced
+yet: comparison operators. `DLV` supports the operators \<, \>, \>=,
+\<=, and = for integers, floating point values, and strings. This is an
+extension that is not part of basic datalog, but it is convenient and
+also compatible with the philosophy of datalog, as you can think of an
+expression X \> Y as a predicate `greater_than(X,Y)` for which the facts
+base of all the greater-than relationships between constant symbols in
+your program are automatically generated. Therefore, we call these
+comparison operators *built-in predicates*.
+
+Note that you could also rewrite `q1` to use the operator = for the
+join. The rule below obtains the same result as the one shown earlier:
+
+> q1(Ename, Esalary, Dlocation) :- emp(Ename, Esalary, _, D1),
+> dept(D2, Dlocation), D1 = D2,
+> Esalary > 31000.
+
+[Download example
+program.](http://www.dlvsystem.com/tutorial/examples/emp.dl)
+
+------------------------------------------------------------------------
+
+### The Railway Crossing Example : True Negation and Negation as Finite Failure
+
+**`DLV`** supports *two* kinds of negation. Here, we emphasize the
+difference between explicitly expressing the falseness of an atom and
+having it done by the *Complete World Assumption*. The following program
+uses the CWA. It has the model `{cross}` because train_approaching is
+assumed to be false (as it being true is not stated anywhere). This kind
+of negation is called *negation as (finite) failure* or *naf*.
+
+> cross :- not train_approaching.
+
+The next program uses so-called *true* or *classical negation*. Since
+`-train_approaching` is not known to be true, the following program has
+only an empty model.
+
+> cross :- -train_approaching.
+
+The difference between the two kinds of negation is quite important: In
+the first example, we cross the railroad track if we have no information
+on any trains approaching, which is quite dangerous, while in the second
+example, we only cross if we know for sure that no train comes. In
+particular, the left side of the previous rule will only be true if
+
+> -train_approaching.
+
+is in the facts base of the program.
+
+True negation is stronger than negation as finite failure. If something
+is true via true negation, it is always also true if negated by negation
+as finite failure. For example, the program
+
+> cross :- not train_approaching.
+> -train_approaching.
+
+has the model `{cross, -train_approaching}`.
+
+Using True Negation also allows to build programs that are contradictory
+and have no models. Consider the following example:
+
+> cross.
+> -cross.
+
+Certainly, this program cannot have a model. This is very different from
+a program that has an empty model, which would just mean that the
+program represents a possible situation but that all of its atoms are
+assumed to be false.
+
+------------------------------------------------------------------------
+
+### The Broken Arm Example : Disjunctive Datalog and the Stable Model Semantics
+
+Suppose you have met a friend recently and you know that he had one of
+his arms broken, but you don\'t know which one. Now you didn\'t receive
+a greeting card for your birthday and wonder if you should be angry on
+him or if he just cannot write because of his broken arm. Finally, you
+know that he writes with his right hand. The following **DLV** program
+computes the two possible explanations for the observations you made.
+
+> left_arm_broken v right_arm_broken.
+> can_write :- left_arm_broken.
+> be_angry :- can_write.
+
+The first rule is called a disjunctive rule; The v is read as \"or\" and
+the whole rule is read as \"For sure, either the left or the right arm
+is broken.\" As we can see here, a disjunctive rule may (but does not
+have to) have an empty body (= lack a body). It is still called a rule,
+since it is certainly not a fact. (It is unknown if the left or the
+right arm is broken.)
+
+Being able to process incomplete information (i.e. being unsure if the
+left or the right arm is broken) is one of the great strengths of
+**`DLV`**. The resulting models of this query are
+`{left_arm_broken, can_write, be_angry}` and `{right_arm_broken}`.
+
+In fact, the disjunction `left_arm_broken v right_arm_broken.` also
+allows both `left_arm_broken` and `right_arm_broken` to be true at the
+same time. Still, **`DLV`** does not output the model
+`{left_arm_broken, right_arm_broken, can_write, be_angry}` due to the
+computing paradigm that it uses to cope with uncertainty, and which is
+called the *Stable Model Semantics*. Under this semantics, a model is
+not stable if there is a smaller model which is a subset of it (which is
+the case for both stable models shown above with respect to the \"big\"
+model containing `left_arm_broken` and `right_arm_broken`). While this
+might seem complicated, it is a very powerful feature of **`DLV`** which
+is very useful for all kinds of reasoning. We will come back to this
+later in this tutorial. (For the moment, we want to emphasize that this
+one \"big\" model which is not stable would be obviously wrong in this
+application.)
+
+Note that the same uncertainty can also be expressed by the following
+program:
+
+> left_arm_broken :- not right_arm_broken.
+> right_arm_broken :- not left_arm_broken.
+> can_write :- left_arm_broken.
+> be_angry :- can_write.
+
+This program results in the same pair of models. The method used here is
+called *Unstratified Negation* and is considered less elegant than the
+first method. Also, there are certain interesting reasoning problems
+that **`DLV`** can solve and which can only be expressed with true
+disjunction but not with unstratified negation.
+
+Finally, please note that rule bodies may either contain positive
+(nonnegated) atoms, atoms negated by true negation, and atoms negated by
+negation as failure, while rule heads may only contain positive atoms
+and true negation, but no negation as failure. In other words, a rule
+such as
+
+> not a :- b. % INVALID !!!
+
+is *not* valid! (The % sign in a **`DLV`** program starts a comment
+which goes to the right to the end of the line.)
+
+------------------------------------------------------------------------
+
+### Strong Constraints
+
+**`DLV`** also supports integrity constraints (strong constraints). A
+constraint is a rule with an empty head. If its body is true (which is
+of course the case exactly if all the literals in the body are true at
+the same time), a model is made inconsistent and is removed. For
+example, in the family tree example which was presented earlier, we can
+easily write an integrity constraint to assure that the facts base does
+not erroneously contain contradicting facts saying that a person is male
+and female at the same time.
+
+> :- male(X), female(X).
+
+This kind of constraints is called *strong constraints* because there is
+also a different kind (*weak constraints*) supported by **`DLV`** which
+is not addressed in this tutorial. This other kind of constraints is
+very useful to solve optimization problems.
+
+------------------------------------------------------------------------
+
+### Graph Coloring: Guess&Check Programming
+
+Graph 3-colorability is a hard (NP-complete) problem. It is the problem
+of deciding if there exists a coloring of a map of countries
+corresponding to the given graph using no more than three colors in
+which no two neighbour countries (nodes connected by an arc) have the
+same color. It is known that every map can be colored given these
+constraints if four colors are available.
+
++-----------------------------------+-----------------------------------+
+| . |
+| system.com/tutorial/midwest2.gif) | > node(wisconsin). |
+| | > node(illinois). |
+| | > node(iowa). |
+| | > node(indiana). |
+| | > node(michigan). |
+| | > node(ohio). |
+| | > |
+| | > arc(minnesota, wisconsin). |
+| | > arc(illinois, iowa). |
+| | > arc(illinois, michigan). |
+| | > arc(illinois, wisconsin). |
+| | > arc(illinois, indiana). |
+| | > arc(indiana, ohio). |
+| | > arc(michigan, indiana). |
+| | > arc(michigan, ohio). |
+| | > arc(michigan, wisconsin). |
+| | > arc(minnesota, iowa). |
+| | > arc(wisconsin, iowa). |
+| | > arc(minnesota, michigan). |
++-----------------------------------+-----------------------------------+
+
+This problem can now be solved with a very simple datalog program, in
+which we first guess a coloring by using a disjunctive rule and then
+check it by adding a (strong) constraint which deletes all those
+colorings that do not satisfy our requirements (that there may be no arc
+between two nodes of equal color):
+
+> % guess coloring
+> col(Country, red) v col(Country, green) v col(Country, blue) :- node(Country).
+>
+> % check coloring
+> :- arc(Country1, Country2), col(Country1, CommonColor), col(Country2, CommonColor).
+
+This problem instance has 6 solutions (stable models), therefore, it is
+3-colorable. Below, one solution is shown, in which the facts base has
+again be removed for better readability:
+
+> {col(minnesota,green), col(wisconsin,red), col(illinois,green),
+> col(iowa,blue), col(indiana,red), col(michigan,blue), col(ohio,green)}
+
+This method (guess&check programming) allows to encode a large number of
+complicated problems in an intuitive way. **`DLV`** can then use such an
+encoding to solve the problems surprisingly efficiently.
+
+[Download example
+program.](http://www.dlvsystem.com/tutorial/examples/3col.dl)
+
+As an exercise, you can use **`DLV`** to prove that a [map of Germany,
+Belgium, Luxembourg and
+France](http://www.dlvsystem.com/tutorial/benelux.jpg) is not
+3-colorable.
+
+------------------------------------------------------------------------
+
+### The Fibonacci Example: Built-in Predicates and Integer Arithmetics
+
+Note that this section introduces some features of **`DLV`** which are
+not part of standard datalog.
+
+In the following example, the Fibonacci function is defined, which is
+relevant in areas as disparate as Chaos Theory and Botanics. Its starts
+with the following values: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,
+233, 377, \... (Apart from the first two values, each value is defined
+as the sum of the previous two.)
+
+> true.
+> fibonacci(1, 1) :- true.
+> fibonacci(1, 2) :- true.
+> fibonacci(F, Index) :- +(F1, F2, F),
+> fibonacci(F1, Index1),
+> fibonacci(F2, Index2),
+> #succ(Index1, Index2),
+> #succ(Index2, Index).
+
+This program uses the built-in predicates `+` (which adds or subtracts
+integer numbers) and `#succ` (the successor function). Note that for
+better readability, it is also correct to write `F = F1 + F2` instead of
+`+(F1, F2, F)` and `Index2 = Index1 + 1` instead of
+`#succ(Index1, Index2)`. Still, these simple equations always map to the
+built-in predicates and may not be extended any further. (It is not
+allowed to write `A = B + C + D`, this has to be split into two parts.)
+
+The second topic that has to be discussed at this point is why the fact
+`true.` was introduced. The reason for this is the strong separation
+that is made between EDB and IDB predicates. Since `fibonacci` is used
+on the left-hand side of a rule, it is in the IDB. IDB predicates cannot
+be used in facts (because then they would have to be in the EDB).
+Because of that, a fact is introduced and rules are built that are
+always true and are therefore equivalent to facts. Note that this
+distinction between IDB and EDB predicates is not necessary anymore in
+the most recent versions of **`DLV`**. Therefore, you can now declare
+`fibonacci(1, 1)` and `fibonacci(1, 2)` simply as facts.
+
+Whenever integer arithmetics are used, the range of possible values has
+to be restricted, since **`DLV`** requires the space of possible
+solutions to be finite. This is done by invoking **`DLV`** with the
+option `-N`. (For a full description of **`DLV`** usage, refer to the
+[**`DLV`** manual](http://www.dlvsystem.com/man/).) For example,
+invoking **`DLV`** with
+
+> dl -N=100 fibonacci.dl
+
+results in the model
+
+> {true, fibonacci(1,1), fibonacci(1,2), fibonacci(2,3), fibonacci(3,4),
+> fibonacci(5,5), fibonacci(8,6), fibonacci(13,7), fibonacci(21,8),
+> fibonacci(34,9), fibonacci(55,10), fibonacci(89,11)}
+
+These are all the Fibonacci numbers not greater than 100.
+
+[Download example
+program.](http://www.dlvsystem.com/tutorial/examples/fibonacci.dl)
+
+
+
+{width="84"
+height="120"}\
+Click
+[here](http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/fib.html)
+for some interesting material on Fibonacci numbers.
+
+------------------------------------------------------------------------
+
+### The 8-Queens Example: Guess&Check Programming with Integers
+
+The 8 queens problem asks for a solution in which 8 queens are placed on
+a 8 x 8 chess board without threatening eachother. A queen threatens
+another if it is in the same row, column, or on a diagonal.
+
+> % guess horizontal position for each row
+> q(X,1) v q(X,2) v q(X,3) v q(X,4) v q(X,5) v q(X,6) v q(X, 7) v q(X,8) :- #int(X), X > 0.
+>
+> % check
+>
+> % assert that each column may only contain (at most) one queen
+> :- q(X1,Y), q(X2,Y), X1 <> X2.
+>
+> % assert that no two queens are in a diagonal from top left to bottom right
+> :- q(X1,Y1), q(X2,Y2), X2=X1+N, Y2=Y1+N, N > 0.
+>
+> % assert that no two queens are in a diagonal from top right to bottom left
+> :- q(X1,Y1), q(X2,Y2), X2=X1+N, Y1=Y2+N, N > 0.
+
+To run this program with **`DLV`**, type the following:
+
+> dl -n=1 -N=8 8queens.dl
+
+This will return a result like
+
+> {q(1,3), q(2,7), q(3,2), q(4,8), q(5,5), q(6,1), q(7,4), q(8,6)}
+
+To get all 92 correct solutions, type
+
+> dl -N=8 8queens.dl
+
+[Download example
+program.](http://www.dlvsystem.com/tutorial/examples/8queens.dl)
+
+------------------------------------------------------------------------
+
+### A simple Physics Diagnosis example
+
+We will now show how to use **`DLV`** to do diagnosis. We choose a
+physics application domain, a simplified version of ECAL
+pre-calibration. \
+As shown in the picture, a test beam is directed onto a scintillating
+crystal whose light emission is measured by an avalanche photodiode
+(APD). The measurement is then read with some readout electronics.
+Alternatively to the beam reading, the APD can receive a test pulse
+signal, which allows to check the correct functioning of the APD
+independently from the crystal. The following program allows to
+automatically diagnose malfunctioning parts:
+
+> ok(testpulse_reading).
+> ok(beam_reading).
+>
+> good(crystal) v bad(crystal).
+> good(apd) v bad(apd).
+>
+> :- good(X), bad(X).
+>
+> good(crystal) :- ok(beam_reading).
+> good(apd) :- ok(beam_reading).
+> bad(apd) v bad(crystal) :- not ok(beam_reading).
+> good(apd) :- ok(testpulse_reading).
+> bad(apd) :- not ok(testpulse_reading).
+
+The program starts with two facts expressing our observations. Here,
+both the testpulse reading and the beam reading were found to be
+correct; below, we will evaluate the program with different
+observations. The following two rules tell the system that crystals and
+APDs are either working or broken. After this follows a constraint that
+assures that they cannot be both at the same time. Finally, there are
+five rules that are a collection of expert knowledge. They model the
+knowledge about the domain and show quite clearly why the test pulse is
+available as a separate input to the APDs: it allows to find out if the
+APD works correctly without having to make any assumptions about the
+crystal. If the reaout of the beam on the other hand were not correct,
+one could not be sure if the responsible part is the crystal or the APD.
+
+Here, the unique result is the model `{good(crystal), good(apd)}`.
+Suppose we exchange the two EDB facts (the first two lines of this
+program) to `ok(testpulse_reading).` then the result changes to
+`{good(apd), bad(crystal)}`. The whole set of different cases is shown
+in the following table:
+
+ ---------------------------------------------- ---------------------------------------------------------
+ **EDB** **Model(s)**
+ `{ok(testpulse_reading). ok(beam_reading).}` `{good(crystal), good(apd)}`
+ `{ok(testpulse_reading).}` `{good(apd), bad(crystal)}`
+ `{ok(beam_reading).}` no model
+ `{}` `{bad(apd), good(crystal)}, {bad(apd), bad(crystal)} `
+ ---------------------------------------------- ---------------------------------------------------------
+
+The case that the facts base is `{ok(beam_reading).}` is also
+interesting: According to our program, if `ok(beam_reading)` is true,
+`ok(testpulse_reading)` also has to be true. Therefore, there is no
+consistent model in this case. In other words, according to our program,
+such observations cannot be made.
+
+------------------------------------------------------------------------
+
+### A different way to implement the Physics Diagnosis example
+
+The way to do diagnosis that was presented in the previous section has
+two drawbacks: It requires that more knowledge than necessary has to be
+coded in the program, and resulting from this, the program does not
+really do anything original. Also, it it hard to extend. Here, we show a
+different (better) way to do diagnosis in the same application domain.
+We represent the system as a graph of its units:
+
+> connected(beam, crystal).
+> connected(crystal, apd).
+> connected(testpulse_injector, apd).
+> connected(apd, readout).
+>
+> good_path(X,Y) :- not bad(X), not bad(Y), connected(X, Y).
+> good_path(X,Z) :- good_path(X,Y), good_path(Y, Z).
+>
+> bad(crystal) v bad(apd).
+>
+> testpulse_readout_ok :- good_path(testpulse_injector, readout).
+> beam_readout_ok :- good_path(beam, readout).
+
+In this example program, we have left away all the possible
+observations, which we implement as constraints, as shown in the
+following table:
+
+ ----------------------------------------------------------- ------------------------------------------------------
+ **Observations (Constraints)** **Model(s) (good_path predicates omitted)**
+ `{}` ` {bad(crystal), testpulse_readout_ok}, {bad(apd)}`
+ `{:- testpulse_readout_ok.}` `{bad(apd)}`
+ `{:- beam_readout_ok.}` ` {bad(crystal), testpulse_readout_ok}, {bad(apd)}`
+ `{:- beam_readout_ok. :- testpulse_readout_ok.}` `{bad(apd)}`
+ `{:- not testpulse_readout_ok.}` ` {bad(crystal), testpulse_readout_ok}`
+ `{:- not beam_readout_ok.}` no model
+ `{:- not beam_readout_ok. :- not testpulse_readout_ok.}` no model
+ ----------------------------------------------------------- ------------------------------------------------------
+
+[Download example
+program.](http://www.dlvsystem.com/tutorial/examples/diagnosis.dl)
+
+------------------------------------------------------------------------
+
+### The Monkey&Banana Example: Planning
+
+The following example shall give an idea of how **`DLV`** can be used to
+do planning.
+
+Please note that there is a `DLV` planning frontend that uses a
+convenient special-purpose planning language and which is not described
+in this tutorial. Instead, we use plain disjunctive datalog for solving
+planning problems here. If you are interested in this frontend, please
+refer to the [**`DLV`** homepage](http://www.dlvsystem.com) for further
+information.
+
+Consider the following classic planning problem. A monkey is in a room
+with a chair and a banana which is fixed to the ceiling. The monkey
+cannot reach the banana unless it stands on the chair; it is simply too
+high up. The chair is now at a position different from the place where
+the banana is hung up, and the monkey itself initially is at again a
+different place.
+
+Since the program is quite long compared to the earlier examples, it
+will be explained step by step.
+
+> walk(Time) v move_chair(Time) v ascend(Time) v idle(Time) :- #int(Time).
+
+At each discrete point in time, the monkey performs one of the following
+for actions: it walks, it moves the chair (while doing this, it also
+moves through the room), it climbs up the chair, or it does nothing.
+#int is again a built-in predicate which is true exactly if its argument
+is an integer value.
+
+> monkey_motion(T) :- walk(T).
+> monkey_motion(T) :- move_chair(T).
+>
+> stands_on_chair(T2) :- ascend(T), T2 = T + 1.
+> :- stands_on_chair(T), ascend(T).
+> :- stands_on_chair(T), monkey_motion(T).
+> stands_on_chair(T2) :- stands_on_chair(T), T2 = T + 1.
+
+After climbing up the chair, it is on it. If is is already on it, it
+cannot climb up any further. While on the chair, it cannot walk around.
+If it was on the chair earlier, it will be there in the future.
+
+> chair_at_place(X, T2) :- chair_at_place(X, T1), T2 = T1 + 1, not move_chair(T1).
+> chair_at_place(Pos, T2) :- move_chair(T1), T2 = T1 + 1,
+> monkey_at_place(Pos, T2).
+
+If the chair is not moved, it will stay at the same place. If the monkey
+moves the chair, it changes its position.
+
+> monkey_at_place(monkey_starting_point, T) v
+> monkey_at_place(chair_starting_point, T) v
+> monkey_at_place(below_banana, T) :- #int(T).
+
+The monkey is somewhere in the room. (For simplicity, only three
+positions are possible.)
+
+> :- monkey_at_place(Pos1, T2), monkey_at_place(Pos2, T1),
+> T2 = T1 + 1, Pos1 != Pos2, not monkey_motion(T1).
+>
+> :- monkey_at_place(Pos, T2), monkey_at_place(Pos, T1), T2 = T1 + 1,
+> monkey_motion(T1).
+>
+> :- ascend(T), monkey_at_place(Pos1, T), chair_at_place(Pos2, T), Pos1 != Pos2.
+>
+> :- move_chair(T), monkey_at_place(Pos1, T), chair_at_place(Pos2, T),
+> Pos1 != Pos2.
+
+The monkey cannot change its position without moving. The monkey cannot
+stay at the same place if it moves. It cannot climb up the chair if it
+is somewhere else. It cannot move the chair if it is somewhere else.
+
+> monkey_at_place(monkey_starting_point, 0) :- true.
+> chair_at_place(chair_starting_point, 0) :- true.
+> true.
+
+Initially, the monkey and the chair are at different positions.
+
+> can_reach_banana :- stands_on_chair(T), chair_at_place(below_banana, T).
+> eats_banana :- can_reach_banana.
+> happy :- eats_banana.
+>
+> :- not happy.
+
+The monkey can only reach the banana if it stands on the chair and the
+chair is below the banana. If it can reach the banana, it will eat it,
+and this will make it happy. Our goal is to make the monkey happy.
+
+> step(N, walk, Destination) :- walk(N), monkey_at_place(Destination, N2),
+> N2 = N + 1.
+> step(N, move_chair, Destination) :- move_chair(N),
+> monkey_at_place(Destination, N2),
+> N2 = N + 1.
+> step(N, ascend, " ") :- ascend(N).
+
+The step rules collect all the things we can derive from the situation
+and build a consistent plan. (There is no step rule for the action idle
+since we are not interested in it.)
+
+This program again uses integer arithmetics; to find a plan, the maximum
+integer variable has to be set to at least 3:
+
+> dl -N=3 banana.dl
+
+This results in the following model (If N is set to a value greater than
+3, **`DLV`** will find other plans that make the monkey happy.)
+
+> {chair_at_place(chair_starting_point,0),
+> monkey_at_place(monkey_starting_point,0),
+> monkey_at_place(chair_starting_point,1),
+> monkey_at_place(below_banana,2),
+> monkey_at_place(below_banana,3),
+> walk(0), move_chair(1), ascend(2), idle(3),
+> chair_at_place(chair_starting_point,1),
+> chair_at_place(below_banana,2),
+> chair_at_place(below_banana,3),
+> monkey_motion(0), monkey_motion(1),
+> step(0,walk,chair_starting_point),
+> step(1,move_chair,below_banana),
+> step(2,ascend," "),
+> stands_on_chair(3), can_reach_banana, eats_banana, happy}
+
+[Download example
+program.](http://www.dlvsystem.com/tutorial/examples/banana.dl)
+
+------------------------------------------------------------------------
diff --git a/biblio/Special Issue on Answer Set Programming-Abstract.pdf b/biblio/Special Issue on Answer Set Programming-Abstract.pdf
new file mode 100644
index 0000000..b3bc652
--- /dev/null
+++ b/biblio/Special Issue on Answer Set Programming-Abstract.pdf
@@ -0,0 +1,3631 @@
+%PDF-1.4
%
+37 0 obj
<>
endobj
+xref
+37 752
+0000000016 00000 n
+0000016343 00000 n
+0000016541 00000 n
+0000016575 00000 n
+0000026030 00000 n
+0000026055 00000 n
+0000026212 00000 n
+0000026360 00000 n
+0000027561 00000 n
+0000028755 00000 n
+0000029955 00000 n
+0000030739 00000 n
+0000030846 00000 n
+0000030955 00000 n
+0000031229 00000 n
+0000031837 00000 n
+0000031934 00000 n
+0000032526 00000 n
+0000033228 00000 n
+0000046162 00000 n
+0000057464 00000 n
+0000068055 00000 n
+0000076415 00000 n
+0000083842 00000 n
+0000091290 00000 n
+0000091435 00000 n
+0000098386 00000 n
+0000106230 00000 n
+0000153523 00000 n
+0000161087 00000 n
+0000161156 00000 n
+0000161240 00000 n
+0000164725 00000 n
+0000164987 00000 n
+0000165161 00000 n
+0000165186 00000 n
+0000165598 00000 n
+0000165686 00000 n
+0000221165 00000 n
+0000221432 00000 n
+0000221989 00000 n
+0000269949 00000 n
+0000270238 00000 n
+0000270755 00000 n
+0000271711 00000 n
+0000271748 00000 n
+0000272433 00000 n
+0000272614 00000 n
+0000272908 00000 n
+0000273084 00000 n
+0000273702 00000 n
+0000273883 00000 n
+0000274063 00000 n
+0000274668 00000 n
+0000274849 00000 n
+0000275459 00000 n
+0000275639 00000 n
+0000275820 00000 n
+0000276001 00000 n
+0000276182 00000 n
+0000276362 00000 n
+0000276543 00000 n
+0000276722 00000 n
+0000276903 00000 n
+0000277085 00000 n
+0000277266 00000 n
+0000277448 00000 n
+0000277629 00000 n
+0000277811 00000 n
+0000277993 00000 n
+0000278175 00000 n
+0000278357 00000 n
+0000278539 00000 n
+0000278720 00000 n
+0000278901 00000 n
+0000279082 00000 n
+0000279262 00000 n
+0000279442 00000 n
+0000279624 00000 n
+0000279806 00000 n
+0000279988 00000 n
+0000280169 00000 n
+0000280351 00000 n
+0000280533 00000 n
+0000280714 00000 n
+0000280895 00000 n
+0000281075 00000 n
+0000281256 00000 n
+0000281438 00000 n
+0000281619 00000 n
+0000281801 00000 n
+0000281982 00000 n
+0000282164 00000 n
+0000282346 00000 n
+0000282527 00000 n
+0000282708 00000 n
+0000282890 00000 n
+0000283072 00000 n
+0000283252 00000 n
+0000283433 00000 n
+0000283616 00000 n
+0000283798 00000 n
+0000283982 00000 n
+0000284166 00000 n
+0000284349 00000 n
+0000284534 00000 n
+0000284718 00000 n
+0000285323 00000 n
+0000285507 00000 n
+0000285689 00000 n
+0000286274 00000 n
+0000286457 00000 n
+0000287051 00000 n
+0000287235 00000 n
+0000287809 00000 n
+0000287992 00000 n
+0000288177 00000 n
+0000288361 00000 n
+0000288543 00000 n
+0000288727 00000 n
+0000288909 00000 n
+0000289093 00000 n
+0000289277 00000 n
+0000289459 00000 n
+0000289643 00000 n
+0000289827 00000 n
+0000290010 00000 n
+0000290194 00000 n
+0000290376 00000 n
+0000290559 00000 n
+0000290743 00000 n
+0000290927 00000 n
+0000291111 00000 n
+0000291295 00000 n
+0000291477 00000 n
+0000291660 00000 n
+0000291842 00000 n
+0000292024 00000 n
+0000292207 00000 n
+0000292391 00000 n
+0000292575 00000 n
+0000292759 00000 n
+0000292941 00000 n
+0000293125 00000 n
+0000293309 00000 n
+0000293491 00000 n
+0000293674 00000 n
+0000293856 00000 n
+0000294039 00000 n
+0000294222 00000 n
+0000294405 00000 n
+0000294589 00000 n
+0000294772 00000 n
+0000294956 00000 n
+0000295140 00000 n
+0000295324 00000 n
+0000295506 00000 n
+0000295690 00000 n
+0000295874 00000 n
+0000296058 00000 n
+0000296242 00000 n
+0000296426 00000 n
+0000296610 00000 n
+0000296794 00000 n
+0000296977 00000 n
+0000297159 00000 n
+0000297342 00000 n
+0000297969 00000 n
+0000298153 00000 n
+0000298334 00000 n
+0000298515 00000 n
+0000298699 00000 n
+0000298881 00000 n
+0000299064 00000 n
+0000299247 00000 n
+0000299431 00000 n
+0000299613 00000 n
+0000299797 00000 n
+0000299980 00000 n
+0000300163 00000 n
+0000300345 00000 n
+0000300529 00000 n
+0000300712 00000 n
+0000300896 00000 n
+0000301077 00000 n
+0000301261 00000 n
+0000301445 00000 n
+0000301628 00000 n
+0000301811 00000 n
+0000301995 00000 n
+0000302178 00000 n
+0000302359 00000 n
+0000302542 00000 n
+0000302725 00000 n
+0000302907 00000 n
+0000303089 00000 n
+0000303273 00000 n
+0000303455 00000 n
+0000303639 00000 n
+0000303823 00000 n
+0000304007 00000 n
+0000304190 00000 n
+0000304372 00000 n
+0000304556 00000 n
+0000304740 00000 n
+0000305332 00000 n
+0000305514 00000 n
+0000306091 00000 n
+0000306273 00000 n
+0000306851 00000 n
+0000307033 00000 n
+0000307215 00000 n
+0000307785 00000 n
+0000307967 00000 n
+0000308149 00000 n
+0000308331 00000 n
+0000308513 00000 n
+0000308695 00000 n
+0000308876 00000 n
+0000309058 00000 n
+0000309238 00000 n
+0000309419 00000 n
+0000309600 00000 n
+0000309781 00000 n
+0000309963 00000 n
+0000310145 00000 n
+0000310326 00000 n
+0000310507 00000 n
+0000310689 00000 n
+0000310871 00000 n
+0000311052 00000 n
+0000311234 00000 n
+0000311414 00000 n
+0000311596 00000 n
+0000311777 00000 n
+0000311958 00000 n
+0000312140 00000 n
+0000312320 00000 n
+0000312500 00000 n
+0000312681 00000 n
+0000312862 00000 n
+0000313044 00000 n
+0000313226 00000 n
+0000313408 00000 n
+0000313590 00000 n
+0000313772 00000 n
+0000313954 00000 n
+0000314136 00000 n
+0000314318 00000 n
+0000314500 00000 n
+0000314682 00000 n
+0000314864 00000 n
+0000315046 00000 n
+0000315226 00000 n
+0000315406 00000 n
+0000315588 00000 n
+0000315770 00000 n
+0000315951 00000 n
+0000316133 00000 n
+0000316314 00000 n
+0000316495 00000 n
+0000316677 00000 n
+0000316857 00000 n
+0000317039 00000 n
+0000317221 00000 n
+0000317403 00000 n
+0000317585 00000 n
+0000317767 00000 n
+0000317948 00000 n
+0000318128 00000 n
+0000318310 00000 n
+0000318491 00000 n
+0000318673 00000 n
+0000318855 00000 n
+0000319036 00000 n
+0000319217 00000 n
+0000319399 00000 n
+0000319580 00000 n
+0000319762 00000 n
+0000319944 00000 n
+0000320126 00000 n
+0000320307 00000 n
+0000320489 00000 n
+0000320671 00000 n
+0000320853 00000 n
+0000321035 00000 n
+0000321216 00000 n
+0000321398 00000 n
+0000321579 00000 n
+0000321761 00000 n
+0000321943 00000 n
+0000322125 00000 n
+0000322306 00000 n
+0000322485 00000 n
+0000322666 00000 n
+0000322848 00000 n
+0000323029 00000 n
+0000323211 00000 n
+0000323392 00000 n
+0000323574 00000 n
+0000324127 00000 n
+0000324311 00000 n
+0000324853 00000 n
+0000325036 00000 n
+0000325586 00000 n
+0000325770 00000 n
+0000326306 00000 n
+0000326489 00000 n
+0000326674 00000 n
+0000327217 00000 n
+0000327401 00000 n
+0000327583 00000 n
+0000328108 00000 n
+0000328291 00000 n
+0000328817 00000 n
+0000329001 00000 n
+0000329529 00000 n
+0000329712 00000 n
+0000329897 00000 n
+0000330081 00000 n
+0000330265 00000 n
+0000330447 00000 n
+0000330630 00000 n
+0000330814 00000 n
+0000330998 00000 n
+0000331179 00000 n
+0000331362 00000 n
+0000331546 00000 n
+0000331728 00000 n
+0000331912 00000 n
+0000332095 00000 n
+0000332277 00000 n
+0000332460 00000 n
+0000332643 00000 n
+0000332826 00000 n
+0000333010 00000 n
+0000333192 00000 n
+0000333375 00000 n
+0000333558 00000 n
+0000333740 00000 n
+0000333923 00000 n
+0000334107 00000 n
+0000334291 00000 n
+0000334475 00000 n
+0000334659 00000 n
+0000334843 00000 n
+0000335027 00000 n
+0000335209 00000 n
+0000335391 00000 n
+0000335575 00000 n
+0000335759 00000 n
+0000335943 00000 n
+0000336126 00000 n
+0000336310 00000 n
+0000336493 00000 n
+0000336676 00000 n
+0000336857 00000 n
+0000337041 00000 n
+0000337223 00000 n
+0000337407 00000 n
+0000337590 00000 n
+0000337773 00000 n
+0000337955 00000 n
+0000338138 00000 n
+0000338322 00000 n
+0000338504 00000 n
+0000338688 00000 n
+0000338871 00000 n
+0000339054 00000 n
+0000339235 00000 n
+0000339419 00000 n
+0000339602 00000 n
+0000339785 00000 n
+0000339969 00000 n
+0000340153 00000 n
+0000340335 00000 n
+0000340518 00000 n
+0000340702 00000 n
+0000340886 00000 n
+0000341069 00000 n
+0000341249 00000 n
+0000341431 00000 n
+0000341614 00000 n
+0000341797 00000 n
+0000341980 00000 n
+0000342163 00000 n
+0000342346 00000 n
+0000342528 00000 n
+0000342711 00000 n
+0000342895 00000 n
+0000343077 00000 n
+0000343259 00000 n
+0000343442 00000 n
+0000343624 00000 n
+0000343808 00000 n
+0000343992 00000 n
+0000344176 00000 n
+0000344360 00000 n
+0000344544 00000 n
+0000344728 00000 n
+0000344912 00000 n
+0000345096 00000 n
+0000345278 00000 n
+0000345460 00000 n
+0000345644 00000 n
+0000345828 00000 n
+0000346012 00000 n
+0000346196 00000 n
+0000346379 00000 n
+0000346562 00000 n
+0000346745 00000 n
+0000346928 00000 n
+0000347111 00000 n
+0000347294 00000 n
+0000347475 00000 n
+0000347659 00000 n
+0000347841 00000 n
+0000348023 00000 n
+0000348205 00000 n
+0000348389 00000 n
+0000348572 00000 n
+0000348754 00000 n
+0000348936 00000 n
+0000349120 00000 n
+0000349303 00000 n
+0000349484 00000 n
+0000349667 00000 n
+0000349849 00000 n
+0000350033 00000 n
+0000350217 00000 n
+0000350401 00000 n
+0000350585 00000 n
+0000350768 00000 n
+0000350952 00000 n
+0000351136 00000 n
+0000351320 00000 n
+0000351499 00000 n
+0000351682 00000 n
+0000351865 00000 n
+0000352049 00000 n
+0000352231 00000 n
+0000352415 00000 n
+0000352598 00000 n
+0000352782 00000 n
+0000352965 00000 n
+0000353147 00000 n
+0000353329 00000 n
+0000353511 00000 n
+0000353694 00000 n
+0000353877 00000 n
+0000354061 00000 n
+0000354244 00000 n
+0000354428 00000 n
+0000354611 00000 n
+0000354794 00000 n
+0000354978 00000 n
+0000355161 00000 n
+0000355345 00000 n
+0000355526 00000 n
+0000355710 00000 n
+0000355894 00000 n
+0000356077 00000 n
+0000356260 00000 n
+0000356443 00000 n
+0000356627 00000 n
+0000356811 00000 n
+0000356993 00000 n
+0000357175 00000 n
+0000357359 00000 n
+0000357541 00000 n
+0000357724 00000 n
+0000357908 00000 n
+0000358092 00000 n
+0000358276 00000 n
+0000358460 00000 n
+0000358644 00000 n
+0000358827 00000 n
+0000359010 00000 n
+0000359193 00000 n
+0000359377 00000 n
+0000359558 00000 n
+0000359742 00000 n
+0000359925 00000 n
+0000360109 00000 n
+0000360291 00000 n
+0000360472 00000 n
+0000360654 00000 n
+0000360835 00000 n
+0000361018 00000 n
+0000361555 00000 n
+0000361737 00000 n
+0000362265 00000 n
+0000362445 00000 n
+0000362627 00000 n
+0000363160 00000 n
+0000363342 00000 n
+0000363867 00000 n
+0000364047 00000 n
+0000364230 00000 n
+0000364412 00000 n
+0000364594 00000 n
+0000364775 00000 n
+0000364956 00000 n
+0000365137 00000 n
+0000365319 00000 n
+0000365501 00000 n
+0000365683 00000 n
+0000365864 00000 n
+0000366046 00000 n
+0000366227 00000 n
+0000366409 00000 n
+0000366590 00000 n
+0000366772 00000 n
+0000366952 00000 n
+0000367133 00000 n
+0000367315 00000 n
+0000367497 00000 n
+0000367679 00000 n
+0000367860 00000 n
+0000368042 00000 n
+0000368223 00000 n
+0000368404 00000 n
+0000368586 00000 n
+0000368768 00000 n
+0000368950 00000 n
+0000369132 00000 n
+0000369314 00000 n
+0000369496 00000 n
+0000369677 00000 n
+0000369859 00000 n
+0000370041 00000 n
+0000370222 00000 n
+0000370404 00000 n
+0000370585 00000 n
+0000370767 00000 n
+0000370947 00000 n
+0000371129 00000 n
+0000371309 00000 n
+0000371491 00000 n
+0000371673 00000 n
+0000371855 00000 n
+0000372036 00000 n
+0000372218 00000 n
+0000372398 00000 n
+0000372580 00000 n
+0000372762 00000 n
+0000372944 00000 n
+0000373126 00000 n
+0000373308 00000 n
+0000373490 00000 n
+0000373672 00000 n
+0000373854 00000 n
+0000374036 00000 n
+0000374218 00000 n
+0000374400 00000 n
+0000374582 00000 n
+0000374763 00000 n
+0000374944 00000 n
+0000375126 00000 n
+0000375308 00000 n
+0000375489 00000 n
+0000375670 00000 n
+0000375851 00000 n
+0000376032 00000 n
+0000376214 00000 n
+0000376396 00000 n
+0000376578 00000 n
+0000376760 00000 n
+0000376942 00000 n
+0000377124 00000 n
+0000377306 00000 n
+0000377488 00000 n
+0000377670 00000 n
+0000377852 00000 n
+0000378034 00000 n
+0000378216 00000 n
+0000378398 00000 n
+0000378580 00000 n
+0000378762 00000 n
+0000378943 00000 n
+0000379125 00000 n
+0000379307 00000 n
+0000379489 00000 n
+0000379671 00000 n
+0000379853 00000 n
+0000380035 00000 n
+0000380217 00000 n
+0000380399 00000 n
+0000380581 00000 n
+0000380763 00000 n
+0000380945 00000 n
+0000381127 00000 n
+0000381309 00000 n
+0000381489 00000 n
+0000381671 00000 n
+0000381853 00000 n
+0000382033 00000 n
+0000382215 00000 n
+0000382396 00000 n
+0000382578 00000 n
+0000382759 00000 n
+0000382940 00000 n
+0000383120 00000 n
+0000383302 00000 n
+0000383483 00000 n
+0000383664 00000 n
+0000383845 00000 n
+0000384025 00000 n
+0000384207 00000 n
+0000384389 00000 n
+0000384571 00000 n
+0000384752 00000 n
+0000384932 00000 n
+0000385114 00000 n
+0000385296 00000 n
+0000385478 00000 n
+0000385660 00000 n
+0000385842 00000 n
+0000386023 00000 n
+0000386204 00000 n
+0000386385 00000 n
+0000386565 00000 n
+0000386745 00000 n
+0000386926 00000 n
+0000387107 00000 n
+0000387288 00000 n
+0000387470 00000 n
+0000387651 00000 n
+0000387833 00000 n
+0000388014 00000 n
+0000388196 00000 n
+0000388378 00000 n
+0000388560 00000 n
+0000388741 00000 n
+0000388922 00000 n
+0000389102 00000 n
+0000389283 00000 n
+0000389464 00000 n
+0000389645 00000 n
+0000389826 00000 n
+0000390008 00000 n
+0000390190 00000 n
+0000390372 00000 n
+0000390553 00000 n
+0000390735 00000 n
+0000390917 00000 n
+0000391099 00000 n
+0000391281 00000 n
+0000391461 00000 n
+0000391643 00000 n
+0000391824 00000 n
+0000392006 00000 n
+0000392188 00000 n
+0000392369 00000 n
+0000392551 00000 n
+0000392733 00000 n
+0000392915 00000 n
+0000393096 00000 n
+0000393278 00000 n
+0000393460 00000 n
+0000393642 00000 n
+0000393823 00000 n
+0000394005 00000 n
+0000394186 00000 n
+0000394368 00000 n
+0000394550 00000 n
+0000394732 00000 n
+0000394914 00000 n
+0000395095 00000 n
+0000395277 00000 n
+0000395459 00000 n
+0000395641 00000 n
+0000395823 00000 n
+0000396005 00000 n
+0000396187 00000 n
+0000396369 00000 n
+0000396551 00000 n
+0000396733 00000 n
+0000396915 00000 n
+0000397097 00000 n
+0000397278 00000 n
+0000397460 00000 n
+0000397642 00000 n
+0000397824 00000 n
+0000398006 00000 n
+0000398188 00000 n
+0000398369 00000 n
+0000398550 00000 n
+0000398732 00000 n
+0000398914 00000 n
+0000399096 00000 n
+0000399278 00000 n
+0000399460 00000 n
+0000399642 00000 n
+0000399823 00000 n
+0000400005 00000 n
+0000400186 00000 n
+0000400368 00000 n
+0000400550 00000 n
+0000400732 00000 n
+0000400914 00000 n
+0000401095 00000 n
+0000401277 00000 n
+0000402924 00000 n
+0000403207 00000 n
+0000403703 00000 n
+0000404914 00000 n
+0000408341 00000 n
+0000408602 00000 n
+0000409020 00000 n
+0000410466 00000 n
+0000410872 00000 n
+0000411150 00000 n
+0000411593 00000 n
+0000411643 00000 n
+0000415018 00000 n
+0000415430 00000 n
+0000415480 00000 n
+0000416002 00000 n
+0000416220 00000 n
+0000416447 00000 n
+0000416674 00000 n
+0000416886 00000 n
+0000417122 00000 n
+0000417358 00000 n
+0000417576 00000 n
+0000417803 00000 n
+0000418030 00000 n
+0000418248 00000 n
+0000418508 00000 n
+0000418557 00000 n
+0000418978 00000 n
+0000419196 00000 n
+0000419414 00000 n
+0000419632 00000 n
+0000420753 00000 n
+0000421311 00000 n
+0000421361 00000 n
+0000422049 00000 n
+0000423473 00000 n
+0000424226 00000 n
+0000424276 00000 n
+0000425016 00000 n
+0000425235 00000 n
+0000425284 00000 n
+0000425583 00000 n
+0000426533 00000 n
+0000426760 00000 n
+0000426884 00000 n
+0000426955 00000 n
+0000427102 00000 n
+0000015336 00000 n
+trailer
+<<815A9FDA6798374891628AEDE8067D2F>]/Prev 750630>>
+startxref
+0
+%%EOF
+
+788 0 obj
<>stream
+hTAhTGfMMjly"9^â{BVAZd_(x#xJ}GQAf7ykۓ??? o &$cd%{OėXΑbZnk^|yiu?`bԆ+9r
k4}솈En,|,[gM2pGfK0!==!_+`=]Ϲ.uSŀ5fu0Ϗ#"fp
+BTC*KSN,
+HQ31PK-:I ^%ECg|#Ξa Zz9*#t]EKbgOK%Ԇ>NM=h!stvph1_GTԶ5uO&KM#u媤:.K;