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

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

来源：评论

学校读者我要写书评

暂无评论

Alma-0: An imperative language that supports declarative programming

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1998年第5期20卷 1014-1066页

作者： Apt, KR Brunekreef, J Partington, V Schaerf, A CWI NL-1090 GB Amsterdam Netherlands Univ Amsterdam Dept Math Comp Sci Phys & Astron NL-1018 TV Amsterdam Netherlands Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

We describe here an implemented small programming language, called Alma-0, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These additions encourage declarative programming and make it a more attractive vehicle for problems that involve search. We illustrate the use of Alma-0 by presenting solutions to a number of classical problems, including alpha-beta search, STRIPS planning, knapsack, and Eight Queens. These solutions are substantially simpler than their counterparts written in the imperative or in the logic programming style and can be used for different purposes without any modification. We also discuss here the implementation of Alma-0 and an operational, executable, semantics of a large subset of the language.

关键词： languages declarative programming imperative programming search

来源：评论

学校读者我要写书评

暂无评论

JSetL: a Java library for supporting declarative programming in Java

引用

SOFTWARE-PRACTICE & EXPERIENCE 2007年第2期37卷 115-149页

作者： Rossi, G. Panegai, E. Poleo, E. Univ Parma Dipartimento Matemat I-43100 Parma Italy

In this paper we present a Java library-called JSetL-that offers a number of facilities to support declarative programming such as those usually found in logic or functional declarative languages: logical variables, list and set data structures (possibly partially specified), unification and constraint solving over sets, non-determinism. The paper describes the main features of JSetL and it shows, through a number of simple examples, how these features can be exploited to support a real declarative programming style in Java. Copyright (c) 2006 John Wiley & Sons, Ltd.

关键词： declarative programming constraint programming set constraints Java non-determinism

来源：评论

学校读者我要写书评

暂无评论

A new framework for declarative programming

引用

THEORETICAL COMPUTER SCIENCE 2003年第1-3期300卷 91-160页

作者： Finkelstein, SE Freyd, P Lipton, J Wesleyan Univ Middletown CT 06459 USA McGill Univ Montreal PQ H3A 2T5 Canada Univ Ottawa Ottawa ON K1N 6N5 Canada Univ Penn Philadelphia PA 19104 USA

We propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over T-categories: finite product categories with canonical structure. Constraint information is directly built-in to the notion of signature via categorical syntax. Many-sorted equational are a special case of the formalism which combines features of uniform logic programming languages (moduels and hypothetical implication) with those of constraint logic progamming. Using the cannoical structure supplied by T-categories, we define a diagrammatic generalization of formulas, goals, programs and resolution proofs up to equality (rather than just up to isomorphism). We extend the Kowalski-van Emden fixed point interpretation, a cornerstone of declarative semantics, to an operational, non-ground, categorical semantics based on indexing over sorts and programs. We also introduce a topos-theoretic declarative semantics and show soundness and completeness of resolution proofs and of a sequent calculus over the categorical signature. We conclude with a discussion of semantic perspectives on unifortit logic programming. (C) 2002 Published by Elsevier Science B.V.

关键词： Logic programs Abstract interpretation Semantics semiotics Semantics Soundness syntax Logic programming analysis programme declarative programming Resolving power

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A CASE-STUDY COMPARISON OF 4 declarative programming-LANGUAGES

引用

SOFTWARE-PRACTICE & EXPERIENCE 1990年第1期20卷 49-65页

作者： FLECK, AC Department of Computer Science University of Iowa Iowa City Iowa 52242 U.S.A.

A case study comparison is made of four declarative programming languages: Miranda, 1 Miranda is a trademark of Research Software Ltd. Fp, Equations and Prolog. The case study is used as a vehicle to assess both expressiveness and performance aspects of these languages. In expressive power, Miranda is judged to be superior, Equations and Prolog are rated about even in second place, and Fp is judged least expressive. Performance was quite poor for all the available implementations. Reasons for this are explored and the implications are discussed.

关键词： declarative programming Expressiveness Performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：