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

10th international Workshop on programming Multi-Agent Systems, ProMAS 2012

作者： Alechina, Natasha Behrens, Tristan Hindriks, Koen V. Logan, Brian School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom Department of Informatics Clausthal University of Technology Germany Department of Intelligent Systems Delft University of Technology Netherlands

ISBN: (纸本)9783642386992

Agent programs are increasingly widely used for large scale, time critical applications. In developing such applications, the performance of the agent platform is a key concern. Many logic-based BDI-based agent programming languages rely on inferencing over some underlying knowledge representation. While this allows the development of flexible, declarative programs, repeated inferencing triggered by queries to the agent's knowledge representation can result in poor performance. In this paper we present an approach to query caching for agent programming languages. Our approach is motivated by the observation that agents repeatedly perform queries against a database of beliefs and goals to select possible courses of action. Caching the results of previous queries (memoization) is therefore likely to be beneficial. We develop an abstract model of the performance of a logic-based BDI agent programming language. Using our model together with traces from typical agent programs, we quantify the possible performance improvements that can be achieved by memoization. Our results suggest that memoization has the potential to significantly increase the performance of logic-based agent platforms. © 2013 Springer-Verlag.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Qthreads: An API for programming with millions of lightweight threads

Qthreads: An API for programming with millions of lightweigh...

引用

10th Workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing symposium

作者： Wheeler, Kyle B. Murphy, Richard C. thain, Douglas Univ Notre Dame Notre Dame IN 46556 USA Sandia Natl Labs Albuquerque NM 87185 USA

ISBN: (纸本)9781424416936

Large scale hardware-supported multithreading, an attractive means of increasing computational power, benefits significantly from low per-thread costs. Hardware support for lightweight threads is a developing area of research. Each architecture with such support provides a unique interface, hindering development for them and comparisons between them. A portable abstraction that provides basic lightweight thread control and synchronization primitives is needed. Such an abstraction would assist in exploring both the architectural needs of large scale threading and the semantic power of existing languages. Managing thread resources is a problem that must be addressed if massive parallelism is to be popularized. the qthread abstraction enables development of large-scale multithreading applications on commodity architectures. this paper introduces the qthread API and its Unix implementation, discusses resource management, and presents performance results from the HPCCG benchmark.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Formal Aspects of Component Software 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： José Luiz Fiadeiro Zhiming Liu Jinyun Xue

ISBN: (数字)9783319076027

ISBN: (纸本)9783319076010

this book constitutes the revised selected papers of the 10th international symposium on Formal Aspects of Component Software, FACS 2013, held in Nanchang, China, in October 2013. the 19 full papers and three invited talks presented were carefully reviewed and selected from 51 submissions. the papers are concerned with how formal methods can be used to make component-based development fit for the new architectures of today and the systems that are now pervading the socio-economic worlds.

关键词： Software Engineering Mathematical Logic and Formal languages Logics and Meanings of Programs programming languages, Compilers, Interpreters programming Techniques Management of Computing and Information Systems

来源：评论

学校读者我要写书评

暂无评论

Exploiting conjunctive queries in description logic programs

引用

ANNALS OF MAthEMATICS AND ARTIFICIAL INTELLIGENCE 2008年第1-4期53卷 115-152页

作者： Eiter, thomas Ianni, Giovambattista Krennwallner, thomas Schindlauer, Roman Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. the novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. the (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.

关键词： Hybrid rule languages Conjunctive queries and description logics Answer set programming Semantic web

来源：评论

学校读者我要写书评

暂无评论

Flexible database querying based on associations of domain values 10th

引用

10th international symposium on Methodologies for Intelligent Systems, ISMIS 1997

作者： Andreasen, Troels Roskilde University Computer Science Department Intelligent Systems Laboratory P.O.Box 260 RoskildeDK-4000 Denmark

ISBN: (纸本)3540636145

In this paper we present an approach to database querying based on fuzzy evaluation of queries. In the approach a dedicated mining for domain knowledge is involved. the result of this is a special kind of associations between values and is represented in fuzzy networks. Such a network is used to relax queries and to relate objects in the database. the network exploit the database, in the sense that it is obtained by pure statistical means from mining the database for associations between domain values. It is a special variant of a projection of, or a orthogonal view on, data in the database. the approach described here has been implemented and applied in an experiment on a "real-world" library database. In this application associations are modeled between keywords used in librarians descriptions of books in the database. Examples and conclusions are partly based on the results of this experiment. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Evaluation of hydrological consistency of dems derived from SRTM and ASTER2 in three levels of interpolation 10

Evaluation of hydrological consistency of dems derived from ...

引用

10th international symposium on Spatial Accuracy Assessment in Natural Resources and Environmental Sciences, Accuracy 2012

作者： De Castro Oliveira, Guilherme Faria, Maola Monique Filho, Elpídio Inácio Fernandes Department Lands Federal University of Viçosa Av.Ph Rolfs s/n Viçosa-MG Brazil

this study evaluated the accuracy of drainage models generated from the interpolation of SRTM and ASTER2 by Topo to Raster in three levels for a basin in Viçosa (MG). the standard used to classify the mapping quality was the PEC (Cartographic Accuracy Standards). We also evaluated the proportional representation of drainage in relation to reference database (IBGE) and the total area of sinks in each DEM generated interpolated. the interpolation increased the planimetric accuracy of generated drainage networks and the addition of hydrographic contributed to its better design. the PEC scale 1:100.000 for ASTER2 and SRTM was Class B and C, respectively. the representation of the drainage of the models compared to reference responded positively to the interpolation, but the maximum value reached was 59.8% for treatment 3 in ASTER2.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

ACM international Conference Proceeding Series

ACM International Conference Proceeding Series

引用

16th international symposium on database programming languages, DBPL 2017

ISBN: (纸本)9781450353540

the proceedings contain 10 papers. the topics discussed include: modern stored procedures using GraalVM;bridging the semantical gap between relational data and application-level business objects with core data services;DDO-free XQuery;from relation algebra to semi-join algebra: an approach for graph query optimization;the data cube as a typed linear algebra operator;AL: unified analytics in domain specific terms;property-based testing of SPARQL queries;counting types for massive JSON datasets;locomotor: transparent migration of client-side database code;and GraphScript: implementing complex graph algorithms in SAP HANA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scheduling light-weight parallelism in ARTCOP

Scheduling light-weight parallelism in ARTCOP

引用

10th international symposium on Practical Aspects of Declarative languages

作者： Berthold, J. Al Zain, A. Loidl, H. -W. Philipps Univ Marburg Fachbereich Math & Informat D-35032 Marburg Germany Heriot Watt Univ Sch Math & Comp Sci Edinburgh EH14 4AS Midlothian Scotland Ludwig Maximilians Univ Munchen Inst Informat Munich Germany

ISBN: (纸本)9783540774419

We present the design and prototype implementation of the scheduling component in ARTCOP (architecture transparent control of parallelism), a novel run-time environment (RTE) for parallel execution of high-level languages. A key feature of ARTCOP is its support for deep process and memory hierarchies, shown in the scheduler by supporting light-weight threads. To realise a system with easily exchangeable components, the system defines a micro-kernel, providing basic infrastructure, such as garbage collection. All complex RTE operations, including the handling of parallelism, are implemented at a separate system level. By choosing Concurrent Haskell as high-level system language, we obtain a prototype in the form of an executable specification that is easier to maintain and more flexible than conventional RTEs. We demonstrate the flexibility of this approach by presenting implementations of a scheduler for light-weight threads in ARTCOP, based on GHC Version 6.6.

关键词： parallel computation functional programming scheduling

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Logic-Based Smart Contracts for Blockchain Systems 10th

Evaluation of Logic-Based Smart Contracts for Blockchain Sys...

引用

10th Annual international Web Rule symposium (RuleML)

作者： Idelberger, Florian Governatori, Guido Riveret, Regis Sartor, Giovanni European Univ Inst Fiesole Italy Data61 CSIRO NICTA Brisbane Qld Australia

ISBN: (纸本)9783319420196;9783319420189

While procedural languages are commonly used to program smart contracts in blockchain systems, logic-based languages may be interesting alternatives. In this paper, we inspect what are the possible legal and technical (dis) advantages of logic-based smart contracts in light of common activities featuring ordinary contracts, then we provide insights on how to use such logic-based smart contracts in combination with blockchain systems. these insights lead us to emphasize a fundamental challenge - algorithms for logic approaches have to be efficient, but they also need to be literally cheap as measured within the environment where they are deployed and according to its economic rules. We illustrate this with different algorithms from defeasible logic-based frameworks.

关键词： Smart contract Blockchain programming paradigm Logic

来源：评论

学校读者我要写书评

暂无评论

First-order logic definability of free languages 10th

引用

10th international Computer Science symposium in Russia, CSR 2015

作者： Lonati, Violetta Mandrioli, Dino Panella, Federica Pradella, Matteo DI - Università Degli Studi di Milano Milan Italy DEIB - Politecnico di Milano Milan Italy

ISBN: (纸本)9783319202969

Operator Precedence Grammars (OPGs) define a deterministic class of context-free languages, which extend input-driven languages and still enjoy many properties: they are closed w.r.t. Boolean operations, concatenation and Kleene star;the emptiness problem is decidable;they are recognized by a suitable model of pushdown automaton;they can be characterized in terms of a monadic second-order logic. Also, they admit efficient parallel parsing. In this paper we introduce a subclass of OPGs, namely Free Grammars (FrGs);we prove some of its basic properties, and that, for each such grammar G, a first-order logic formula ψ can effectively be built so that L(G) is the set of all and only strings satisfying ψ. FrGs were originally introduced for grammatical inference of programming languages. Our result can naturally boost their applicability;to this end, a tool is made freely available for the semiautomatic construction of FrGs. © Springer international Publishing Switzerland 2015.

关键词： Context free languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：