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

13th IEEE international conference on Commerce and Enterprise Computing (CEC)

作者： Asnar, Yudistira Li, Tong Massacci, Fabio Paci, Federica Univ Trento DISI Trento Italy Tsinghua Univ Sch Software Beijing Peoples R China

ISBN: (纸本)9780769545356

Recently, there has been an increase of reported security threats hitting organizations. Some of them are originated from the assignments to users of inappropriate permissions on organizational sensitive data. thus it is crucial for organizations to recognize as early as possible the risks deriving by inappropriate access right management and to identify the solutions that they need to prevent such risks. In this paper, we propose a framework to identify threats during the requirements analysis of organizations' IT systems. With respect to other works which have attempted to include security analysis into requirement engineering process (e.g., KAOS, Elahi et al., Asnar et al.), our framework does not rely on the level of expertise of the security analyst to detect threats but allows to automatically identify threats that derive from inappropriate access management. To capture the organization's setting and the system stakeholders' requirements, we adopt SI* [1], a requirement engineering framework founded on the concepts of actors, goals, tasks and resources. this framework extends SI* with a reasoning technique that identifies potential security threats on resources and relevant goals. the reasoning is based on Answer Set programming ( ASP) logic rules that take into account the relationships between resources and the delegation of permission relations between actors. We illustrate this framework using an eHealth scenario.

关键词： Cognition Computers Drugs Hospitals SI Security Silicon access right management answer set programming logic rules computer aided threat identification eHealth scenario health care inference mechanisms knowledge representation languages organisational aspects organization IT systems organizational sensitive data reasoning technique requirement engineering process requirements analysis security analysis security of data systems analysis

来源：评论

学校读者我要写书评

暂无评论

Correct reasoning about logic programs

Correct reasoning about logic programs

引用

27th international conference on logic programming, ICLP 2011

作者： Kriener, Jael School of Computing University of Kent CT2 7NF United Kingdom

ISBN: (纸本)9783939897316

In this PhD project, we present an approach to the problem of determinacy inference in logic programs with cut, which treats cut uniformly and contextually. the overall aim is to develop a theoretical analysis, abstract it to a suitable domain and prove both the concrete analysis and the abstraction correct in a formal theorem prover (Coq). A crucial advantage of this approach, besides the guarantee of correctness, is the possibility of automatically extracting an implementation of the analysis.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Multi-agent abductive reasoning with confidentiality

Multi-agent abductive reasoning with confidentiality

引用

10th international conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

作者： Ma, Jiefei Russo, Alessandra Broda, Krysia Lupu, Emil Department of Computing Imperial College London 180 Queen's Gate London SW7 2AZ United Kingdom

ISBN: (纸本)9781618391018

In the context of multi-agent hypothetical reasoning, agents typically have partial knowledge about their environments, and the union of such knowledge is still incomplete to represent the whole world. thus, given a global query they need to collaborate with each other to make correct inferences and hypothesis, whilst maintaining global constraints. there are many real world applications in which the confidentiality of agent knowledge is of primary concern, and hence the agents may not share or communicate all their information during the collaboration. this extra constraint gives a new challenge to multi-agent reasoning. this paper shows how this dichotomy between "open communication" in collaborative reasoning and protection of confidentiality can be accommodated, by extending a general-purpose distributed abductive logic programming system for multi-agent hypothetical reasoning with confidentiality. Specifically, the system computes consistent conditional answers for a query over a set of distributed normal logic programs with possibly unbound domains and arithmetic constraints, preserving the private information within the logic programs. Copyright © 2011, international Foundation for Autonomous Agents and Multiagent Systems (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Extending the Grounded Semantics by logic programming Semantics

Extending the Grounded Semantics by Logic Programming Semant...

引用

14th international conference of the Catalan-Association-for-Artificial-Intelligence (CCIA)

作者： Carlos Nieves, Juan Osorio, Mauricio Cortes, Ulises Univ Politecn Cataluna Software Dept LSI C Jordi Girona 1-3 E-08034 Barcelona Spain Fundac Univ Amer Puebla Mexico

ISBN: (纸本)9781607508427;9781607508410

We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of reasoning as in reasoning by cases. these new argumentation semantics are intermediate argumentation semantics between the grounded and the preferred semantics.

关键词： Argumentation theory Normal logic Programs Rewriting Systems

来源：评论

学校读者我要写书评

暂无评论

Automatic music composition using answer set programming

引用

thEORY AND PRACTICE OF logic programming 2011年第2-3期11卷 397-427页

作者： Boenn, Georg Brain, Martin De Vos, Marina Ffitch, John Univ Glamorgan Cardiff Sch Creat & Cultural Ind Pontypridd CF37 1DL M Glam Wales Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

Music composition used to be a pen and paper activity. these days music is often composed with the aid of computer software, even to the point where the computer composes parts of the score autonomously. the composition of most styles of music is governed by rules. We show that by approaching the automation, analysis and verification of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can be easily built. this application paper describes the use of answer set programming to construct an automated system, named Anton, that can compose melodic, harmonic and rhythmic music, diagnose errors in human compositions and serve as a computer-aided composition tool. the combination of harmonic, rhythmic and melodic composition in a single framework makes Anton unique in the growing area of algorithmic composition. With near real-time composition, Anton reaches the point where it can not only be used as a component in an interactive composition tool but also has the potential for live performances and concerts or automatically generated background music in a variety of applications. With the use of a fully declarative language and an "off-the-shelf" reasoning engine, Anton provides the human composer a tool which is significantly simpler, more compact and more versatile than other existing systems.

关键词： Answer set programming Applications of ASP Music composition Algorithmic composition Harmonic and melodic composition Diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

programming mental state abduction 11

Programming mental state abduction

引用

the 10th international conference on Autonomous Agents and Multiagent Systems - Volume 1

作者： Michal Sindlar Mehdi Dastani John-Jules Meyer University of Utrecht

ISBN: (纸本)9780982657157

Many multi-agent system applications involve software agents that reason about the behavior of other agents with which they interact in cooperation or competition. In order to design and develop those systems, the employed programming languages should provide tools to facilitate the implementation of agents that can perform such reasoning. this paper focuses on BDI-based programming languages and proposes a nonmonotonic reasoning mechanism that can be incorporated into agents, allowing them to reason about observed behavior to infer others' beliefs or goals. In particular, it is suggested that the behavior-generating rules of agents are translated into a nonmonotonic logic programming framework. A formal analysis of the presented approach is provided and it is shown that it has desirable properties.

关键词： modeling other agents and self reasoning (single and multiagent) logic-based approaches and methods

来源：评论

学校读者我要写书评

暂无评论

Automatic music composition using answer set programming

Automatic music composition using answer set programming

引用

24th international conference on logic programming (ICLP)

作者： Boenn, Georg Brain, Martin De Vos, Marina Ffitch, John Univ Glamorgan Cardiff Sch Creat & Cultural Ind Pontypridd CF37 1DL M Glam Wales Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

关键词： Answer set programming Applications of ASP Music composition Algorithmic composition Harmonic and melodic composition Diagnosis

来源：评论

学校读者我要写书评

暂无评论

EP-SPARQL: A unified language for event processing and stream reasoning 11

EP-SPARQL: A unified language for event processing and strea...

引用

20th international conference on World Wide Web, WWW 2011

作者： Anicic, Darko Fodor, Paul Rudolph, Sebastian Stojanovic, Nenad FZI Research Center for Information Technology Karlsruhe Germany Stony Brook University Stony Brook NY United States Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (纸本)9781450306324

Streams of events appear increasingly today in various Web applications such as blogs, feeds, sensor data streams, geospatial information, on-line financial data, etc. Event Processing (EP) is concerned with timely detection of compound events within streams of simple events. State-of-the-art EP provides on-the-y analysis of event streams, but cannot combine streams with background knowledge and cannot perform reasoning tasks. On the other hand, semantic tools can effectively handle background knowledge and perform reasoning thereon, but cannot deal with rapidly changing data provided by event streams. To bridge the gap, we propose Event Processing SPARQL (EP-SPARQL) as a new language for complex events and Stream reasoning. We provide syntax and formal semantics of the language and devise an effective execution model for the proposed formalism. the execution model is grounded on logic programming, and features effective event processing and inferencing capabilities over temporal and static knowledge. We provide an open-source prototype implementation and present a set of tests to show the usefulness and effectiveness of our approach. Copyright © 2011 by the Association for Computing Machinery, Inc. (ACM).

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A Simple Abstraction for Complex Concurrent Indexes

A Simple Abstraction for Complex Concurrent Indexes

引用

2th ACM international conference on Systems, programming, Languages, and Applications: Software for Humanity (SPLASH)

作者： Pinto, Pedro da Rocha Dinsdale-Young, thomas Dodds, Mike Gardner, Philippa Wheelhouse, Mark Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England

ISBN: (纸本)9781450309400

Indexes are ubiquitous. Examples include associative arrays, dictionaries, maps and hashes used in applications such as databases, file systems and dynamic languages. Abstractly, a sequential index can be viewed as a partial function from keys to values. Values can be queried by their keys, and the index can be mutated by adding or removing mappings. Whilst appealingly simple, this abstract specification is insufficient for reasoning about indexes accessed concurrently. We present an abstract specification for concurrent indexes. We verify several representative concurrent client applications using our specification, demonstrating that clients can reason abstractly without having to consider specific underlying implementations. Our specification would, however, mean nothing if it were not satisfied by standard implementations of concurrent indexes. We verify that our specification is satisfied by algorithms based on linked lists, hash tables and B-Link trees. the complexity of these algorithms, in particular the B-Link tree algorithm, can be completabely hidden from the client's view by our abstract specification.

关键词： Concurrency Indexes B-Trees Separation logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：