Photography-based taxonomy is inadequate, unnecessary, and potentially harmful for biological sciences

The question whether taxonomic descriptions naming new animal species without type specimen(s) deposited in collections should be accepted for publication by scientific journals and allowed by the Code has already been discussed in Zootaxa (Dubois & Nemésio 2007; Donegan 2008, 2009; Nemésio 2009a–b; Dubois 2009; Gentile & Snell 2009; Minelli 2009; Cianferoni & Bartolozzi 2016; Amorim et al. 2016). This question was again raised in a letter supported by 35 signatories published in the journal Nature (Pape et al. 2016) on 15 September 2016. On 25 September 2016, the following rebuttal (strictly limited to 300 words as per the editorial rules of Nature) was submitted to Nature, which on 18 October 2016 refused to publish it. As we think this problem is a very important one for zoological taxonomy, this text is published here exactly as submitted to Nature, followed by the list of the 493 taxonomists and collection-based researchers who signed it in the short time span from 20 September to 6 October 2016

A Query Tool for EL with Non-monotonic Rules

We would like to thank Miguel Calejo for his help with InterProlog, Pavel Klinov for his help with ELK, Terry Swift for his help with XSB, and Gonca Gullu for her collaboration. Vadim Ivanov was partially supported by a MULTIC – Erasmus Mundus Action 2 grant. Matthias Knorr and Joao Leite were partially supported by FCT funded project ERRO – Efficient Reasoning with Rules and Ontologies (PTDC/EIA-CCO/121823/2010) and Matthias Knorr also by FCT grant SFRH/BPD/86970/2012.We present the Protégé plug-in NoHR that allows the user to take anEL+⊤ontology, add a set of non-monotonic (logic programming) rules – suitable e.g. to express defaults and exceptions – and query the combined knowledge base. Our approach uses the well-founded semantics for MKNF knowledge bases as underlying formalism, so no restriction other than DL-safety is imposed on the rules that can be written. The tool itself builds on the procedureSLG(O)and, with the help of OWL 2 EL reasoner ELK, pre-processes the ontology into rules, whose result together with the non-monotonic rules serve as input for the top-down querying engine XSB Prolog. With the resulting plug-in, even queries to very large ontologies, such as SNOMED CT, augmented with a large number of rules, can be processed at an interactive response time after one initial brief pre-processing period. At the same time, our system is able to deal with possible inconsistencies between the rules and an ontology that alone is consistent.authorsversionpublishe

Mestre em Engenharia Informática.

to my parents ii Acknowledgments First of all I would like to thank my supervisor Prof. Dr. Luís Moniz Pereira for his great help and experience. He was present at all times, encouraging me when I needed most. Without him, we would still not be able to update programs. Iwould also like to thank Dr. José Julio Alferes for his very pertinent comments and all his help. I'm also very grateful to Professor Teodor Przymusinski and Professor Halina Przy-musinska for all their ideas and help. Vitor: thanks for helping with the meta-interpreter and always putting up with me. For proof reading parts of this dissertation I would like to thank Dr. Joaquim Aparício. I would like to acknowledge the Departamento de Informática for the working con-ditions provided. A special word of gratitude goes to the Secretarial sta for being so friendly and e cient

Dynamic Logic Programming

In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads.We start by introducing the notion of an update P U of a logic program P by another logic program U. Subsequently, we provide a precise semantic characterization of P U, and study some basic properties of program updates. In particular, we show that our update programs generalize the notion of interpretation update. We then extend this notion to compositional sequences of logic programs updates P1P2 ::: , dening a dynamic program update, and thereby introducing the paradigm of dynamic logic programming. This paradigm significantly facilitates modularization of logic programming, and thus modularization of nonmonotonic reasoning as a whole. Specically, suppose that we are given a set of logic program modules, each describing a dierent state of our knowledge of the world. Dierent states may represent dierent time points or dierent sets of priorities or perhaps even dierent viewpoints. Consequently, program modules may contain mutually contradictory as well as overlapping information. The role of the dynamic program update is to employ the mutual relationships existing between dierent modules to precisely determine, at any given module composition stage, the declarative as well as the procedural semantics of the combined program resulting from the modules.authorsversionpublishe

Realisation of Stepping for Real-World ASP Languages

perpétuo e sem limites geográficos, de arquivar e publicar esta dissertação através de exemplares impressos reproduzidos em papel ou de forma digital, ou por qualquer outro meio conhecido ou que venha a ser inventado, e de a divulgar através de repositórios científicos e de admitir a sua cópia e distribuição com objectivos educacionais ou de investigação, não comerciais, desde que seja dado crédito ao autor e editor. ivFor MelisviAcknowledgements I would like to thank my supervisor for having a lot of patience with me, the team at TUW for having this wonderful idea, Melis and Ingo for support, and my family, this would not be possible without them. Stepping is folklore in debugging of procedural programming languages that allows developers to focus their attention to each statement of their program one after the other. Recent results in the field of answer-set programming (ASP) debugging brought forth a formalism for stepping through answer-set programs. The main idea is to monotonically build up an interpretation by, at each step, adding literals derived by a rule that is active under the partial interpretation obtained in the previous step. As the stepping framewor

Brazilian recommendations of mechanical ventilation 2013. Part 2

O suporte ventilatório artificial invasivo e não invasivo ao paciente crítico tem evoluído e inúmeras evidências têm surgido, podendo ter impacto na melhora da sobrevida e da qualidade do atendimento oferecido nas unidades de terapia intensiva no Brasil. Isto posto, a Associação de Medicina Intensiva Brasileira (AMIB) e a Sociedade Brasileira de Pneumologia e Tisiologia (SBPT) - representadas pelo seus Comitê de Ventilação Mecânica e Comissão de Terapia Intensiva, respectivamente, decidiram revisar a literatura e preparar recomendações sobre ventilação mecânica objetivando oferecer aos associados um documento orientador das melhores práticas da ventilação mecânica na beira do leito, baseado nas evidencias existentes, sobre os 29 subtemas selecionados como mais relevantes no assunto. O projeto envolveu etapas visando distribuir os subtemas relevantes ao assunto entre experts indicados por ambas as sociedades que tivessem publicações recentes no assunto e/ou atividades relevantes em ensino e pesquisa no Brasil na área de ventilação mecânica. Esses profissionais, divididos por subtemas em duplas, responsabilizaram-se por fazer revisão extensa da literatura mundial sobre cada subtema. Reuniram-se todos no Forum de Ventilação Mecânica na sede da AMIB em São Paulo, em 03 e 04 de agosto de 2013 para finalização conjunta do texto de cada subtema e apresentação, apreciação, discussão e aprovação em plenária pelos 58 participantes, permitindo a elaboração de um documento final

Seminário de Dissertação (2024)

Página da disciplina de Seminário de Dissertação (MPPP, UFPE, 2022) Lista de participantes == https://docs.google.com/spreadsheets/d/1mrULe1y04yPxHUBaF50jhaM1OY8QYJ3zva4N4yvm198/edit#gid=