检索结果-内蒙古大学图书馆

Incremental Answer Set programming with Overgrounding

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Calimeri, Francesco Ianni, Giovambattista Pacenza, Francesco Perri, Simona Zangari, Jessica Department of Mathematics and Computer Science University of Calabria Italy

Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding approach for the answer set semantics. We focus on the possibility of generating incrementally larger ground logic programs equivalent to a given non-ground one;so called overgrounded programs can be reused in combination with deliberately many different sets of inputs. Updating overgrounded programs requires a small effort, thus making the instantiation of logic programs considerably faster when grounding is repeated on a series of inputs similar to each other. Notably, the proposed approach works "under the hood", relieving designers of logic programs from controlling technical aspects of grounding engines and answer set systems. In this work we present the theoretical basis of the proposed incremental grounding technique, we illustrate the consequent repeated evaluation strategy and report about our experiments. This paper is under consideration in Theory and Practice of logic programming (TPLP). Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

On-the-fly construction of composite events in scenario-based modeling using constraint solvers

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Katz, Guy Marron, Assaf Sadon, Aviran Weiss, Gera Hebrew University of Jerusalem Jerusalem Israel Weizmann Institute of Science Rehovot Israel Ben-Gurion University of the Negev Be'er Sheva Israel

Scenario-Based programming is a methodology for modeling and constructing complex reactive systems from simple, stand-alone building blocks, called scenarios. These scenarios are designed to model different traits of the system, and can be interwoven together and executed to produce cohesive system behavior. Existing execution frameworks for scenario-based programs allow scenarios to specify their view of what the system must, may, or must not do only through very strict interfaces. This limits the methodology's expressive power and often prevents users from modeling certain complex requirements. Here, we propose to extend ScenarioBased programming's execution mechanism to allow scenarios to specify how the system should behave using rich logical constraints. We then leverage modern constraint solvers (such as SAT or SMT solvers) to resolve these constraints at every step of running the system, towards yielding the desired overall system behavior. We provide an implementation of our approach and demonstrate its applicability to various systems that could not be easily modeled in an executable manner by existing Scenario-Based approaches. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

ASP-Core-2 input language format

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Calimeri, Francesco Faber, Wolfgang Gebser, Martin Ianni, Giovambattista Kaminski, Roland Krennwallner, Thomas Leone, Nicola Maratea, Marco Ricca, Francesco Schaub, Torsten DeMaCS Università della Calabria Italy Institut für Angewandte Informatik Alpen-Adria-Universität Klagenfurt Austria Institute of Computer Science University of Potsdam Germany XIMES GmbH Vienna Austria DIBRIS University of Genova Italy

Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications. In this document we present the ASP-Core-2 standard input language for Answer Set programming, which has been adopted in ASP Competition events since 2013. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Predicative Vagueness in Lung Metastases in Soft Tissue Sarcoma Screening 1

学校读者我要写书评

暂无评论

6th International Conference on Mining Intelligence and Knowledge Exploration (MIKE)

作者： Neves, Jose Dias, Almeida Morais, Ana Fonseca, Francisca Loreto, Patricia Alves, Victor Araujo, Isabel Machado, Joana Fernandes, Bruno Ribeiro, Jorge Analide, Cesar Ferraz, Filipa Neves, Joao Vicente, Henrique Univ Minho Ctr Algoritmi Braga Portugal Inst Univ Ciencias Saude CESPU Gandra Portugal Univ Minho Dept Informat Escola Engn Braga Portugal Farm Lamacaes Braga Portugal Inst Politecn Viana do Castelo ARC4DigiT Appl Res Ctr Digital Transformat Escola Super Tecnol & Gestao Viana Do Castelo Portugal Mediclin Arabian Ranches POB 282602 Dubai U Arab Emirates Univ Evora Ctr Quim Evora Dept Quim Escola Ciencias & Tecnol Evora Portugal

ISBN: (数字)9783030059187

ISBN: (纸本)9783030059187;9783030059170

Soft Tissue Sarcomas (STSs) pose a potential risk for the development of lung metastases, which in turn results in a negative prognosis for patients. Presumptions about the occurrence of these abnormalities during STSs treatment would have countless implications for both patients and healthcare professionals as they could increase the efficacy of the treatment and improve overall survival. Prediction is based on a creative logic programming, Case Based Reasoning approach to problem solving, that is complemented with an unusual approach to Knowledge Representation and Reasoning, as it takes into consideration not only the data items entropic states but introduces the concept of Vague's Predicate Extension.

关键词： Tissue Sarcoma Magnetic Resonance Imaging logic programming Knowledge Representation and Reasoning Case Based Reasoning Entropy Predicative Vagueness

Techniques for Efficient Lazy-Grounding ASP Solving

学校读者我要写书评

暂无评论

Techniques for Efficient Lazy-Grounding ASP Solving

International Conference on Declarative programming (DECLARE)

作者： Leutgeb, Lorenz Weinzierl, Antonius TU Wien Inst Informat Syst Knowledge Based Syst Grp Vienna Austria Aalto Univ Dept Comp Sci Espoo Finland

ISBN: (纸本)9783030008017;9783030008000

Answer-Set programming (ASP) is a well-known and expressive logic programming paradigm based on efficient solvers. State-of-the-art ASP solvers require the ASP program to be variable-free, they thus ground the program upfront at the cost of a potential exponential explosion of the space required. Lazy-grounding, where solving and grounding are interleaved, circumvents this grounding bottleneck, but the resulting solvers lack many important search techniques and optimizations. The recently introduced ASP solver Alpha combines lazy-grounding with conflict-driven nogood learning (CDNL), a core technique of efficient ASP solving. This work presents how techniques for efficient propagation can be lifted to the lazy-grounding setting. The Alpha solver and its components are presented and detailed benchmarks comparing Alpha to other ASP solvers demonstrate the feasibility of this approach.

关键词： logic programming

学校读者我要写书评

暂无评论

The Hoare-fol Tool

arXiv 2019年

作者： Folschette, Maxime Univ. Lille CNRS Centrale Lille UMR 9189 CRIStAL – Centre de Recherche en Informatique Signal et Automatique de Lille LilleF-59000 France

This document presents the tool named "Application of Hoare logic and Dijkstra’s Weakest Proposition Calculus to Biological Regulatory Networks Using Path Programs with Branching First-Order logic Operators" or Hoare-fol for short. This tool consists in an implementation of the theoretical work developed in [Bernot et al., 2019] and contains the following features: (1) computation of the weakest precondition of a Hoare triple, (2) simplification of this weakest precondition using De Morgan laws and partial knowledge on the initial state, and (3) translation into Answer Set programming to allow a solving of all compatible solutions. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Abstract Solvers for Computing Cautious Consequences of ASP programs

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Amendola, Giovanni Dodaro, Carmine Maratea, Marco University of Calabria Italy University of Genoa Italy

solvers are a method to formally analyze algorithms that have been profitably used for describing, comparing and composing solving techniques in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set programming (ASP), and Constraint ASP. In this paper, we design, implement and test novel abstract solutions for cautious reasoning tasks in ASP. We show how to improve the current abstract solvers for cautious reasoning in ASP with new techniques borrowed from backbone computation in SAT, in order to design new solving algorithms. By doing so, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. We implement some of the new solutions in the ASP solver WASP and show that their performance are comparable to state-of-the-art solutions on the benchmark problems from the past ASP Competitions. Under consideration for acceptance in TPLP. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Towards generating explanations for ASP-based link analysis using declarative program transformations

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Atzmueller, Martin Güven, Cicek Seipel, Dietmar Tilburg University Cognitive Science and Artificial Intelligence Warandelaan 2 Tilburg5037 Ab Netherlands University of Würzburg Department of Computer Science Am Hubland WürzburgD-97074 Germany

The explication and the generation of explanations are prominent topics in artificial intelligence and data science, in order to make methods and systems more transparent and understandable for humans. This paper investigates the problem of link analysis, specifically link prediction and anomalous link discovery in social networks using the declarative method of Answer set programming (ASP). Applying ASP for link prediction provides a powerful declarative approach, e. g., for incorporating domain knowledge for explicative prediction. In this context, we propose a novel method for generating explanations - as offline justifications - using declarative program transformations. The method itself is purely based on syntactic transformations of declarative programs, e. g., in an ASP formalism, using rule instrumentation. We demonstrate the efficacy of the proposed approach, exemplifying it in an application on link analysis in social networks, also including domain knowledge. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Domain-Independent Cost-Optimal Planning in ASP

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Spies, David You, Jia-Huai Hayward, Ryan University of Alberta Edmonton Canada

We investigate the problem of cost-optimal planning in ASP. Current ASP planners can be trivially extended to a cost-optimal one by adding weak constraints, but only for a given makespan (number of steps). It is desirable to have a planner that guarantees global optimality. In this paper, we present two approaches to addressing this problem. First, we show how to engineer a cost-optimal planner composed of two ASP programs running in parallel. Using lessons learned from this, we then develop an entirely new approach to cost-optimal planning, stepless planning, which is completely free of makespan. Experiments to compare the two approaches with the only known cost-optimal planner in SAT reveal good potentials for stepless planning in ASP. The paper is under consideration for acceptance in TPLP. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming