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

36th international conference on logic programming (iclp)

作者： Mastria, Elena Zangari, Jessica Perri, Simona Calimeri, Francesco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

Answer Set programming (ASP) is a declarative logic formalism that allows to encode computational problems via logic programs. Despite the declarative nature of the formalism, some advanced expertise is required, in general, for designing an ASP encoding that can be efficiently evaluated by an actual ASP system. A common way for trying to reduce the burden of manually tweaking an ASP program consists in automatically rewriting the input encoding according to suitable techniques, for producing alternative, yet semantically equivalent, ASP programs. However, rewriting does not always grant benefits in terms of performance;hence, proper means are needed for predicting their effects with this respect. In this paper we describe an approach based on Machine Learning (ML) to automatically decide whether to rewrite. In particular, given an ASP program and a set of input facts, our approach chooses whether and how to rewrite input rules based on a set of features measuring their structural properties and domain information. To this end, a Multilayer Perceptrons model has then been trained to guide the ASP grounder I -DLV on rewriting input rules. We report and discuss the results of an experimental evaluation over a prototypical implementation.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Shared aggregate sets in answer set programming

引用

thEORY AND PRACTICE OF logic programming 2018年第3-4期18卷 301-318页

作者： Alviano, Mario Dodaro, Carmine Maratea, Marco Univ Calabria DEMACS Commenda Di Rende Italy Univ Genoa DIBRIS Genoa Italy

Aggregates are among the most frequently used linguistic extensions of answer set programming. the result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined literals. this paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input. the proposed solution reduces the memory footprint of the solver without sacrificing efficiency. On the contrary, the performance of the solver may improve thanks to the addition of some simple entailed clauses which are not easily discovered otherwise, and since redundant computation is avoided during propagation. Empirical evidence of the potential impact of the proposed solution is given.

关键词： answer set programming aggregations in logic programming efficient computation

来源：评论

学校读者我要写书评

暂无评论

Deriving theorems in Implicational Linear logic, Declaratively 36

Deriving Theorems in Implicational Linear Logic, Declarative...

引用

36th international conference on logic programming (iclp)

作者： Tarau, Paul de Paiva, Valeria Univ North Texas Denton TX 76203 USA Topos Inst Berkeley CA USA

the problem we want to solve is how to generate all theorems of a given size in the implicational fragment of propositional intuitionistic linear logic. We start by filtering for linearity the proof terms associated by our Prolog-based theorem prover for Implicational Intuitionistic logic. this works, but using for each formula a PSPACE-complete algorithm limits it to very small formulas. We take a few walks back and forth over the bridge between proof terms and theorems, provided by the Curry-Howard isomorphism, and derive step-by-step an efficient algorithm requiring a low polynomial effort per generated theorem. the resulting Prolog program runs in O(N) space for terms of size N and generates in a few hours 7,566,084,686 theorems in the implicational fragment of Linear Intuitionistic logic together with their proof terms in normal form. As applications, we generate datasets for correctness and scalability testing of linear logic theorem provers and training data for neural networks working on theorem proving challenges. the results in the paper, organized as a literate Prolog program, are fully replicable.

关键词： combinatorial generation of provable formulas of a given size intuitionistic and linear logic theorem provers theorems of the implicational fragment of propositional linear intuitionistic logic Curry-Howard isomorphism efficient generation of linear lambda terms in normal form Prolog programs for lambda term generation and theorem proving

来源：评论

学校读者我要写书评

暂无评论

A logic-based decision support system for the diagnosis of headache disorders according to the ICHD-3 international classification

引用

thEORY AND PRACTICE OF logic programming 2020年第6期20卷 864-879页

作者： COSTABILE, R. O. B. E. R. T. A. CATALANO, G. E. L. S. O. M. I. N. A. CUTERI, B. E. R. N. A. R. D. O. MORELLI, C. O. N. C. E. T. T. A. M. A. R. I. A. LEONE, N. I. C. O. L. A. MANNA, M. A. R. C. O. Univ Calabria Dept Math & Comp Sci Calabria Italy DLVSyst Srl Arcavacata Di Rende Italy

Decision support systems play an important role in medical fields as they can augment clinicians to deal more efficiently and effectively with complex decision-making processes. In the diagnosis of headache disorders, however, existing approaches and tools are still not optimal. On the one hand, to support the diagnosis of this complex and vast spectrum of disorders, the international Headache Society released in 1988 the international Classification of Headache Disorders (ICHD), now in its 3rd edition: a 200 pages document classifying more than 300 different kinds of headaches, where each is identified via a collection of specific nontrivial diagnostic criteria. On the other hand, the high number of headache disorders and their complex criteria make the medical history process inaccurate and not exhaustive both for clinicians and existing automatic tools. To fill this gap, we present head-asp, a novel decision support system for the diagnosis of headache disorders. through a REST Web Service, head-asp implements a dynamic questionnaire that complies withICHD-3by exploiting two logical modules to reach a complete diagnosis while trying to minimize the total number of questions being posed to patients. Finally, head-asp is freely available on-line and it is receiving very positive feedback from the group of neurologists that is testing it.

关键词： Knowledge Representation ASP Artificial Intelligence ICHD-3

来源：评论

学校读者我要写书评

暂无评论

Incremental Answer Set programming with Overgrounding

引用

thEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 957-973页

作者： Calimeri, Francesco Ianni, Giovambattista Pacenza, Francesco Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Commenda Di Rende 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.

关键词： Knowledge Representation Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

Work in progress: Computer design for intermediate-level digital systems course

Work in progress: Computer design for intermediate-level dig...

引用

36th Annual Frontiers in Education (FIE 2006)

作者： Mealy, Bryan J. Calif Polytech State Univ San Luis Obispo Dept Elect Engn Comp Engn Program San Luis Obispo CA 93407 USA

ISBN: (纸本)9781424402564

the flexibility of Programmable logic Devices (PLDs) and their supporting CAD (Computer Aided Design) tools make PLDs ideal for digital systems design courses. this paper outlines a computer design-based course and supporting laboratory targeted for students with intermediate-level digital design skills. the unifying theme of this course is the design, implementation, and programming of a relatively complex microcontroller (MCU). this course emphasizes the development and subsequent integration of basic individual computer building blocks using a Hardware Description Language (HDL). the major topics in the course include Finite State Machine (FSM) design, computer system architecture, and assembly language programming. Placing emphasis on a hierarchical design approach and ensuring continuity in the course topics reduces potential difficulties in presenting this scope of topics.

关键词： digital design programmable logic devices computer architecture finite state machine (FSM)

来源：评论

学校读者我要写书评

暂无评论

Qualified Computations in Functional logic programming

Qualified Computations in Functional Logic Programming

引用

25th international conference on logic programming (iclp)

作者： Caballero, Rafael Rodriguez-Artalejo, Mario Romero-Diaz, Carlos A. Univ Complutense Fac Informat Dept Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642028458

Qualification has been recently introduced as a generalization Of uncertainty in the field of logic programming. In this paper we investigate a more expressive language for First-Order Functional logic programming with Constraints and Qualification. We present a Rewriting logic which characterizes the intended semantics of programs, and a prototype implementation based on a semantically correct, program transformation. Potential applications of the resulting language include flexible information retrieval. As a concrete illustration, we show how to write program rules to compute qualified answers for user queries concerning the books available in a given library.

关键词： Constraints Functional logic programming Program Transformation Qualification Rewriting logic

来源：评论

学校读者我要写书评

暂无评论

Partial Functions and Equality in Answer Set programming

Partial Functions and Equality in Answer Set Programming

引用

24th international conference on logic programming (iclp)

作者： Cabalar, Pedro Corunna Univ Dept Comp Sci Corunna Spain

ISBN: (纸本)9783540899815

In this paper we propose an extension of Answer Set programming (ASP) [1], and in particular, of its most general logical counterpart, Quantified Equilibrium logic (QEL) [2], to deal with partial functions. Although the treatment of equality in QEL can be established in different ways, we first analyse the choice of decidable equality with complete functions and Herbrand models, recently proposed in the literature [3]. We argue that this choice yields some counterintuitive effects from a logic programming and knowledge representation point of view. We then propose a variant called QEL=(F) where the set of functions is partitioned into partial and Herbrand functions (we also call constructors). In the rest of the paper, we show a direct connection to Scott's logic of Existence [4] and present a practical application, proposing an extension of normal logic programs to deal with partial functions and equality, so that they can be translated into function-free normal programs, being possible in this way to compute their answer sets with any standard ASP solver.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Modular Nonmonotonic logic programming Revisited

Modular Nonmonotonic Logic Programming Revisited

引用

25th international conference on logic programming (iclp)

作者： Dao-Tran, Minh Eiter, thomas Fink, Michael Krennwallner, thomas Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783642028458

Recently, enabling modularity aspects in Answer Set programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules. Moreover, (Mutually) recursive module calls are allowed. We define a model-theoretic semantics for this extended setting, show that many desired properties of ordinary logic programming generalize to our modular ASP, and determine the computational complexity of the new formalism. We investigate the relationship of modular programs to disjunctive logic programs with well-defined input/output interface (DLP-functions) and show that they can be embedded into MLPs.

关键词： Knowledge Representation Answer Set programming Modular logic programming

来源：评论

学校读者我要写书评

暂无评论

Comparing Tape and Cloud Storage for Long-Term Data Preservation 36

Comparing Tape and Cloud Storage for Long-Term Data Preserva...

引用

36th international conference on Massive Storage Systems and Technology, MSST 2020

作者： Starr, Matt Ninesling, Matt Polet, Eric Spectra Logic Boulder United States

With the retention life of data increasing, many organizations are trying to determine the best long-term storage strategy for the future. To do this, organizations must analyze the reliability, security and speed of data storage solutions, including both cloud and tape storage. this paper considers how a hybrid archive solution, consisting of both cloud and tape, may be deployed in the event of a cloud mandate, and how data growth and future costs can impact a storage solution selection. © 2020 SPECTRA logic CORPORATION. All rights reserved.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：