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

MICROPROCESSING AND MICROprogramming 1988年第1-5期24卷 663-672页

作者： KURMANN, H LENT, B MARTI, R SWISS FED INST TECHNOL CH-8092 ZURICHSWITZERLAND GROSSENBACHER ELEKTR AG ST GALLENSWITZERLAND

The programming approach presented is part of a research project. The objective of this project is an evaluation whether at given technology a better price/performance ratio of a machine control system may be reached if nonconventional architecture and programming approaches are adopted. The analysis of the specifics of machine embedded control systems led to the concept of an or-ed dataflow architecture. This paper concerns the programming aspects of a control system based on such a novel architecture.

关键词： Embedded Control Systems Embedded Control Systems programming Dataflow OR-ed Dataflow declarative programming Grinding Machine Control System

来源：评论

学校读者我要写书评

暂无评论

declarative programming of integrated peer-to-peer and Web based systems: the case of Prolog

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2006年第4期79卷 523-536页

作者： Loke, SW Monash Univ Sch Comp Sci & Software Engn Melbourne Vic 3145 Australia

Web and peer-to-peer systems have emerged its popular areas in distributed computing, and their integrated usage permits the benefits of both to be exploited. While much work in these areas have utilized the imperative programming paradigm, the need for declarative programming paradigms is increasingly being recognized, not only for the often cited advantages such as a higher level of abstraction and specialized language features, but also to tackle the querying and manipulation of knowledge and reasoning with semantics that will be the mainstay of the proposed next generation of the Web and peer-to-peer computing. This paper presents all approach towards integrative use of the Web and peer-to-peer systems within it declarative programming paradigm. We contend that logic programming can be useful in peer-to-peer computing, especially for querying and representing knowledge shared over peer networks, and for scripting applications that involve sophisticated search behaviour over peer networks. As an example of peer-to-peer querying expressed in a logic programming language, we propose a simple extension of Prolog, which we call LogicPeer, to enable goal evaluation over peers in a peer network. Using LogicPeer, we outline how a peer-to-peer version of a Yahoo-like system can be built and queried, and several other applications that involve decentralized knowledge sharing. We then show how LogicPeer can be used with Logic Web, a Prolog extension to access Web pages, thereby integrating peer-to-peer querying and Web querying in a common declarative framework. (c) 2005 Elsevier Inc. All rights reserved.

关键词： Prolog integration logic programming Web computing peer-to-peer computing declarative programming

来源：评论

学校读者我要写书评

暂无评论

declarative programming for agent applications

引用

AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2011年第2期23卷 224-272页

作者： Lloyd, J. W. Ng, K. S. Australian Natl Univ Coll Engn & Comp Sci Canberra ACT Australia

This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic programming idioms, higher-order functions, modal computation, probabilistic computation, and some theorem-proving capabilities. The need for these features is motivated and examples are given to illustrate the central ideas.

关键词： declarative programming Multi-agent systems Multi-modal logic Higher-order logic Modal programming Probabilistic programming

来源：评论

学校读者我要写书评

暂无评论

declarative programming with Intensional Sets in Java Using JSetL

引用

COMPUTER JOURNAL 2023年第3期66卷 763-784页

作者： Cristia, Maximiliano Fois, Andrea Rossi, Gianfranco Univ Nacl Rosario Rosario Argentina CIFASIS Rosario Argentina Univ Parma Parma Italy

Intensional sets are sets given by a property rather than by enumerating their elements. In a previous work, we have proposed a decision procedure for a first-order logic language which provides restricted intensional sets (RISs), i.e. a sub-class of intensional sets that are guaranteed to denote finite-though unbounded-sets. In this paper, we show how RIS can be exploited as a convenient programming tool also in a conventional setting, namely the imperative O-O language Java. We do this by considering a Java library, called JSetL, that integrates the notions of logical variable, (set) unification and constraints that are typical of constraint logic programming languages into the Java language. We show how JSetL is naturally extended to accommodate for RIS and RIS constraints and how this extension can be exploited;on the one hand, to support a more declarative style of programming and, on the other hand, to effectively enhance the expressive power of the constraint language provided by the library.

关键词： Java JSetL declarative programming set programming logic programming constraint programming set theory set constraint

来源：评论

学校读者我要写书评

暂无评论

declarative programming Approach for Fake Review Detection 15

Declarative Programming Approach for Fake Review Detection

引用

15th International Workshop on Semantic and Social Media Adaptation and Personalization (SMAP)

作者： Jnoub, Nour Klas, Wolfgang Univ Vienna Res Grp Multimedia Informat Syst Vienna Austria

ISBN: (数字)9781728159195

ISBN: (纸本)9781728159195

Online reviews play an essential role in our daily life. Thus, approaches for detecting fake reviews are of high demand. This paper presents an approach to detect fake reviews incorporating the behavior of authors of reviews combined with properties derived from the content of their reviews. We aim to design a white-box approach which is becoming a major requirement nowadays in the industry. This is due to the fact that there are increasing social concerns about decisions made based on personal information. In other words, we seek to design a white-box model that can let users understand what is going on regarding their personal data. In contrast to blackbox models, such as deep-learning that are hard to be explained in general. Consequently, we propose a rule-based fake review detection system using Answer Set programming (ASP) which is a powerful tool to declare malicious behavior patterns specified via a variety of constraints. This way we can create powerful models that combine, e.g., information about the number of reviews, the number of dislikes, the analysis of the points in time reviews have been written, qualitative properties of the content based on similarity measures and derived classification of reviews and products. Such models encode the problem phrased "which reviews are to be considered genuine, fake, or need to be investigated further on" and can be used to compute an optimal solution by applying ASP techniques.

关键词： Online Fake Review Detection Answer Set programming declarative programming

来源：评论

学校读者我要写书评

暂无评论

An approach to declarative programming based on a rewriting logic

引用

JOURNAL OF LOGIC programming 1999年第1期40卷 47-87页

作者： González-Moreno, JC Hortalá-González, MT López-Fraguas, FJ Rodríguez-Artalejo, M Univ Complutense Madrid Fac Matemat Dept Sistemas Informat & prog E-28040 Madrid Spain

We propose an approach to declarative programming which integrates the functional and relational paradigms by taking possibly non-deterministic lazy functions as the fundamental notion. Classical equational logic does not supply a suitable semantics in a natural way. Therefore, we suggest to view programs as theories in a constructor-based conditional rewriting logic. We present proof calculi and a model theory for this logic, and we prove the existence of free term models which provide an adequate intended semantics for programs. We develop a sound and strongly complete lazy narrowing calculus, which is able to support sharing without the technical overhead of graph rewriting and to identify safe cases for eager variable elimination. Moreover, we give some illustrative programming examples, and we discuss the implementability of our approach. (C) 1999 Elsevier Science Inc. All rights reserved.

关键词： declarative programming non-deterministic functions constructor-based rewriting logic lazy narrowing

来源：评论

学校读者我要写书评

暂无评论

GALVIS: Visualization Construction through Example-Powered declarative programming 22

GALVIS: Visualization Construction through Example-Powered D...

引用

31st ACM International Conference on Information and Knowledge Management (CIKM)

作者： Shen, Leixian Shen, Enya Tai, Zhiwei Wang, Yun Luo, Yuyu Wang, Jianmin Tsinghua Univ Beijing Peoples R China Microsoft Res Asia Beijing Peoples R China

ISBN: (纸本)9781450392365

declarative programmatic approaches are an essential modality for data visualization construction. Despite the powerful customization ability, declarative programming requires users to create charts from scratch, thus building a well-designed visualization is an effort-consuming process. In this paper, we propose leveraging examples to alleviate the problem. The use of examples plays a vital role in visualization design. Users can be allowed to browse through designs for inspiration and adapt them for their own visualizations. In this demo, we directly leverage the entire Vega/Vega-Lite example galleries as chart templates and introduce an authoring pipeline to conveniently instantiate templates with the user's data for extensible programmatic modifications. Finally, we build GALVIS, an example-powered declarative programming tool for visualization construction, enabling efficient declarative programming and retaining the full spectrum of Vega/Vega-Lite characteristics.

关键词： Visual Analysis Authoring Example declarative programming

来源：评论

学校读者我要写书评

暂无评论

Towards declarative programming for Sensor-Based Situation-Aware Applications: the LogicCAP Approach

Towards Declarative Programming for Sensor-Based Situation-A...

引用

International Conference on Intelligent Sensors, Sensor Networks and Information Processing

作者： Loke, Seng W. La Trobe Univ Dept Comp Sci & Comp Engn Bundoora Vic 3086 Australia

ISBN: (纸本)9781424438228

This paper discusses an implementation of a declarative style of programming for sensor-based applications, involving the acquisition and aggregation of context. We describe an implementation of LogicCAP integrating Prolog with the ContextToolkit, and its on-going extensions, considering applications in the mobile environment, distributed evaluation, and dynamic sensor binding issues. We also propose LogicCAP as a declarative language for context (and sensor) mashups with the situation as the aggregating abstraction.

关键词： declarative programming declarative language Mobile Environment dynamic sensor PLUG-IN PROLOG

来源：评论

学校读者我要写书评

暂无评论

A Generalized Search Construct for Imperative Languages to Facilitate declarative programming

引用

INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING 2022年第3期16卷 315-338页

作者： Smith, James Henderson, Chris Bansal, Ajay Arizona State Univ Sch Comp & Augmented Intelligence 1151 S Forest Ave Tempe AZ 85282 USA

Search is one of the more common strategies used by problem-solving agents. For many hard problems, a backtracking search can be the most effective approach for finding a solution. Logic programming languages provide, as a core feature of the language, the mechanics for the search behind the scenes without requiring the user to specify the algorithm. However, this functionality has been generally left out of the core features of imperative programming languages. In this work, we propose integrating a search agent into an imperative programming language through a search construct in the syntax. By doing so, our intention is that the user may apply a declarative approach to problem solving. We extend the Go programming language with this search construct and develop an agent to perform the search. The algorithm behind the search is implicitly handled by the agent. We demonstrate the effectiveness of this search construct through solutions to an exhaustive search over a file-system, the NQueens problem, and the monkey and the bananas problem. To evaluate the performance of our agent, we compare its runtime performance against two of the common Prolog implementations, SWI-Prolog and GNU Prolog.

关键词： declarative programming imperative programming problem-solving agent search agent backtracking search

来源：评论

学校读者我要写书评

暂无评论

The Prolog Debugger and declarative programming 29th

The Prolog Debugger and Declarative Programming

引用

29th International Conference on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci Warsaw Poland Linkoping Univ IDA Linkoping Sweden

ISBN: (纸本)9783030452599;9783030452605

Logic programming is a declarative programming paradigm. programming language Prolog makes logic programming possible, at least to a substantial extent. However the Prolog debugger works solely in terms of the operational semantics. So it is incompatible with declarative programming. This report discusses this issue and tries to find how the debugger may be used from the declarative point of view. The results are rather not encouraging. Also, the box model of Byrd, used by the debugger, is explained in terms of SLD-resolution.

关键词： declarative diagnosis/Algorithmic debugging Prolog declarative programming Program correctness Program completeness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：