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

On abstract modular inference systems and solvers

ARTIFICIAL INTELLIGENCE 2016年 236卷 65-89页

作者： Lierler, Yuliya Truszczynski, Miroslaw Univ Nebraska Dept Comp Sci Omaha NE 68182 USA Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience, and computational benefits. We introduce the concepts of abstract inference modules and abstract modular inference systems to study general principles behind the design and analysis of model generating programs, or solvers, for integrated multi-logic systems. We show how modules and modular systems give rise to transition graphs, which are a natural and convenient representation of solvers, an idea pioneered by the SAT community. These graphs lend themselves well to extensions that capture such important solver design features as learning. In the paper, we consider two flavors of learning for modular formalisms, local and global. We illustrate our approach by showing how it applies to answer set programming, propositional logic, multi-logic systems based on these two formalisms and, more generally, to satisfiability modulo theories. (C) 2016 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Knowledge representation Model-generation Automated reasoning and inference SAT solving answer set programming

来源：评论

学校读者我要写书评

暂无评论

Semi-equilibrium models for paracoherent answer set programs

引用

ARTIFICIAL INTELLIGENCE 2016年 234卷 219-271页

作者： Amendola, Giovanni Eiter, Thomas Fink, Michael Leone, Nicola Moura, Joao Univ Calabria Dept Math & Comp Sci Via P BucciCubo 30b I-87036 Arcavacata Di Rende CS Italy Vienna Univ Technol Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria Univ Nova Lisboa Dept Informat NOVA LINCS P-2829516 Caparica Portugal

The answer set semantics may assign a logic program to model, due to logical contradiction or unstable negation, which is caused by cyclic dependency of an atom on its negation. While logical contradictions can be handled with traditional techniques from paraconsistent reasoning, instability requires other methods. We consider resorting to a paracoherent semantics, in which 3-valued interpretations are used where a third truth value besides true and false expresses that an atom is believed true. This is at the basis of the semi-stable model semantics, which was defined using a program transformation. In this paper, we give a model-theoretic characterization of semi-stable models, which makes the semantics more accessible. Motivated by some anomalies of semi-stable model semantics with respect to basic epistemic properties, we propose an amendment that satisfies these properties. The latter has both a transformational and a model-theoretic characterization that reveals it as a relaxation of equilibrium logic, the logical reconstruction of answer set semantics, and is thus called the semi-equilibrium model semantics. We consider refinements of this semantics to respect modularity in the rules, based on splitting sets, the major tool for modularity in modeling and evaluating answer set programs. In that, we single out classes of canonical models that are amenable for customary bottom-up evaluation of answer set programs, with an option to switch to a paracoherent mode when lack of an answer set is detected. A complexity analysis of major reasoning tasks shows that semi-equilibrium models are harder than answer sets (i.e., equilibrium models), due to a global minimization step for keeping the gap between true and believed true atoms as small as possible. Our results contribute to the logical foundations of paracoherent answer set programming, which gains increasing importance in inconsistency management, and at the same time provide a basis for algorithm development and

关键词： answer set programming Equilibrium logic Paracoherent reasoning Splitting sequences Inconsistency management

来源：评论

学校读者我要写书评

暂无评论

First-Order Logic with Inductive Definitions for Model-Based Problem Solving

引用

AI MAGAZINE 2016年第3期37卷 69-80页

作者： Bruynooghe, Maurice Denecker, Marc Truszczynski, Mirosiaw Katholieke Univ Leuven Dept Comp Sci Leuven Belgium Declarat Languages & Artificial Intelligence Res Leuven Belgium Katholieke Univ Leuven Comp Sci Leuven Belgium Res Grp Knowledge Representat & Reasoning Leuven Belgium Univ Kentucky Comp Sci Lexington KY 40506 USA

In answer set programming (ASP), programs can be viewed as specifications of finite Herbrand structures. Other logics can be (and, in fact, were) used toward the same end and can be taken as the basis of declarative programming systems of similar functionality as ASP. We discuss here one such logic, the logic FO(ID), and its implementation IDP3. The choice is motivated by notable similarities between ASP and FO(ID), even if both approaches trace back to different origins.

关键词： Declarative programming Problem Solving Stable model semantics answer set programming First-order logic

来源：评论

学校读者我要写书评

暂无评论

Constraints On Signaling Networks Logic Reveal Functional Subgraphs On Multiple Myeloma OMIC Data 17

Constraints On Signaling Networks Logic Reveal Functional Su...

引用

Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics

作者： Bertrand Miannay Stéphane Minvielle Olivier Roux Florence Magrangeas Carito Guziolowski LS2N UMR 6004 Ecole Centrale de Nantes Nantes France CRCINA INSERM CNRS Université d'AngersUniversité de Nantes Nantes France

ISBN: (纸本)9781450347228

The integration of gene expression profiles (GEPs) and large-scale biological networks derived from Pathways Databases is a subject which is being widely explored. Existing methods are based on network distance measures among significantly measured species. Only a small number of them include the directionality and underlying logic existing in biological networks. In this study we approach the GEP-networks integration problem by considering the network logic but our approach does not require a prior species selection according to their gene expression level. We start by modeling the biological network representing its underlying logic using Logic programming. This model points to reachable network discrete states that maximize a notion of harmony between the molecular species active or inactive possible states and the directionality of the pathways reactions according to their activator or inhibitor control role. Only then, we confront these network states with the GEP. From this analysis independent graph components are derived, each of them related to a fixed and optimal assignment of active or inactive states. These components allow us to decompose a large-scale network into subgraphs and their molecular species state assignments have different degrees of similarity when compared to the same GEP. We applied our method to study the set of possible states derived from a subgraph from the NCI-PID Pathway Interaction Database. This graph linked Multiple Myeloma (MM) genes to known receptors for this blood cancer.

关键词： omic data integration answer set programming regulatory network modeling

来源：评论

学校读者我要写书评

暂无评论

A semantic model for action-based adaptive security 17

A semantic model for action-based adaptive security

引用

Proceedings of the Symposium on Applied Computing

作者： Sara Sartoli Akbar Siami Namin Texas Tech University

ISBN: (纸本)9781450344869

This paper presents a semantic model to represent topology-based security requirements, recommend measures to address any possible security violations, and thus make the underlying systems compliant with its security requirements. The proposed action-based model is capable of adaptively adjusting the topological model of a given system in response to changes in the structure of its operational environment. The proposed framework benefits from non-monotonic reasoning to reason about possible execution paths and hence recommend actions to prevent security requirements violations. The results of our case studies show that using the proposed approach to enforce security measures, not only can we detect possible security violations caused by changes in the structure of operational environment, but also recommend actions to address possible violations.

关键词： access control formal methods adaptive security topology awareness answer set programming

来源：评论

学校读者我要写书评

暂无评论

answer set programming with Resources

引用

JOURNAL OF LOGIC AND COMPUTATION 2010年第2期20卷 533-571页

作者： Costantini, Stefania Formisano, Andrea Univ Aquila Dipartimento Informat I-67010 Laquila Italy Univ Perugia Dipartimento Matemat & Informat I-06123 Perugia Italy

In this article, we propose an extension of answer set programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension RASP, standing for 'Resourced ASP'. Resources are modeled by introducing special atoms, called amount-atoms, to which we associate quantities that represent the available amount of a certain resource. The 'firing' of a RASP rule involving amount-atoms can both consume and produce resources. A RASP rule can be fired several times, according to its definition and to the available quantities of required resources. We define the semantics for RASP programs by extending the usual answer set semantics. Different answer sets correspond to different possible allocations of available resources. We then propose an implementation based on standard ASP-solvers. The implementation consists of a standard translation of each RASP rule into a set of plain ASP-rules and of an inference engine that manages the firing of RASP rules.

关键词： answer set programming non-monotonic logic programming quantitative reasoning language extensions

来源：评论

学校读者我要写书评

暂无评论

A Declarative Modular Framework for Representing and Applying Ethical Principles 17

A Declarative Modular Framework for Representing and Applyin...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Fiona Berreby Gauvain Bourgne Jean-Gabriel Ganascia Sorbonne Universites UPMC CNRS UMR 7606 LIP6

ISBN: (纸本)9781510855076

This paper investigates the use of high-level action languages for designing ethical autonomous agents. It proposes a novel and modular logic-based framework for representing and reasoning over a variety of ethical theories, based on a modified version of the Event Calculus and implemented in answer set programming. The ethical decision-making process is conceived of as a multi-step procedure captured by four types of interdependent models which allow the agent to assess its environment, reason over its accountability and make ethically informed choices The overarching ambition of the presented research is twofold. First, to allow the systematic representation of an unbounded number of ethical reasoning processes, through a framework that is adaptable and extensible by virtue of its designed hierarchisation and standard syntax. Second, to avoid the pitfall of much research in current computational ethics that too readily embed moral information within computational engines, thereby feeding agents with atomic answers that fail to truly represent underlying dynamics. We aim instead to comprehensively displace the burden of moral reasoning from the programmer to the program itself.

关键词： Computational Ethics answer set programming Event Calculus Reasoning about Actions and Change Temporal logic Reasoning Ethical Theory Frameworks Modularity Computer personnel EXPANDABLE Morals

来源：评论

学校读者我要写书评

暂无评论

Design Technology for Fault-Free and Maximally-Parallel Wavelength-Routed Optical Networks-on-Chip 35

Design Technology for Fault-Free and Maximally-Parallel Wave...

引用

35th IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

作者： Peano, Andrea Ramini, Luca Gavanelli, Marco Nonato, Maddalena Bertozzi, Davide Univ Ferrara Via Saragat 1 I-44121 Ferrara Italy

ISBN: (纸本)9781450344661

The recent interest in emerging interconnect technologies is bringing the issue of a proper EDA support for them to the forefront, so to tackle the design complexity. A relevant case study is provided by wavelength-routed optical NoCs (WRONoCs), which add communication performance guarantees to the typical latency, throughput and power benefits of an optical link, thus providing an appealing technology for the photonic integration of high-end embedded systems. Typically, only abstract WRONoC models are considered to figure out architecture-level performance, and logic connectivity patterns for the quantification of the required signal strength (i.e., static power). However, this design practice overlooks the needed refinement step, where key physical parameters are assigned such as wavelengths of the optical channels, and size of the optical filters. This step is unfortunately not decoupled from the architectural evaluation, since its main constraint (i.e., avoiding routing faults) turns out to be a key limiter for both the network scale and the achievable communication parallelism. By proposing a formal methodology to selectWRONoC parameters while avoding the routing fault concern, this paper aims at maximizing the levels of connectivity and/or of bit parallelism that WRONoCs can achieve, while relating their upper bounds to the uncertainty of the manufacturing process.

关键词： answer set programming parallelism WRONoC

来源：评论

学校读者我要写书评

暂无评论

Design Space Descriptions for Logical Generation of Content 8

Design Space Descriptions for Logical Generation of Content

引用

8th European Starting AI Researcher Symposium (STAIRS)

作者： Smith, Thomas Padget, Julian Vidler, Andrew Univ Bath Ctr Digital Entertainment Bath BA2 7AY Avon England Ninja Theory Ltd Cambridge England

ISBN: (纸本)9781614996828;9781614996811

This paper describes our research-in-progress into providing content-agnostic procedural content generation for computer games via answer set programming and a formal semantic description of the design space. Existing generative approaches are often closely coupled to a particular form of content and/or game, limiting opportunities for re-use - a dungeon level generator in one game is substantially different to a sci-fi weapon generator in another. We propose an approach involving a re-usable generator system that is able to produce and refine a model of any structured content from formal desired properties produced by designers. As an intermediate step towards this system for multi-purpose content generation we present initial work on generating content within a commercial game engine, using answer set programming to generate varied and challenging combat progressions for third-person action/combat games. By using semantic models as input for a content-agnostic generation system, we hope to provide more domain-general content generation.

关键词： procedural content generation generative methods answer set programming video games

来源：评论

学校读者我要写书评

暂无评论

A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns

引用

THEORY AND PRACTICE OF LOGIC programming 2016年第5-6期16卷 604-618页

作者： Chen, Zhuo Marple, Kyle Salazar, Elmer Gupta, Gopal Tamil, Lakshman Univ Texas Dallas Richardson TX 75083 USA

Management of chronic diseases such as chronic heart failure (CHF) is a major problem in health care. A standard approach followed by the medical community is to have a committee of experts develop guidelines that all physicians should follow. These guidelines typically consist of a series of complex rules that make recommendations based on a patient's information. Due to their complexity, often the guidelines are ignored or not complied with at all. It is not even clear whether it is humanly possible to follow these guidelines due to their length and complexity. For instance, for CHF, the guidelines run nearly eighty pages. In this paper we describe a physician-advisory system for CHF management that codes the entire set of clinical practice guidelines for CHF using answer set programming (ASP). Our approach is based on developing reasoning templates, that we call knowledge patterns, and using them to systemically code the clinical guidelines for CHF as ASP rules. Use of the knowledge patterns greatly facilitates the development of our system. Given a patient's medical information, our system generates a recommendation for treatment just as a human physician would, using the guidelines. Our system works even in the presence of incomplete information.

关键词： chronic disease management knowledge pattern answer set programming knowledge representation automated reasoning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：