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

12th Nordic Conference on Human-Computer Interaction (NordiCHI)

作者： Borowski, Marcel Klokmose, Clemens N. Aarhus Univ Aarhus Denmark

ISBN: (纸本)9781450394482

Today's software often comes in the form of applications: rigid turn-key products, which usually cannot be modified by their users. Computational media is an alternative vision of software that is inherently extensible and collaborative. With the Webstrates platform, we started to explore computational media almost a decade ago. Recently, we added the Codestrates v2 development platform and the Varv programming model to Webstrates. Together the three components enable the creation of inherently extensible and collaborative software on the web. In this demonstration, we introduce these three components and showcase their potential in a series of examples.

关键词： Computational Media Webstrates Codestrates Malleability declarative programming

来源：评论

学校读者我要写书评

暂无评论

S-Semantics-an Example 1

引用

31st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci Ul Jana Kazimierza 5 PL-01248 Warsaw Poland Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

ISBN: (数字)9783030988692

ISBN: (纸本)9783030988692;9783030988685

The s-semantics makes it possible to explicitly deal with variables in program answers. So it seems suitable for programs using nonground data structures, like open lists. However it is difficult to find published examples of using the s-semantics to reason about particular programs. Here we apply s-semantics to prove correctness and completeness of Fruhwirth's n queens program. This is compared with a proof, published elsewhere, based on the standard semantics and Herbrand interpretations.

关键词： Logic programming s-semantics Program correctness Program completeness declarative programming Specification

来源：评论

学校读者我要写书评

暂无评论

declarative Smart Contracts 2022

Declarative Smart Contracts

引用

30th ACM Joint European Software Engineering Conference / Symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Chen, Haoxian Whitters, Gerald Amiri, Mohammad Javad Wang, Yuepeng Loo, Boon Thau Univ Penn Philadelphia PA 19104 USA Simon Fraser Univ Burnaby BC Canada

ISBN: (纸本)9781450394130

This paper presents DeCon, a declarative programming language for implementing smart contracts and specifying contract-level properties. Driven by the observation that smart contract operations and contract-level properties can be naturally expressed as relational constraints, DeCon models each smart contract as a set of relational tables that store transaction records. This relational representation of smart contracts enables convenient specification of contract properties, facilitates run-time monitoring of potential property violations, and brings clarity to contract debugging via data provenance. Specifically, a DeCon program consists of a set of declarative rules and violation query rules over the relational representation, describing the smart contract implementation and contract-level properties, respectively. We have developed a tool that can compile DeCon programs into executable Solidity programs, with instrumentation for run-time property monitoring. Our case studies demonstrate that DeCon can implement realistic smart contracts such as ERC20 and ERC721 digital tokens. Our evaluation results reveal the marginal overhead of DeCon compared to the open-source reference implementation, incurring 14% median gas overhead for execution, and another 16% median gas overhead for run-time verification.

关键词： Smart contracts declarative programming Run-time verification

来源：评论

学校读者我要写书评

暂无评论

FOLASP: FO(.) as Input Language for Answer Set Solvers

引用

THEORY AND PRACTICE OF LOGIC programming 2021年第6期21卷 785-801页

作者： Van Dessel, Kylian Devriendt, Jo Vennekens, Joost Katholieke Univ Leuven Dept Comp Sci De Nayer Campus St Katelijne Waver Belgium Katholieke Univ Leuven Inst AI Leuven AI Leuven Belgium

Technological progress in Answer Set programming (ASP) has been stimulated by the use of common standards, such as the ASP-Core-2 language. While ASP has its roots in nonmonotonic reasoning, efforts have also been made to reconcile ASP with classical first-order (FO) logic. This has resulted in the development of FO(.), an expressive extension of FO, which allows ASP-like problem solving in a purely classical setting. This language may be more accessible to domain experts already familiar with FO and may be easier to combine with other formalisms that are based on classical logic. It is supported by the IDP inference system, which has successfully competed in a number of ASP competitions. Here, however, technological progress has been hampered by the limited number of systems that are available for FO(.). In this paper, we aim to address this gap by means of a translation tool that transforms an FO(.) specification into ASP-Core-2, thereby allowing ASP-Core-2 solvers to be used as solvers for FO(.) as well. We present experimental results to show that the resulting combination of our translation with an off-the-shelf ASP solver is competitive with the IDP system as a way of solving problems formulated in FO(.).

关键词： declarative programming first order logic answer set programming

来源：评论

学校读者我要写书评

暂无评论

declarative Application Management in the Fog A Bacteria-Inspired Decentralised Approach

引用

JOURNAL OF GRID COMPUTING 2021年第4期19卷 1-24页

作者： Brogi, Antonio Forti, Stefano Guerrero, Carlos Lera, Isaac Univ Pisa Dept Comp Sci Pisa Italy Univ Balearic Isl Dept Math & Comp Sci Palma De Mallorca Spain

Orchestrating next-gen applications over heterogeneous resources along the Cloud-IoT continuum calls for new strategies and tools to enable scalable and application-specific managements. Inspired by the self-organisation capabilities of bacteria colonies, we propose a declarative, fully decentralised application management solution, targeting pervasive opportunistic Cloud-IoT infrastructures. We present a customisable declarative implementation of the approach and validate its scalability through simulation over motivating scenarios, also considering end-user's mobility and the possibility to enforce application-specific management policies for different (classes of) applications.

关键词： Fog computing User mobility declarative programming Bio-inspired solution Cloud-IoT continuum

来源：评论

学校读者我要写书评

暂无评论

declarative Data Analytics: A Survey

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2021年第6期33卷 2392-2411页

作者： Makrynioti, Nantia Vassalos, Vasilis Athens Univ Econ & Business Dept Informat Athens 10434 Greece

The area of declarative data analytics explores the application of the declarative paradigm on data science and machine learning. It proposes declarative languages for expressing data analysis tasks and develops systems which optimize programs written in those languages. The execution engine can be either centralized or distributed, as the declarative paradigm advocates independence from particular physical implementations. The survey explores a wide range of declarative data analysis frameworks by examining both the programming model and the optimization techniques used, in order to provide conclusions on the current state of the art in the area and identify open challenges.

关键词： Task analysis Data analysis programming Optimization Mathematical model Analytical models Prediction algorithms declarative programming data science machine learning large-scale analytics

来源：评论

学校读者我要写书评

暂无评论

Type, pad, and place: Avoiding data leaks in Cloud-IoT FaaS orchestrations 22

Type, pad, and place: Avoiding data leaks in Cloud-IoT FaaS ...

引用

22nd IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGrid)

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

ISBN: (纸本)9781665499569

Placing applications composed as orchestrated serverless functions onto Cloud-IoT infrastructures is a challenging problem as it must consider hardware, software, network Quality of Service, and service interactions constraints. In this paper, we propose a novel declarative methodology that handles all of the above, also relying on information-flow analyses and padding techniques to prevent information leaks through side channels. A motivating use case from augmented reality is used to showcase the open-source prototype implementing our proposal.

关键词： FaaS orchestrations information-flow security Cloud-IoT continuum declarative programming

来源：评论

学校读者我要写书评

暂无评论

declarative Implementations of Genetic Algorithms in Control Network programming 19

Declarative Implementations of Genetic Algorithms in Control...

引用

20th Bulgarian International Computer Science and Technologies Conference (CompSysTech)

作者： Golemanova, Emilia Golemanov, Tzanko Ruse Univ Comp Syst & Technol Ruse Bulgaria

ISBN: (纸本)9781450371490

The paper describes how the built-in tools for stochastic dynamic control of the computation process in a programming paradigm, named Control Network programming (CNP), could be used to achieve declarative (non-procedural) implementations of a genetic algorithm. As these implementations are very intuitive and easily programmed, CNP can be used as an excellent approach for teaching, learning and programming the basic model of the genetic algorithms. They are presented on the well-known 8-queens problem often used as an example problem for various programming techniques, including non-traditional approaches such as genetic algorithms. More specifically, the emphasis is on automatic, non-procedural modelling of certain selection operators such as roulette wheel selection and rank selection, as well as the Bernoulli trial, used in crossover and mutation operators.

关键词： Control Network programming declarative programming graphical programming genetic algorithm roulette wheel selection rank selection randomized algorithms probabilistic computation

来源：评论

学校读者我要写书评

暂无评论

Optimizing Nested Recursive Queries

引用

Proceedings of the ACM on Management of Data 2024年第1期2卷 1-27页

作者： Amir Shaikhha Dan Suciu Maximilian Schleich Hung Ngo University of Edinburgh Edinburgh United Kingdom University of Washington Seattle WA USA RelationalAI Berkeley USA

Datalog is a declarative programming language that has gained popularity in various domains due to its simplicity, expressiveness, and efficiency. But "pure" Datalog is limited to monotone queries, and cannot be used in most practical applications. For that reason, newer systems are relaxing the language by allowing non-monotone queries to be freely combined with recursion. But by departing from the elegant fixpoint semantics of pure datalog, these systems often result in inefficient query execution, for example they perform redundant computations, or use redundant storage. In this paper, we propose Temporel, a system that allows recursion to be freely combined with non-monotone operators. Temporel optimizes the program by compiling it into a novel intermediate representation that we call TempoDL. Our experimental results show that our system outperforms a state-of-the-art Datalog engine as well as a vectorized and a compiled in-memory database system for a wide range of applications from machine learning to graph processing.

关键词： declarative programming demand transformation iterative algorithms nested recursion

来源：评论

学校读者我要写书评

暂无评论

People, Ideas, and the Path Ahead 24th

People, Ideas, and the Path Ahead

引用

24th International Conference on Practical Aspects of declarative Languages, PADL 2022

作者： Balduccini, Marcello Saint Joseph’s University PhiladelphiaPA United States Elemental Cognition WiltonCT United States

ISBN: (纸本)9783030944780

While recent advances in machine learning have yielded impressive results, researchers, practitioners, and even companies are beginning to recognize that true artificial intelligence requires much more sophisticated reasoning capabilities. Knowledge representation and declarative programming are arguably in a premier position to aid in the achievement of such capabilities. In this paper, I reflect on people and ideas that have had a great influence on my view of knowledge representation and of declarative programming. Through these lenses, I will discuss what I consider to be some of the most important milestones in the evolution of the field over the past years. I will conclude my reflection with my take on what this may tell us about the path that lies ahead and about areas where research efforts may yield considerable benefits. © 2022, Springer Nature Switzerland AG.

关键词： Answer set programming declarative programming Knowledge representation Non-monotonic reasoning Practical applications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：