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

Mexican international Conference on Artificial Intelligence, MICAI

作者： Manuel Hern´ndez

the event calculus is a logic-based formalism for dealing with temporal reasoning concerns. Erlang is a functional programming language designed from the ground up for tackling distributed programming problems. In this paper, it is shown that the event calculus is a suitable tool for designing and analyzing distributed systems written as Erlang programs.

关键词： Calculus Iris Servers Message passing programming Education Communication channels

来源：评论

学校读者我要写书评

暂无评论

Position-based broadcast algorithm in mobile ad-hoc networks

Position-based broadcast algorithm in mobile ad-hoc networks

引用

international symposium on programming and Systems (ISPS)

作者： Abderezak Touzene Khaled Day Bassel Arafeh Nasser Al-Zidi Computer Science Department Sultan Qaboos University Oman

the paper proposes a new position-based broadcast algorithm for mobile ad-hoc networks (MANETs) called PBB. It shows how communication methods originally designed for wired multiprocessor interconnection networks can be used in MANETs. PBB is based on a logical 2-dimensional grid view of the geographical region of the MANET. PBB makes use of a known construction of spanning trees in the grid multiprocessor interconnection network. To the best of our knowledge, PBB is the first protocol that uses cell-based spanning trees of the grid to perform broadcasting in MANETs. In this study we derived analytical results for the delivery ratio of PBB protocol and the number of rebroadcast messages per broadcast operation.

关键词： Protocols Ad hoc networks logic gates Mobile computing Mobile communication Broadcasting Routing

来源：评论

学校读者我要写书评

暂无评论

A semi-formal approach for Java programs verification

A semi-formal approach for Java programs verification

引用

international symposium on programming and Systems (ISPS)

作者： Toufik Benouhiba Hanene Cheriet Laboratoire LRI Department of computer science University of Badji Mokhtar Annaba Algeria

Software testing approaches are the most used techniques for programs verification because they are simple and fast. However, because of their lack of exhaustiveness, they cannot be considered as an alternative to formal verification approaches. On the other hand, these ones ensure total correction but with an important cost. In addition, they cannot operate well if the verified model is not consistent with the implementation. this paper proposes a new verification approach that combines tests and formal verification. the new approach, called SEmi-FORmal verification of Java programs or simply SE4J, uses tests to build a formal probabilistic model. this one will be formally verified in order to detect possible design errors in the program. the proposed approach permits also to compare two programs and validate test cases. the paper presents some obtained results over a case study and explains possible uses of the proposed approach.

关键词： Object oriented modeling Instruments Formal verification Testing Markov processes Probabilistic logic Analytical models

来源：评论

学校读者我要写书评

暂无评论

A methodology of Collaborative Requirements Validation in a cooperative environment

A methodology of Collaborative Requirements Validation in a ...

引用

international symposium on programming and Systems (ISPS)

作者： Maalem Derdour Sourour Nacereddine Zarour Laboratoire LIRE Département d'informatique ENS Constantine France Laboratoire LIRE Département d'informatique Université Mentouri Constantine Algeria

the increasing complexity of systems and the interdisciplinary necessary to their realization push the organizations to be resorted in teams and thus they must cooperate, because it seems to constitute a means to improve the quality and the time of realizing the products. In this paper, we are interested to the validation phase in the process of requirements engineering in a cooperative context. the cooperation is not a recent practice because people cooperate since always. However, the cooperation, such as it reappears nowadays, is not simply a team work, it wants to be structured and organized in order to produce better results. To this purpose we propose a methodology which presents a collaborative approach of the requirements validation process based on the concepts of competences and multi-viewpoints. the objective of this methodology is twofold; first it increases the quality of the software product (i.e. it leads to better match users' needs) and it reduces the complexity of the validation task.

关键词： Organizations Programmable logic arrays Software

来源：评论

学校读者我要写书评

暂无评论

Manifold answer-set programs and their applications

引用

symposium on Constructive Mathematics in Computer Science in honor of Michael Gelfond on the occasion of his 65th birthday, 2010

作者： Faber, Wolfgang Woltran, Stefan University of Calabria Italy Vienna University of Technology Austria

ISBN: (纸本)9783642208317

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P 1 as input to another program P 2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P 1 currently has to be decoupled from the evaluation of P 2 using an intermediate step which collects the desired consequences of P 1 and provides them as input to P 2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies on rewriting P 1 into a so-called manifold program, which allows for accessing all desired consequences of P 1 within a single answer set. then, this manifold program can be evaluated jointly with P 2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As applications, we present encodings for computing the ideal extension of an abstract argumentation framework and for computing world views of a particular class of epistemic specifications. © Springer-Verlag Berlin Heidelberg 2011.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

EcoCast: Interactive, object-oriented macroprogramming for networks of ultra-compact wireless sensor nodes

EcoCast: Interactive, object-oriented macroprogramming for n...

引用

international symposium on Information Processing in Sensor Networks (IPSN)

作者： Yi-Hsuan Tu Yen-Chiu Lee Yi-Wei Tsai Pai H. Chou Ting-Chou Chien Department of Computer Science National Tsing Hua University Hsinchu Taiwan Center of Embedded Computer Systems University of California Irvine CA USA

EcoCast is an execution framework for macroprogramming of wireless sensor networks. Users access sensor nodes as dynamic objects in Python without being concerned with network protocols or data types. EcoCast extends Python's functional programming primitives map(), reduce(), and filter() to macroprogramming at native speed by patching the firmware transparently without rebooting, and without requiring most users to write code in C or assembly. this demo shows the use of EcoCast batch commands on wireless light controllers, which are composed of EcoSpire nodes connected to relay switches. Starting from only EcoCast firmware, we show incremental code generation and firmware patching, by loading necessary sensor drivers on demand. the composition of sensing value checking and light-switch actions shows how the firmware can be customized and programmed as a result of such an interactive session without writing a single line of C code.

关键词： Wireless sensor networks Wireless communication Transceivers functional programming Data structures Syntactics Computers

来源：评论

学校读者我要写书评

暂无评论

Manifold answer-set programs and their applications

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6565 LNAI卷 44-63页

作者： Faber, Wolfgang Woltran, Stefan University of Calabria Italy Vienna University of Technology Austria

ISBN: (纸本)9783642208317

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P1 as input to another program P 2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P1 currently has to be decoupled from the evaluation of P2 using an intermediate step which collects the desired consequences of P1 and provides them as input to P2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies on rewriting P1 into a so-called manifold program, which allows for accessing all desired consequences of P 1 within a single answer set. then, this manifold program can be evaluated jointly with P2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As applications, we present encodings for computing the ideal extension of an abstract argumentation framework and for computing world views of a particular class of epistemic specifications. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Beluga: programming with Dependent Types, Contextual Data, and Contexts 10

Beluga: Programming with Dependent Types, Contextual Data, a...

引用

10th international symposium on functional and logic programming

作者： Pientka, Brigitte McGill Univ Montreal PQ Canada

ISBN: (纸本)9783642122507

the logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code and mechanizing metatheory of programming languages. However, incorporating LF technology into functional programming to allow programmers to specify and reason about formal guarantees of their programs from within the programming language itself has been a major challenge. In this paper, we present an overview of Beluga, a framework for programming and reasoning with formal systems. It supports specifying formal systems in LF and it also provides a dependently typed functional language that supports analyzing and rnanipulating LF data via pattern matching. A distinct feature of Beluga is its direct support for reasoning with contexts and contextual objects. Taken together these features lead to a powerful language which supports writing compact and elegant proofs.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

A Pearl on SAT Solving in Prolog 10

A Pearl on SAT Solving in Prolog

引用

10th international symposium on functional and logic programming

作者： Howe, Jacob M. King, Andy City Univ London Dept Comp London EC1V 0HB England Univ Kent Sch Comp Canterbury CT2 7NF Kent England

A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant u... 详细信息

ISBN: (纸本)9783642122507

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Applying Constraint logic programming to SQL Test Case Generation 10

Applying Constraint Logic Programming to SQL Test Case Gener...

引用

10th international symposium on functional and logic programming

作者： Caballero, Rafael Garcia-Ruiz, Yolanda Saenz-Perez, Fernando Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642122507

We present a general framework for generating SQL query test cases using Constraint logic programming. Given a database schema and a SQL view defined in terms of other views and schema tables, our technique generates automatically a set of finite domain constraints whose solutions constitute the test database instances. the soundness and correctness of the technique w.r.t. the semantics of Extended Relational Algebra is proved. Our setting has been implemented in an available tool covering a wide range of SQL queries, including views, subqueries, aggregates and set operations.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：