34 research outputs found

    Program specification and data refinement in type theory

    Full text link

    Discovering Classes of Strongly Equivalent Logic Programs

    Full text link
    In this paper we apply computer-aided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that preserve strong equivalence. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a rule and the empty set, between two rules, between two rules and one of the two rules, between two rules and another rule, and between three rules and two of the three rules

    Temporal Answer Set Programming

    Get PDF
    [Abstract] Commonsense temporal reasoning is full of situations that require drawing default conclusions, since we rarely have all the information available. Unfortunately, most modal temporal logics cannot accommodate default reasoning, since they typically deal with a monotonic inference relation. On the other hand, non-monotonic approaches are very expensive and their treatment of time is not so well delimited and studied as in modal logic. Temporal Equilibrium Logic (TEL) is the first non-monotonic temporal logic which fully covers the syntax of some standard modal temporal approach without requiring further constructions. TEL shares the syntax of Linear-time Temporal Logic (LTL) (first proposed by Arthur Prior and later extended by Hans Kamp) which has become one of the simplest, most used and best known temporal logics in Theoretical Computer Science. Although TEL had been already defined, few results were known about its fundamental properties and nothing at all on potential computational methods that could be applied for practical purposes. This situation unfavourably contrasted with the huge body of knowledge available for LTL, both in well-known formal properties and in computing methods with practical implementations. In this thesis we have mostly filled this gap, following a research program that has systematically analysed different essential properties of TEL and, simultaneously, built computational tools for its practical application. As an overall, this thesis collects a corpus of results that constitutes a significant breakthrough in the knowledge about TEL.[Resumen] El razonamiento temporal del sentido com煤n est谩 lleno de situaciones que requieren suponer conclusiones por defecto, puesto que raramente contamos con toda la informaci贸n disponible. Lamentablemente, la mayor铆a de l贸gicas modales temporales no permiten modelar este tipo de razonamiento por defecto debido a que, t铆picamente, se definen por medio de relaciones de inferencia mon贸tonas. Por el contrario, las aproximaciones no mon贸tonas existentes son t铆picamente muy costosas pero su manejo del tiempo no est谩 tan bien delimitado como en l贸gica modal. Temporal Equilibrium Logic (TEL) es la primera l贸gica temporal no mon贸tona que cubre totalmente la sintaxis de alguna de las l贸gicas modales tradicionales sin requerir el uso de m谩s construcciones. TEL comparte la sintaxis de Linear-time Temporal Logic (LTL) (formalismo propuesto por Arthur Prior y posteriormente extendido por Hans Kamp), que es una de las l贸gicas m谩s simples, utilizadas y mejor conocidas en Teor铆a de la Computaci贸n. Aunque TEL hab铆a sido definido, muy pocas propiedades eran conocidas, lo que contrastaba con el vasto conocimiento de LTL que est谩 presente en el estado del arte. En esta tesis hemos estudiado diferentes aspectos de TEL, una novedosa combinaci贸n de l贸gica modal temporal y un formalismo no mon贸tono. A grandes rasgos, esta tesis recoge un conjunto de resultados, tanto desde el punto de vista te贸rico como pr谩ctico, que constituye un gran avance en lo relativo al conocimiento sobre TEL.[Resumo] O razoamento do sentido com煤n aplicado ao caso temporal est谩 cheo de situaci贸ns que requiren supo帽er conclusi贸ns por defecto, posto que raramente contamos con toda a informaci贸n dispo帽ible. Lamentablemente a maior铆a de l贸xicas modais tempor谩is non permiten modelar este tipo de razoamento por defecto debido a que, t铆picamente, est谩n definidas por medio de relaci贸ns de inferencia mon贸tonas. Pola contra, as aproximaci贸ns non mon贸tonas existentes son moi costosos e o seu tratamento do tempo non est谩 ben tan delimitado nin estudiado como nas l贸xicas modais. Temporal Equilibrium Logic (TEL) 茅 a primeira aproximaci贸n non mon贸tona que cubre totalmente a sintaxe dalgunha das l贸xicas modais traidicion谩is sen requerir o uso de m谩is construcci贸ns. TEL comparte a sintaxe de Lineartime Temporal Logic (LTL) (formalismo proposto por Arthur Prior e extendido posteriormente por Hans Kamp), que 茅 considerada unha das l贸xicas modais m谩is simples, utilizadas e co帽ecidas dentro da Teor铆a da Computaci贸n. A铆nda que TEL xa fora definido previamente, moi poucas das s煤as propiedades eran co帽ecidas, dato que contrasta co vasto co帽ecemento de LTL existente no estado da arte. Nesta tese, estudiamos diferentes aspectos de TEL, unha novidosa combinaci贸n de l贸xica modal temporal e un formalimo non mon贸tono. A grandes rasgos, esta tese recolle un conxunto de resultados, tanto dende o punto de vista te贸rico como pr谩ctico, que constit煤e un gran avance no relativo 贸 co帽ecemento sobre o formalismo TEL

    Proceedings of the 11th Workshop on Nonmonotonic Reasoning

    Get PDF
    These are the proceedings of the 11th Nonmonotonic Reasoning Workshop. The aim of this series is to bring together active researchers in the broad area of nonmonotonic reasoning, including belief revision, reasoning about actions, planning, logic programming, argumentation, causality, probabilistic and possibilistic approaches to KR, and other related topics. As part of the program of the 11th workshop, we have assessed the status of the field and discussed issues such as: Significant recent achievements in the theory and automation of NMR; Critical short and long term goals for NMR; Emerging new research directions in NMR; Practical applications of NMR; Significance of NMR to knowledge representation and AI in general

    Beyond Logic. Proceedings of the Conference held in Cerisy-la-Salle, 22-27 May 2017

    Get PDF
    The project "Beyond Logic" is devoted to what hypothetical reasoning is all about when we go beyond the realm of "pure" logic into the world where logic is applied. As such extralogical areas we have chosen philosophy of science as an application within philosophy, informatics as an application within the formal sciences, and law as an application within the field of social interaction. The aim of the conference was to allow philosophers, logicians and computer scientists to present their work in connection with these three areas. The conference took place 22-27 May, 2017 in Cerisy-la-Salle at the Centre Culturel International de Cerisy. The proceedings collect abstracts, slides and papers of the presentations given, as well as a contribution from a speaker who was unable to attend

    Interpretability-oriented data-driven modelling of bladder cancer via computational intelligence

    Get PDF
    corecore