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

An Integrated Soft Computing Approach to Hughes Syndrome Risk Assessment

学校读者我要写书评

暂无评论

JOURNAL OF MEDICAL SYSTEMS 2017年第3期41卷 1-12页

作者： Vilhena, Joao Rosario Martins, M. Vicente, Henrique Graneda, Jose M. Caldeira, Filomena Gusmao, Rodrigo Neves, Joao Neves, Jose Univ Evora Dept Quim Escola Ciencias & Tecnol P-7000671 Evora Portugal Univ Evora Dept Quim Escola Ciencias & Tecnol Lab HERCULES P-7000671 Evora Portugal Univ Minho Ctr Algoritmi P-4710057 Braga Portugal EPE Serv Patol Clin Hosp Espirito Santo Evora Evora Portugal Drs Nicolas & Asp Dubai U Arab Emirates

The AntiPhospholipid Syndrome (APS) is an acquired autoimmune disorder induced by high levels of antiphospholipid antibodies that cause arterial and veins thrombosis, as well as pregnancy-related complications and morbidity, as clinical manifestations. This autoimmune hypercoagulable state, usually known as Hughes syndrome, has severe consequences for the patients, being one of the main causes of thrombotic disorders and death. Therefore, it is required to be preventive;being aware of how probable is to have that kind of syndrome. Despite the updated of antiphospholipid syndrome classification, the diagnosis remains difficult to establish. Additional research on clinically relevant antibodies and standardization of their quantification are required in order to improve the antiphospholipid syndrome risk assessment. Thus, this work will focus on the development of a diagnosis decision support system in terms of a formal agenda built on a logic programming approach to knowledge representation and reasoning, complemented with a computational framework based on Artificial Neural Networks. The proposed model allows for improving the diagnosis, classifying properly the patients that really presented this pathology (sensitivity higher than 85%), as well as classifying the absence of APS (specificity close to 95%).

关键词： Antiphospholipid syndrome Systemic autoimmune diseases Artificial neuronal networks Knowledge representation and reasoning logic programming

Towards coinductive theory exploration in horn clause logic: position paper

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Komendantskaya, Ekaterina Li, Yue School of Mathematical and Computer Sciences Heriot-Watt University United Kingdom

Coinduction occurs in two guises in Horn clause logic: in proofs of self-referencing properties and relations, and in proofs involving construction of (possibly irregular) infinite data. Both instances of coinductive reasoning appeared in the literature before, but a systematic analysis of these two kinds of proofs and of their relation was lacking. We propose a general proof-theoretic framework for handling both kinds of coinduction arising in Horn clause logic. To this aim, we propose a coinductive extension of Miller et al's framework of uniform proofs and prove its soundness relative to coinductive models of Horn clause logic. Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

Translating lpoD and CR-Prolog2 into standard answer set programs

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Lee, Joohyung Yang, Zhun School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe United States

logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog2 is an extension of standard answer set programs with consistency restoring rules and LPOD-like ordered disjunction. We present reductions of each of these languages into the standard ASP language, which gives us an alternative way to understand the extensions in terms of the standard ASP language. Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

Validation and inference of schema-level workflow data-dependency annotations

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Bowers, Shawn McPhillips, Timothy Ludäscher, Bertram Dept. of Computer Science Gonzaga University School of Information Sciences University of Illinois Urbana-Champaign United States

An advantage of scientific workflow systems is their ability to collect runtime provenance information as an execution trace. Traces include the computation steps invoked as part of the workflow run along with the corresponding data consumed and produced by each workflow step. The information captured by a trace is used to infer "lineage" relationships among data items, which can help answer provenance queries to find workflow inputs that were involved in producing specific workflow outputs. Determining lineage relationships, however, requires an understanding of the dependency patterns that exist between each workflow step's inputs and outputs, and this information is often under-specified or generally assumed by workflow systems. For instance, most approaches assume all outputs depend on all inputs, which can lead to lineage "false positives". In prior work, we defined annotations for specifying detailed dependency relationships between inputs and outputs of computation steps. These annotations are used to define corresponding rules for inferring fine-grained data dependencies from a trace. In this paper, we extend our previous work by considering the impact of dependency annotations on workflow specifications. In particular, we provide a reasoning framework to ensure the set of dependency annotations on a workflow specification is consistent. The framework can also infer a complete set of annotations given a partially annotated workflow. Finally, we describe an implementation of the reasoning framework using answer-set programming. Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

logic programming and Uncertainty

学校读者我要写书评

暂无评论

5th International Conference on Scalable Uncertainty Management (SUM 2011)

作者： Baral, Chitta Arizona State Univ Fac Comp Sci & Engn Tempe AZ 85287 USA

ISBN: (纸本)9783642239625;9783642239632

In recent years logic programming based languages and features such as rules and non-monotonic constructs have become important in various knowledge representation paradigms. While the early logic programming languages, such as Horn logic programs and Prolog did not focus on expressing and reasoning with uncertainty, in recent years logic programming languages have been developed that can express both logical and quantitative uncertainty. In this paper we give an overview of such languages and the kind of uncertainty they can express and reason with. Among those, we slightly elaborate on the language P-log that not only accommodates probabilistic reasoning, but also respects causality and distinguishes observational and action updates.

关键词： logic programming

Experimenting with robotic intra-logistics domains

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Gebser, Martin Obermeier, Philipp Otto, Thomas Schaub, Torsten Sabuncu, Orkunt Nguyen, Van Son, Tran Cao University of Potsdam Germany TED University Ankara Turkey New Mexico State University Las Cruces United States

We introduce the asprilo1 framework to facilitate experimental studies of approaches addressing complex dynamic applications. For this purpose, we have chosen the domain of robotic intra-logistics. This domain is not only highly relevant in the context of today's fourth industrial revolution but it moreover combines a multitude of challenging issues within a single uniform framework. This includes multi-agent planning, reasoning about action, change, resources, strategies, etc. In return, asprilo allows users to study alternative solutions as regards effectiveness and scalability. Although asprilo relies on Answer Set programming and Python, it is readily usable by any system complying with its fact-oriented interface format. This makes it attractive for benchmarking and teaching well beyond logic programming. More precisely, asprilo consists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques. Importantly, the visualizer's animation capabilities are indispensable for complex scenarios like intra-logistics in order to inspect valid as well as invalid solution candidates. Also, it allows for graphically editing benchmark layouts that can be used as a basis for generating benchmark suites. Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

Dialectical logic: the Process Calculus

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Kent, Robert E.

Dialectical logic is the logic of dialectical processes. The goal of dialectical logic is to reveal the dynamical notions inherent in logical computational systems. The fundamental notions of proposition and truth-value in standard logic are subsumed by the notions of process and flow in dialectical logic. Standard logic motivates the core sequential aspect of dialectical logic. Horn-clause logic requires types and nonsymmetry and also motivates the parallel aspect of dialectical logic. The process logics of Milner and Hoare reveal the internal/external aspects of dialectical logic. The sequential internal aspect of dialectical logic should be viewed as a typed or distributed version of Girard’s linear logic with nonsymmetric tensor. The simplest version of dialectical logic is inherently intuitionistic. However, by following Glivenko’s approach in standard logic using double negation closure, we can define a classical version of dialectical logic. Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

Completing the Picture: Complexity of Graded Modal logics with Converse

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Bednarczyk, Bartosz Kieronski, Emanuel Witkowski, Piotr Institute of Computer Science University of Wroclaw Poland and Computational Logic Group TU Dresden Germany Institute of Computer Science University of Wroclaw Poland

A complete classification of the complexity of the local and global satisfiability problems for graded modal language over traditional classes of frames have already been established. By"traditional" classes of frames, we mean those characterized by any positive combination of reflexivity, seriality, symmetry, transitivity, and the Euclidean property. In this paper, we fill the gaps remaining in an analogous classification of the graded modal language with graded converse modalities. In particular, we show its NExpTime-completeness over the class of Euclidean frames, demonstrating this way that over this class the considered language is harder than the language without graded modalities or without converse modalities. We also consider its variation disallowing graded converse modalities, but still admitting basic converse modalities. Our most important result for this variation is confirming an earlier conjecture that it is decidable over transitive frames. This contrasts with the undecidability of the language with graded converse modalities. Under consideration in Theory and Practice of logic programming (TPLP). Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

Inlining external sources in answer set programs

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Redl, Christoph Institute of Logic and Computation Vienna University of Technology Favoritenstraße 9-11 ViennaA-1040 Austria

HEX-programs are an extension of answer set programs (ASP) with external sources. To this end, external atoms provide a bidirectional interface between the program and an external source. The traditional evaluation algorithm for HEX-programs is based on guessing truth values of external atoms and verifying them by explicit calls of the external source. The approach was optimized by techniques that reduce the number of necessary verification calls or speed them up, but the remaining external calls are still expensive. In this paper we present an alternative evaluation approach based on inlining of external atoms, motivated by existing but less general approaches for specialized formalisms such as DL-programs. External atoms are then compiled away such that no verification calls are necessary. The approach is implemented in the dlvhex reasoner. Experiments show a significant performance gain. Besides performance improvements, we further exploit inlining for extending previous (semantic) characterizations of program equivalence from ASP to HEX-programs, including those of strong equivalence, uniform equivalence and hH, Bi-equivalence. Finally, based on these equivalence criteria, we characterize also inconsistency of programs wrt. extensions. Since well-known ASP extensions (such as constraint ASP) are special cases of HEX, the results are interesting beyond the particular formalism. Under consideration in Theory and Practice of logic programming (TPLP). Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming