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

Fostering the Use of declarative Formalisms for Real-World Applications: The EmbASP Framework

NEW GENERATION COMPUTING 2019年第1期37卷 29-65页

作者： Calimeri, Francesco Fusca, Davide Germano, Stefano Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

Thanks to a number of efficient implementations, the use of logic formalisms for problem-solving has been increased in several real-world domains. This is the case, for instance, of action languages, such as planning domain definition language (PDDL), or answer set programming (ASP), which is a well-established declarative problem-solving paradigm that became widely used in AI and recognized as a powerful tool for knowledge representation and reasoning (KRR). As the application scenarios widened, the need for proper development tools and interoperability mechanisms for easing interaction and integration between declarative logic-based systems and external systems clearly emerged. In this work, we present a framework for integrating the KRR capabilities of, possibly more than one, declarative formalisms into generic applications developed by means of different programming paradigms. We show the use of the framework by illustrating proper specializations for two formalisms, namely ASP and PDDL, along with specializations for some relevant systems over different platforms, including the mobile setting.

关键词： Artificial intelligence declarative programming Answer set programming Software engineering Applications

来源：评论

学校读者我要写书评

暂无评论

Stimulating Creativity through Opportunistic Software Development

引用

IEEE SOFTWARE 2008年第6期25卷 64-70页

作者： Obrenovic, Zeljko Gasevic, Dragan Eliens, Anton Tech Univ Eindhoven Ind Design Dept NL-5600 MB Eindhoven Netherlands Athabasca Univ Sch Comp & Informat Syst Athabasca AB Canada Vrije Univ Amsterdam Amsterdam Netherlands

The article focuses on the use of opportunistic software development in helping computer students learn skills needed in integrating and testing software that they did not design. It mentions that colleges are starting to promote design-based education where students build concrete and realistic solutions when writing computer code. It examines tools used in rapid prototyping of computer code, including spreadsheets, Web browser scripting, declarative programming mashups, and programming libraries. It comments on the use of creativity support principles in opportunistic software development.

关键词： COMPUTER software development declarative programming COMPUTER programming BROWSERS (Computer programs) MASHUPS (Internet) CREATIVE ability COLLEGE students ELECTRONIC spreadsheets RAPID prototyping STUDY & teaching

来源：评论

学校读者我要写书评

暂无评论

Angry-HEX: An Artificial Player for Angry Birds Based on declarative Knowledge Bases

引用

IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES 2016年第2期8卷 128-139页

作者： Calimeri, Francesco Fink, Michael Germano, Stefano Humenberger, Andreas Ianni, Giovambattista Redl, Christoph Stepanova, Daria Tucci, Andrea Wimmer, Anton Univ Calabria Dipartimento Matemat & Informat I-87036 Arcavacata Di Rende Italy Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria Max Planck Inst Informat Databases & Informat Syst Grp D-66123 Saarbrucken Germany Ubisoft Milan Italy

This paper presents the Angry-HEX artificial intelligent agent that participated in the 2013 and 2014 Angry Birds Artificial Intelligence Competitions. The agent has been developed in the context of a joint project between the University of Calabria (UniCal) and the Vienna University of Technology (TU Vienna). The specific issues that arise when introducing artificial intelligence in a physics-based game are dealt with a combination of traditional imperative programming and declarative programming, used for modeling discrete knowledge about the game and the current situation. In particular, we make use of HEX programs, which are an extension of answer set programming (ASP) programs toward integration of external computation sources, such as 2-D physics simulation tools.

关键词： Angry Birds answer set programming (ASP) artificial intelligence competition computational logic declarative programming knowledge representation and reasoning physics-based games

来源：评论

学校读者我要写书评

暂无评论

Dynamic data-driven learning for self-healing avionics

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第1期22卷 2187-2210页

作者： Imai, Shigeru Chen, Sida Zhu, Wennan Varela, Carlos A. Rensselaer Polytech Inst Dept Comp Sci 110 Eighth St Troy NY 12180 USA

In sensor-based systems, spatio-temporal data streams are often related in non-trivial ways. For example in avionics, while the airspeed that an aircraft attains in cruise phase depends on the weight it carries, it also depends on many other factors such as engine inputs, angle of attack, and air density. It is therefore a challenge to develop failure models that can help recognize errors in the data, such as an incorrect fuel quantity or an incorrect airspeed. In this paper, we present a highly-declarative programming framework that facilitates the development of self-healing avionics applications, which can detect and recover from data errors. Our programming framework enables specifying expert-created failure models using error signatures, as well as learning failure models from data. To account for unanticipated failure modes, we propose a new dynamic Bayes classifier, that detects outliers and upgrades them to new modes when statistically significant. We evaluate error signatures and our dynamic Bayes classifier for accuracy, response time, and adaptability of error detection. While error signatures can be more accurate and responsive than dynamic Bayesian learning, the latter method adapts better due to its data-driven nature.

关键词： Data streaming Spatio-temporal data declarative programming Linear regression Bayesian statistics

来源：评论

学校读者我要写书评

暂无评论

On-demand strategy annotations revisited: An improved on-demand evaluation strategy

引用

THEORETICAL COMPUTER SCIENCE 2010年第2期411卷 504-541页

作者： Alpuente, M. Escobar, S. Gramlich, B. Lucas, S. TU Valencia DSIC Valencia Spain TU Wien Fak Informat Vienna Austria

in functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations that specify (the order in) which subterms are evaluated. Syntactically, strategy annotations are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index prescribes the evaluation of an argument whereas a negative index means "evaluation on-demand". These on-demand indices have been proposed to support laziness in OBJ-Iike languages. While strategy annotations containing only natural numbers have been implemented and investigated to some extent (regarding, for example, termination, confluence, and completeness), fully general annotations (including positive and negative indices) have been disappointingly under-explored to date. In this paper, we first point out a number of problems of current proposals for handling on-demand strategy annotations. Then, we propose a solution to these problems by keeping an accurate track of annotations along the evaluation sequences. We formalize this solution as a suitable extension of the evaluation strategy of OBJ-Iike languages (which only consider annotations given as natural numbers) to on-demand strategy annotations. Our on-demand evaluation strategy (ODE) overcomes the drawbacks of previous proposals and also has better computational properties. For instance, we show how to use this strategy for computing (head-)normal forms. We also introduce a transformation which allows us to prove the termination of the new evaluation strategy by using standard rewriting techniques. Finally, we present two interpreters of the new strategy together with some encouraging experiments which demonstrate the usefulness of our approach. (C) 2009 Elsevier B.V. All rights reserved.

关键词： declarative programming Demandedness Lazy evaluation OBJ On-demand strategy annotations

来源：评论

学校读者我要写书评

暂无评论

Iterative multimodal processes scheduling

引用

ANNUAL REVIEWS IN CONTROL 2014年第1期38卷 113-122页

作者： Bocewicz, Grzegorz Nielsen, Izabela Banaszak, Zbigniew Koszalin Univ Technol Dept Comp Sci & Management PL-75453 Koszalin Poland Aalborg Univ Dept Mech & Mfg Engn Aalborg Denmark Warsaw Univ Technol Dept Business Informat PL-02524 Warsaw Poland

The paper considers the problem of Automated Guided Vehicles (AGVs) fleet scheduling subject to the right match-up of local cyclic acting AGV schedules to given workpiece machining schedules. The main contribution of this work is the solution to a constraint satisfaction problem aimed at AGVs fleet match-up scheduling while taking into consideration assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS's material handling and production routes of simultaneously manufactured work orders as well as cyclic schedules of concurrently manufactured product types, the goal is to provide a declarative model enabling multimodal processes, i.e. employing AGVs, hoists, lifts, etc. demand-responsible scheduling of transportation/handling services. An algebra-like driven approach to cyclic scheduling based on step-by-step composition of multimodal transportation network sub-structures is proposed. Results of computational experiments assessing scalability of the method provided are presented as well. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： ITERATIVE methods (Mathematics) AUTOMATED guided vehicle systems COMPUTER networks SCALABILITY (Systems engineering) declarative programming NUMERICAL analysis COMPUTER networks -- Monitoring

来源：评论

学校读者我要写书评

暂无评论

Optimisation of language-integrated queries by query unnesting

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2017年第Part2期47卷 131-150页

作者： Kowalski, Tomasz Marek Adamus, Radoslaw Lodz Univ Technol Inst Appl Comp Sci Ul Stefanowskiego 18-22 PL-90924 Lodz Poland

Native functional-style querying extensions for programming languages (e.g., LINQ or Java 8 streams) are widely considered as declarative. However, their very limited degree of optimisation when dealing with local collection processing contradicts this statement. We show that developers constructing complex LINQ queries or combining queries expose themselves to the risk of severe performance deterioration. For an inexperienced programmer, a way of getting an appropriate query form can be too complicated. Also, a manual query transformation is justified by the need of improving performance, but achieved at the expense of reflecting an actual business goal. As a result, benefits from a declarative form and an increased level of abstraction are lost. In this paper, we claim that moving of selected methods for automated optimisation elaborated for declarative query languages to the level of imperative programming languages is possible and desired. Our approach is based on the assumption that programmer is able distinguish whether a language-integrated query is intentionally used to introduce some side-effects or its sole purpose is to only query the data. We propose two optimisation procedures through query unnesting designed to avoid unnecessary multiple calculations in collection-processing constructs based on higher-order functions. We have implemented and verified this idea as a simple proof-of-concept LINQ optimiser library. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Program optimisation programming languages Term rewriting declarative programming Higher-order functions LINQ Query decorrelation

来源：评论

学校读者我要写书评

暂无评论

Effectively solving NP-SPEC encodings by translation to ASP

引用

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE 2015年第5期27卷 577-601页

作者： Alviano, Mario Faber, Wolfgang Univ Calabria Dept Math & Comp Sci I-87036 Cosenza Italy Univ Huddersfield Sch Comp & Engn Huddersfield HD1 3DH W Yorkshire England

NP-SPEC is a language for specifying problems in NP in a declarative way. Despite the fact that the semantics of the language was given by referring to Datalog with circumscription, which is very close to answer set programming (ASP), so far the only existing implementations are by means of (ECLPSe)-P-i Prolog and via Boolean satisfiability solvers. In this paper, we present translations from NP-SPEC to ASP, and provide an experimental evaluation of existing implementations and the proposed translations into ASP using various ASP solvers. The results show that translating into ASP clearly has an edge over the existing translation into SAT, which involves an intrinsic grounding process. We also argue that it might be useful to incorporate certain language constructs of NP-SPEC into mainstream ASP.

关键词： answer set programming knowledge representation NP-SPEC declarative programming

来源：评论

学校读者我要写书评

暂无评论

declarative Networking

引用

COMMUNICATIONS OF THE ACM 2009年第11期52卷 87-95页

作者： Loo, Boon Thau Condie, Tyson Garofalakis, Minos Gay, David E. Hellerstein, Joseph M. Maniatis, Petros Ramakrishnan, Raghu Roscoe, Timothy Stoica, Ion Univ Penn Philadelphia PA 19104 USA Univ Calif Berkeley Berkeley CA 94720 USA Tech Univ Crete Khania Greece Intel Res Berkeley CA USA Yahoo Res Silicon Valley CA USA Swiss Fed Inst Technol Zurich Switzerland

declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. This paper provides an introduction to basic issues in declarative networking, including language design, optimization, and dataflow execution. We present the intuition behind declarative programming of networks, including roots in Datalog, extensions for networked environments, and the semantics of long-running queries over network state. We focus on a sublanguage we call Network Datalog (NDlog), including execution strategies that provide crisp eventual consistency semantics with significant flexibility in execution. We also describe a more general language called Overlog, which makes some compromises between expressive richness and semantic guarantees. We provide an overview of declarative network protocols, with a focus on routing protocols and overlay networks. Finally, we highlight related work in declarative networking, and new declarative approaches to related problems.

关键词： declarative programming languages declarative programming COMPUTER programming COMPUTER network protocols COMPUTER networks SEMANTICS -- Network analysis

来源：评论

学校读者我要写书评

暂无评论

Secure Cloud-Edge Deployments, with Trust

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2020年 102卷 775-788页

作者： Forti, Stefano Ferrari, Gian-Luigi Brogi, Antonio Univ Pisa Dept Comp Sci Pisa Italy

Assessing the security level of IoT applications to be deployed to heterogeneous Cloud-Edge infrastructures operated by different providers is a non-trivial task. In this article, we present a methodology that permits to express security requirements for IoT applications, as well as infrastructure security capabilities, in a simple and declarative manner, and to automatically obtain an explainable assessment of the security level of the possible application deployments. The methodology also considers the impact of trust relations among different stakeholders using or managing Cloud-Edge infrastructures. A lifelike example is used to showcase the prototyped implementation of the methodology. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Secure application deployment declarative programming Probabilistic reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：