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

丛书名： Lecture Notes in Computer Science

1000年

作者： Katsuhisa Horimoto Masahiko Nakatsui Nikolaj Popov

ISBN: (数字)9783642280672

ISBN: (纸本)9783642280665

this book constitutes the refereed proceedings of the 4th international conference on Algebraic Biology, ANB 2010, held at the Castle of Hagenberg, Austria in July/August 2010. the conference is a follow up of the AB conference. the 10 papers were carefully reviewed and selected from numerous submissions. the papers are organized in topical sections on mathematical modeling, system analysis and design, genomics, molecular structure analysis, automata theory, artificial intelligence, sequence analysis, automated reasoning, formal language and hybrid symbolic numerical methods.

关键词： logics and Meanings of Programs Mathematical logic and Formal Languages Symbolic and Algebraic Manipulation Computational Biology/Bioinformatics Software Engineering programming Languages, Compilers, Interpreters

来源：评论

学校读者我要写书评

暂无评论

Multi-agent abductive reasoning with confidentiality 11

Multi-agent abductive reasoning with confidentiality

引用

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

作者： Jiefei Ma Alessandra Russo Krysia Broda Emil Lupu Imperial College London London United Kingdom

ISBN: (纸本)9780982657171

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.

关键词： distributed problem solving reasoning (multi-agent) knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Automated reasoning with Analytic Tableaux and Related Methods 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Martin Giese Arild Waaler

ISBN: (数字)9783642027161

ISBN: (纸本)9783642027154

this volume contains the research papers presented at the international C- ference on Automated reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009) held July 6-10, 2009 in Oslo, Norway. this conference was the 18th in a series of international meetings since 1992 (listed on page IX). It was collocated with FTP 2009, the Workshop on First-Order theorem Proving. the Program Committee of TABLEAUX 2009 received 44 submissions from 24 countries. Each paper was reviewed by at least three referees, after which the reviews were sent to the authors for comment in a rebuttal phase. After a ?nal intensive discussion on the borderline papers during the online meeting of the Program Committee, 21 research papers and 1 system description were accepted based on originality, technical soundness, presentation, and relevance. Additionally,three positionpaperswereaccepted,whicharepublished asate- nical report of the University of Oslo. We wish to sincerely thank all the authors who submitted their work for consideration. And we would like to thank the Program Committee members and other referees for their great e?ort and p- fessional work in the review and selection process. their names are listed on the following pages.

关键词： Artificial Intelligence Mathematical logic and Formal Languages programming Techniques Software Engineering

来源：评论

学校读者我要写书评

暂无评论

Constructive techniques for meta- and model-level reasoning 07

Constructive techniques for meta- and model-level reasoning

引用

Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems

作者： Ethan K. Jackson Janos Sztipanovits Institute for Software Integrated Systems Vanderbilt University Nashville TN

ISBN: (纸本)9783540752080

the structural semantics of UML-based metamodeling were recently explored[1], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of first-order logic, an extended Horn logic. We augment the constructive techniques found in logic programming, which are also based on an extended Horn logic, to produce constructive techniques for reasoning about models and meta-models. these methods have a number of practical applications: At the meta-level, it can be decided if a (composite) metamodel characterizes a non-empty set of models, and a member can be automatically constructed. At the model-level, it can be decided if a submodel has an embedding in a well-formed model, and the larger model can be constructed. this amounts to automatic model construction from an incomplete model. We describe the concrete algorithms for constructively solving these problems, and provide concrete examples.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Practical argumentation semantics for socially efficient defeasible consequence 11

Practical argumentation semantics for socially efficient def...

引用

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

作者： Hiroyuki Kido Katsumi Nitta Tokyo Institute of Technology Japan

ISBN: (纸本)9780982657157

An abstract argumentation framework and the semantics, often called Dungean semantics, give a general framework for nonmonotonic logics. In the last fifteen years, a great number of papers in computational argumentation adopt Dungean semantics as a fundamental principle for evaluating various kinds of defeasible consequences. Recently, many papers address problems not only with theoretical reasoning, i.e., reasoning about what to believe, but also practical reasoning, i.e., reasoning about what to do. this paper proposes a practical argumentation semantics specific to practical argumentation. this is motivated by our hypothesis that consequences of such argumentation should satisfy Pareto optimality because the consequences strongly depend on desires, aims, or values an individual agent or a group of agents has. We define a practical argumentation framework and two kinds of extensions, preferred and grounded extensions, with respect to each group of agents. We show that evaluating Pareto optimality can be translated to evaluating preferred extensions of a particular practical argumentation framework. Furthermore, we show that our semantics is a natural extension of Dungean semantics in terms of considering more than one defeat relation. We give a generality order of four practical argumentation frameworks specified by taking into account Dungean semantics and Pareto optimality. We show that a member of preferred extensions of the most specific one is not just Pareto optimal, but also it is theoretically justified.

关键词： logic-based approaches and methods collective decision making reasoning argumentation

来源：评论

学校读者我要写书评

暂无评论

Rich goal types in agent programming 11

Rich goal types in agent programming

引用

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

作者： Mehdi Dastani M. Birna van Riemsdijk Michael Winikoff Utrecht University The Netherlands Delft University of Technology The Netherlands University of Otago New Zealand

ISBN: (纸本)9780982657157

Goals are central to the design and implementation of intelligent software agents. Much of the literature on goals and reasoning about goals in agent programming frameworks only deals with a limited set of goal types, typically achievement goals, and sometimes maintenance goals. In this paper we extend a previously proposed unifying framework for goals with additional richer goal types that are explicitly represented as Linear Temporal logic (LTL) formulae. We show that these goal types can be modelled as a combination of achieve and maintain goals. this is done by providing an operationalization of these new goal types, and showing that the operationalization generates computation traces that satisfy the temporal formula.

关键词： agent programming formal semantics goals

来源：评论

学校读者我要写书评

暂无评论

Forward and backward chaining in constraint programming (INVITED TALK)

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1997年 1265卷 1-1页

作者： Jaffar, Joxan Liu, Bing Yap, Roland H. C. Dept. of Information Systems and Computer Science National University of Singapore 10 Kent Ridge Crescent 119260 Singapore

来源：评论

学校读者我要写书评

暂无评论

Automated Deduction—CADE-18 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Andrei Voronkov

ISBN: (数字)9783540456209

ISBN: (纸本)9783540439318

the First CADE in the third Millennium this volume contains the papers presented at the Eighteenth international C- ference on Automated Deduction (CADE-18) held on July 27–30th, 2002, at the University of Copenhagen as part of the Federated logic conference (FLoC 2002). Despite a large number of deduction-related conferences springing into existence at the end of the last millennium, the CADE conferences continue to be the major forum for the presentation of new research in all aspects of automated deduction. CADE-18 was sponsored by the Association for Auto- ted reasoning, CADE Inc., the Department of Computer Science at Chalmers University, the Gesellschaft fur ¨ Informatik, Safelogic AB, and the University of Koblenz-Landau. there were 70 submissions, including 60 regular papers and 10 system - scriptions. Each submission was reviewed by at least ?ve program committee members and an electronic program committee meeting was held via the Int- net. the committee decided to accept 27 regular papers and 9 system descr- tions. One paper switched its category after refereeing, thus the total number of system descriptions in this volume is 10. In addition to the refereed papers, this volume contains an extended abstract of the CADE invited talk by Ian Horrocks, the joint CADE/CAV invited talk by Sharad Malik, and the joint CADE-TABLEAUX invited talk by Matthias Baaz. One more invited lecture was given by Daniel Jackson.

关键词： Artificial Intelligence Mathematical logic and Formal Languages logics and Meanings of Programs programming Languages, Compilers, Interpreters

来源：评论

学校读者我要写书评

暂无评论

Hoare-Style reasoning with (Algebraic) Continuations

引用

ACM SIGPLAN NOTICES 2013年第9期48卷 363-375页

作者： Andres Delbianco, German Nanevski, Aleksandar Univ Politecn Madrid IMDEA Software Inst E-28040 Madrid Spain IMDEA Software Inst Madrid Spain

Continuations are programming abstractions that allow for manipulating the "future" of a computation. Amongst their many applications, they enable implementing unstructured program flow through higher-order control operators such as callcc. In this paper we develop a Hoare-style logic for the verification of programs with higher-order control, in the presence of dynamic state. this is done by designing a dependent type theory with first class callcc and abort operators, where pre- and postconditions of programs are tracked through types. Our operators are algebraic in the sense of Plotkin and Power, and Jaskelioff, to reduce the annotation burden and enable verification by symbolic evaluation. We illustrate working with the logic by verifying a number of characteristic examples.

关键词： Languages Verification Continuations Hoare logic Dependent Types callcc

来源：评论

学校读者我要写书评

暂无评论

Deontic logic Programs 13

Deontic Logic Programs

引用

international conference on Autonomous Agents and Multiagent Systems

作者： Ricardo Goncalves Jose Julio Alferes CENTRIA - Faculdade Ciências e Tecnologia Universidade Nova de Lisboa Portugal Lisbon Portugal

ISBN: (纸本)9781450319935

Deontic logic programming (DLP) is a framework combining deontic logic and non-monotonic logic programming, and it is useful to represent and reason about normative systems. In this paper we propose an implementation for reasoning in DLP that combines, in a modular way, a reasoner for deontic logic with a reasoner for stable model semantics.

关键词： Norms Knowledge representation Environments Social and organisational structure logic-based approaches and methods Design languages for agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：