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

arXiv 2018年

作者： Fandinno, Jorge Schulz, Claudia Université de Toulouse CNRS Lab Technische Universität Darmstadt

Artificial Intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a "right to explanation" for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is Answer Set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question of why an answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals is not an answer set or why no solution exists at all. Under consideration in theory and practice of logic programming (TPLP) Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Using SWISH to realise interactive web based tutorials for logic based languages

arXiv

引用

arXiv 2018年

作者： Wielemaker, Jan Riguzzi, Fabrizio Kowalski, Bob Lager, Torbjörn Sadri, Fariba Calejo, Miguel Centrum Wiskunde & Informatica Amsterdam Netherlands Imperial College London United Kingdom University of Gothenburg Logical Contracts

programming environments have evolved from purely text based to using graphical user interfaces, and now we see a move towards web based interfaces, such as Jupyter. Web based interfaces allow for the creation of interactive documents that consist of text and programs, as well as their output. The output can be rendered using web technology as, e.g., text, tables, charts or graphs. This approach is particularly suitable for capturing data analysis workflows and creating interactive educational material. This article describes SWISH, a web front-end for Prolog that consists of a web server implemented in SWI-Prolog and a client web application written in JavaScript. SWISH provides a web server where multiple users can manipulate and run the same material, and it can be adapted to support Prolog extensions. In this paper we describe the architecture of SWISH, and describe two case studies of extensions of Prolog, namely Probabilistic logic programming (PLP) and logic Production System (LPS), which have used SWISH to provide tutorial sites. Under consideration in theory and practice of logic programming (TPLP) Copyright © 2018, The Authors. All rights reserved.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Top-down and bottom-up evaluation procedurally integrated

arXiv

引用

arXiv 2018年

作者： Warren, David S. Stony Brook University Stony BrookNY11794-4400 United States XSB Inc. SetauketNY11733 United States

This paper describes how XSB combines top-down and bottom-up computation through the mechanisms of variant tabling and subsumptive tabling with abstraction, respectively. It is well known that top-down evaluation of logical rules in Prolog has a procedural interpretation as recursive procedure invocation (Kowalski 1986). Tabling adds the intuition of short-circuiting redundant computations (Warren 1992). This paper shows how to introduce into tabled logic program evaluation a bottom-up component, whose procedural intuition is the initialization of a data structure, in which a relation is initially computed and filled, on first demand, and then used throughout the remainder of a larger computation for efficient lookup. This allows many Prolog programs to be expressed fully declaratively, programs which formerly required procedural features, such as assert, to be made efficient. This paper is under consideration for acceptance in theory and practice of logic programming (TPLP). Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Improving adherence to heart failure management guidelines via abductive reasoning

Improving adherence to heart failure management guidelines v...

引用

33rd International Conference on logic programming / 23rd International Conference on Principles and practice of Constraint programming (CP) / 20th International Conference on theory and Applications of Satisfiability Testing (SAT)

作者： Chen, Zhuo Salazar, Elmer Marple, Kyle Gupta, Gopal Tamil, Lakshman Cheeran, Daniel Das, Sandeep Amin, Alpesh Univ Texas Dallas Richardson TX 75083 USA Univ Texas Southwestern Med Ctr Dallas Dept Internal Med Div Cardiol Dallas TX USA

Management of chronic diseases, such as heart failure, is a major public health problem. A standard approach to managing chronic diseases by medical community is to have a committee of experts develop guidelines that all physicians should follow. Due to their complexity, these guidelines are difficult to implement and are adopted slowly by the medical community at large. We have developed a physician advisory system that codes the entire set of clinical practice guidelines for managing heart failure using answer set programming. In this paper, we show how abductive reasoning can be deployed to find missing symptoms and conditions that the patient must exhibit in order for a treatment prescribed by a physician to work effectively. Thus, if a physician does not make an appropriate recommendation or makes a non-adherent recommendation, our system will advise the physician about symptoms and conditions that must be in effect for that recommendation to apply. It is under consideration for acceptance in TPLP.

关键词： chronic disease management abduction answer set programming knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Integer and Constraint programming for Batch Annealing Process Planning 23rd

Integer and Constraint Programming for Batch Annealing Proce...

引用

作者： van Hoeve, Willem-Jan Tayur, Sridhar Carnegie Mellon Univ Tepper Sch Business 5000 Forbes Ave Pittsburgh PA 15213 USA

ISBN: (纸本)9783319661582;9783319661575

We describe an optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces. Our solution approach uses a two-phase decomposition. The first phase groups together orders into batches using a mixed-integer linear programming model. The second phase assigns the batches to furnaces and schedules them over time, using constraint programming. Our solution has been developed for operational use in two plants of a steel manufacturer in North America.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

moviola: Interpreting Dynamic logic Programs via Multi-shot Answer Set programming 14th

moviola: Interpreting Dynamic Logic Programs via Multi-shot ...

引用

14th International Conference on logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Sabuncu, Orkunt Leite, Joao TED Univ Ankara Turkey Univ Nova Lisboa NOVA LINCS Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

The causal rejection-based update semantics assign meanings to a Dynamic logic Program (DLP), which is a sequence of logic programs each one updating the preceding ones. Although there are translations of DLPs under these update semantics to logic programs of Answer Set programming (ASP), they have not led to efficient and easy to use implementations. This is mainly because such translations aim offline solving in a sense that the resulting logic program is given to an answer set solver to compute models of the current DLP and for any future updates the whole process has to be repeated from scratch. We aim to remedy this situation by utilizing multi-shot ASP, composed of iterative answer set computations of a changing program without restarting from scratch at every step. To this end, we developed a system called moviola, utilizing the multi-shot answer set solver clingo. Using the system, a user can interactively write a DLP, update it, compute its models according to various semantics on the fly.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Hybrid conditional planning using answer set programming

Hybrid conditional planning using answer set programming

引用

作者： Yalciner, Ibrahim Faruk Nouman, Ahmed Patoglu, Volkan Erdem, Esra Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressive nonmonotonic language of answer set programming (ASP), and computation of the branches of a conditional plan in parallel using an ASP solver. In particular, thanks to external atoms, continuous feasibility checks (like collision checks) are embedded into formal representations of actuation actions and sensing actions in ASP;and thus each branch of a hybrid conditional plan describes a feasible execution of actions to reach their goals. Utilizing nonmonotonic constructs and nondeterministic choices, partial knowledge about states and nondeterministic effects of sensing actions can be explicitly formalized in ASP;and thus each branch of a conditional plan can be computed by an ASP solver without necessitating a conformant planner and an ordering of sensing actions in advance. We apply our method in a service robotics domain and report experimental evaluations. Furthermore, we present performance comparisons with other compilation based conditional planners on standardized benchmark domains.

关键词： Conditional planning hybrid planning answer set programming cognitive robotics

来源：评论

学校读者我要写书评

暂无评论

ASPeRiX, a first-order forward chaining approach for answer set computing

引用

theory and practice of logic programming 2017年第3期17卷 266-310页

作者： Lefevre, Claire Beatrix, Christopher Stephan, Igor Garcia, Laurent Univ Angers LERIA 2 Blvd Lavoisier F-49045 Angers 01 France

The natural way to use Answer Set programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first-order logic program with default negation. In a preliminary step, this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems apply this two steps computation. In this article, the project ASPeRiX is presented as a first-order forward chaining approach for Answer Set Computing. This project was among the first to introduce an approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. The methodology applies a forward chaining of first-order rules that are grounded on the fly by means of previously produced atoms. Theoretical foundations of the approach are presented, the main algorithms of the ASP solver ASPeRiX are detailed and some experiments and comparisons with existing systems are provided.

关键词： Answer set programming solver implementation grounding on the fly first order forward chaining

来源：评论

学校读者我要写书评

暂无评论

Completing the Picture: Complexity of Graded Modal logics with Converse

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Constraint answer set solver EZCSP and why integration schemas matter

引用

theory and practice of logic programming 2017年第4期17卷 462-515页

作者： Balduccini, Marcello Lierler, Yuliya St Josephs Univ Dept Decis & Syst Sci Philadelphia PA 19131 USA Univ Nebraska Omaha Dept Comp Sci Omaha NE USA

Researchers in answer set programming and constraint programming have spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming. Constraint answer set programming languages and systems proved to be successful at providing declarative, yet efficient solutions to problems involving hybrid reasoning tasks. One of the main contributions of this paper is the first comprehensive account of the constraint answer set language and solver ezcsp, a mainstream representative of this research area that has been used in various successful applications. We also develop an extension of the transition systems proposed by Nieuwenhuis et al. in 2006 to capture Boolean satisfiability solvers. We use this extension to describe the ezcsp algorithm and prove formal claims about it. The design and algorithmic details behind ezcsp clearly demonstrate that the development of the hybrid systems of this kind is challenging. Many questions arise when one faces various design choices in an attempt to maximize system's benefits. One of the key decisions that a developer of a hybrid solver makes is settling on a particular integration schema within its implementation. Thus, another important contribution of this paper is a thorough case study based on ezcsp, focused on the various integration schemas that it provides.

关键词： Constraint Answer Set programming Knowledge Representation Nonmonotonic Reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：