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

丛书名： Lecture Notes in Computer Science

1000年

作者： Ionuț Țuțu

ISBN: (数字)9783031889301

ISBN: (纸本)9783031889295

This book constitutes the thoroughly refereed post-conference proceedings of the 27th IFIP WG 1.3 international workshop on Algebraic Development Techniques, WADT 2024, held in Enschede, The Netherlands, on July 8, 2024. The 6 full papers presented in this volume were carefully reviewed and selected from 11 submissions. The contributed presentations covered a wide range of topics on the algebraic approach to system specification: from foundations of algebraic-specification languages to institutions and knowledge representation, to graph transformations, rewrite rules, process algebra, and bialgebraic frameworks, to many-logics modal systems and quantum process calculi, and to several applications to code synthesis and maintainability.

关键词： logics and Meanings of Programs Mathematical logic and Formal Languages programming Techniques

来源：评论

学校读者我要写书评

暂无评论

0.5V Bit-Line-Voltage Self-Boost-programming in Ferroelectric-NAND Flash Memory

0.5V Bit-Line-Voltage Self-Boost-Programming in Ferroelectri...

引用

IEEE international Memory workshop (IMW)

作者： Xizhen Zhang Kousuke Miyaji Mitsue Takahashi Ken Takeuchi Shigeki Sakai National Institute for Advanced Industrial Science and Technology Tsukuba Ibaraki Japan Department of Electrical Engineering and Information Systems University of Tokyo Tokyo Japan

Self-boost-programming for ferroelectric-NAND (Fe-NAND) flash memory was investigated by using a miniature memory cell array, which could reduce bit-line voltages for programming. As the best performance, 0.5V bit-line-voltage programming with 10μs-pulse width was successfully demonstrated. This study indicated that the Fe-NAND flash memory can be operated by much lower power consumption than that of a conventional floating gate (FG-) NAND.

关键词： Flash memory programming Arrays Transistors Silicon Nonvolatile memory logic gates

来源：评论

学校读者我要写书评

暂无评论

3rd international workshop on Extensions of logic programming, ELP 1992

引用

20th international Colloquium on Automata, Languages and programming, ICALP 1993

ISBN: (纸本)9783540569398

The proceedings contain 56 papers. The special focus in this conference is on Extensions of logic programming. The topics include: A new approach to making programs more reliable;searching among intervals and compact routing tables;the approximation of maximum subgraph problems;polynomially bounded minimization problems which are hard to approximate;primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover;the complexity of approximating pspace-complete problems for hierarchical specifications;problems on pairs of trees and the four colour problem of planar graphs;constructing competitive tours from local information;treewidth and pathwidth of permutation graphs;a theory of even functionals and their algorithmic applications;exact asymptotics of divide-and-conquer recurrences;optimal bounds for the change-making problem;the complexity of n-body simulation;a simple method for resolving degeneracies in delaunay triangulations;fault-tolerance and complexity;reversal-space trade-offs for simultaneous resource-bounded nondeterministic turing machines;on the computational power of discrete hopfield nets;on randomized versus deterministic computation;lower bounds for one-way probabilistic communication complexity;maintaining discrete probability distributions optimally;computational depth and reducibility;admissible, co-finite, and hypersimple languages;inclusion is undecidable for pattern languages;new decidability results concerning two-way counter machines and applications;cobham's theorem seen through büchi's theorem;logical definability on infinite traces;algebras for classifying regular tree languages and an application to frontier testability;finite automata as characterizations of minor closed tree families and on distributed algorithms in a broadcast domain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Runtime Model Checker for Dynamic Software Based on Aspect-Oriented programming

A Runtime Model Checker for Dynamic Software Based on Aspect...

引用

international workshop on Intelligent Systems and Applications, ISA

作者： Hongwei Yang School of Software Yunnan University Kunming China

Increasingly, more and more software systems must make dynamic reconfiguration of their architectures at runtime to adapt to the changing conditions. The runtime verification of architecture evolution is necessary to guarantee the conformance to the specification. In this paper, we propose a runtime model checker that supports dynamic reconfiguration of software architectures taking advantage of linear temporal logic and aspect-oriented programming. The runtime model checker is a concurrent thread with the execution thread of the dynamic software, and is an automaton which can accept exactly the set of executions that satisfy the given specification defined by LTL. So the proposed runtime model checker can monitor and verify the architecture evolution of a dynamic software system continuously at runtime.

关键词： Runtime Instruments Automata programming Monitoring Software systems

来源：评论

学校读者我要写书评

暂无评论

Kara: A system for visualising and visual editing of interpretations for answer-set programs 19th

Kara: A system for visualising and visual editing of interpr...

引用

19th international Conference on Applications of Declarative programming and knowledge Management, INAP 2011 and 25th workshop on logic programming, WLP 2011

作者： Kloimüllner, Christian Oetsch, Johannes Pührer, Jörg Tompits, Hans Technische Universität Wien Favoritenstraße 9-11 Vienna1040 Austria Institut für Informationssysteme 184/3 Technische Universität Wien Favoritenstraße 9-11 Vienna1040 Austria

ISBN: (纸本)9783642415234

In answer-set programming (ASP), the solutions of a problem are encoded in dedicated models, called answer sets, of a logical theory. These answer sets are computed from the program that represents the theory by means of an ASP solver and returned to the user as sets of ground first-order literals. As this type of representation is often cumbersome for the user to interpret, tools like ASPVIZ and IDPDraw were developed that allow for visualising answer sets. The tool Kara, introduced in this paper, follows these approaches, using ASP itself as a language for defining visualisations of interpretations. Unlike existing tools that position graphic primitives according to static coordinates only, Kara allows for more high-level specifications, supporting graph structures, grids, and relative positioning of graphical elements. Moreover, generalising the functionality of previous tools, Kara provides modifiable visualisations such that interpretations can be manipulated by graphically editing their visualisations. This is realised by resorting to abductive reasoning techniques using ASP itself. Kara is part of SeaLion, an integrated development environment (IDE) for ASP. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

An abstract concept of optimal implementation

An abstract concept of optimal implementation

引用

WRS 2003, 3rd international workshop on Reduction Strategies in Rewriting and programming - Final Proceedings

作者： Khasidashvili, Zurab Glauert, John Logic and Validation Technology Intel IDC Haifa Israel School of Computing Sciences UEA Norwich NR4 7TJ United Kingdom

In previous works, we introduced Stable Deterministic Residual Structures (SDRSs), Abstract Reduction Systems with an axiomatized residual relation which model orthogonal term and graph rewriting systems, and Deterministic Family Structures (DFSs), which add an axiomatized notion of redex-family to capture known sharing concepts in the lambda-calculus and other orthogonal rewrite systems. In this paper, we introduce and study a concept of implementation of DFSs. We show that for any DFS F, its implementation FI is a non-duplicating DFSs with zig-zag as the family relation, where zig-zag is simply the symmetric and transitive closure of the residual relation on redexes with histories. Further, we show that sharing is compositional: the sharing in a DFS F can be decomposed into a weaker sharing F' (such as zig-zag) and a sharing in the implementation F'I of F' stronger than zig-zag. These results require study of the family relation in non-duplicating SDRSs. We show that zig-zag forms a family-relation in every non-duplicating SDRS, and that it is the only separable family relation in such SDRSs. © 2003 Published by Elsevier Science B.V.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Application of Inductive logic programming to Produce Emergent Behavior in an Artificial Society

Application of Inductive Logic Programming to Produce Emerge...

引用

IIAI international Conference on Advanced Applied Informatics (IIAIAAI)

作者： Keigo Komura Atsuko Mutoh Nobuhiro Inuzuka Dept. Computer Sci. & Eng. Nagoya Institute of Technology

Artificial society is a discipline to study mechanisms of social system and phenomena which the mechanisms make. Emergence is global phenomena occurred by local mechanisms, such as, by collective behavior of autonomous agents. Understanding of emergence phenomena is a challenging subject. In this paper we use the framework of inductive logic programming (ILP) for artificial society and emergence behavior study. ILP is a branch of machine learning based on logic programming and inductive inference. We investigate the possibility of ILP in artificial society study. ILP and logic programming technique are applied to representation of an artificial society model, called Sugarscape, and to rule learning for agent behavior. Although classical ILP algorithms target classification problems, the proposed algorithm grows behavior rule for an evaluation measurement. Phenomena which this paper treate is limited but we showed that ILP technique can be applied to study in the field of artificial society.

关键词： Sugar logic programming Computers Computational modeling Search problems Educational institutions Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A Process Calculus for Formally Verifying Blockchain Consensus Protocols 22nd

A Process Calculus for Formally Verifying Blockchain Consens...

引用

22nd international Conference on Applications of Declarative programming and knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on Functional and Constraint logic programming, WFLP 2019

作者： Jeltsch, Wolfgang Well-Typed London United Kingdom IOHK Hong Kong Hong Kong

ISBN: (纸本)9783030467135

Blockchains are becoming increasingly relevant in a variety of fields, such as finance, logistics, and real estate. The fundamental task of a blockchain system is to establish data consistency among distributed agents in an open network. Blockchain consensus protocols are central for performing this task. Since consensus protocols play such a crucial role in blockchain technology, several projects are underway that apply formal methods to these protocols. One such project is carried out by a team of the Formal Methods Group at IOHK. This project, in which the author is involved, aims at a formally verified implementation of the Ouroboros family of consensus protocols, the backbone of the Cardano blockchain. The first outcome of our project is the -calculus (pronounced "natural calculus"), a general-purpose process calculus that serves as our implementation language. The (formula presented)-calculus is a domain-specific language embedded in a functional host language using higher-order abstract syntax. This paper will be a ramble through the (formula presented)-calculus. First we will look at its language and its operational semantics. The latter is unique in that it uses a stack of two labeled transition systems to treat phenomena like data transfer and the opening and closing of channel scope in a modular fashion. The presence of multiple transition systems calls for a generic treatment of derived concurrency concepts. We will see how such a treatment can be achieved by capturing notions like scope opening and silent transitions abstractly using axiomatically defined algebraic structures based on functors and monads. © 2020, Springer Nature Switzerland AG.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Forgetting in managing rules and ontologies

引用

CEUR workshop Proceedings 2006年 196卷 1-16页

作者： Eiter, Thomas Ianni, Giovambattista Schindlauer, Roman Tompits, Hans Wang, Kewen Institut Für Informationssysteme 184/3 Technische Universität Wien Favoritenstrasse 9-11 A-1040 Vienna Austria School of Information and Communication Technology Griffith University Brisbane QLD 4111 Australia

The language of HEX-programs under the answer-set semantics is designed for interoperating with heterogeneous sources via external atoms and for meta-reasoning via higher-order literals in the context of the Semantic Web. As an important technique in managing knowledge bases, the notion of forgetting has received increasing interest in the knowledge-representation area. In this paper, we introduce a semantics-based theory of forgetting for HEX-programs and, in turn, for a class of OWL/rdF ontologies which allows to fully employ semantic information in managing ontologies like editing, merging, aligning, and redundancy removal. © Copyright 2006 for the individual papers by the individual authors.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

The Application of an Improved PSO Based on the Quantum Genetic Algorithm in the Submersible Path-Planning

The Application of an Improved PSO Based on the Quantum Gene...

引用

international workshop on Intelligent Systems and Applications, ISA

作者： Fei Yu Yang-lei Liu

An improved particle swarm optimization algorithm (PSO) combined with quantum genetic algorithm is proposed, to solve the problems that the PSO is difficult to converge for benchmark complex problems and it's parameters are hard to define. The new algorithm is used for submersible path planning and simulation on some standard test functions. The results show that the improved is superior to the standard PSO in optimization ability and the convergence rate, and it can find the optimal path faster.

关键词： Genetic algorithms programming Particle swarm optimization Optimization Simulation logic gates Underwater vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：