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

First Conference on Computability in Europe, CiE 2005: New computational Paradigms

作者： Moschovakis, Yiannis N. Department of Mathematics University of California Los Angeles CA 90095-1555 United States Department of Mathematics Graduate Program in Logic Algorithms and Computation University of Athens Athens Greece

来源：评论

学校读者我要写书评

暂无评论

Old resolution meets modern SLS

Old resolution meets modern SLS

引用

20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05

作者： Anbulagan Pham, Due Nghia Slaney, John Sattar, Abdul Logic and Computation Program National ICT Australia Ltd. Canberra Australia IIIS Griffith University Brisbane Australia Computer Sciences Laboratory Australian National University Canberra Australia

Recent work on Stochastic Local Search (SLS) for the SAT and CSP domains has shown the importance of a dynamic (non-markovian) strategy for weighting clauses in order to escape from local minima. In this paper, we improve the performance of two best contemprorary clause weighting solvers, PAWS and SAPS, by integrating a prepositional resolution procedure. We also extend the work to AdaptNovelty+, the best non-weighting SLS solver in the GSAT/WalkSAT series. One outcome is that our systems can solve some highly structured problems such as quasigroup existence and parity learning problems which were previously thought unsuitable for local search and which are completely out of reach of traditional solvers such as GSAT. Here we present empirical results showing that for a range of random and real-world benchmark problems, resolution-enhanced SLS solvers clearly outperform the alternatives. Copyright © 2005. American Association for Artificial Intelligence (***). All rights reserved.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Prolegomena to concise theories of action

引用

Studia logica 2001年第3期67卷 403-418页

作者： Peppas, Pavlos Koutras, Costas D. Williams, Mary-Anne Department of Business Administration University of Patras Patras 265 00 Greece Graduate Program in Logic Algorithms and Computation (MPLA) Department of Mathematics University of Athens Panepistimioupolis 157 84 Zographou Greece Business and Technology Research Laboratory University of Newcastle NSW 2308 Australia

A new methodology for developing theories of action has recently emerged which provides means for formally evaluating the correctness of such theories. Yet, for a theory of action to qualify as a solution to the frame problem, not only does it need to produce correct inferences, but moreover, it needs to derive these inferences from a concise representation of the domain at hand. The new methodology however offers no means for assessing conciseness. Such a formal account of conciseness is developed in this paper. Combined with the existing criterion for correctness, our account of conciseness offers a framework where proposed solutions to the frame problem can be formally evaluated. © 2001 Kluwer Academic Publishers.

关键词： Commonsense Reasoning Frame Problem Reasoning about Action

来源：评论

学校读者我要写书评

暂无评论

Games servers play: A procedural approach 2nd

Games servers play: A procedural approach

引用

International Joint Conference on Artificial Intelligence, IJCAI 1995 held with the 2nd Workshop on Agent Theories, Architectures, and Languages, ATAL 1995

作者： Bicchieri, Cristina Ephrati, Eithan Antonelli, Aldo Logic and Computation Program Departments of Philosophy and Social and Decision Sciences Carnegie Mellon University United States Department of Mathematics and Computer Science Bar Ilan University Israel Department of Philosophy Yale University United States

ISBN: (纸本)3540608052

Game theory has recently been recognized as a powerful tool to model interactions among artificial agents. Game theorists, however, have never tried to explicitly model how players reason to a solution. This becomes a crucial flaw whenever one attempts to apply game theoretic solutions to multi-agents systems. In this paper we provide an effective procedure that allows artificial agents to coordinate using game-theoretic tools. We model agents' encounters as extensive-form games, and show how agents can compute a set of "reasonable paths" through the tree. The set of reasonable paths corresponds to the set of strategies that survive iterated elimination of (weakly) dominated strategies in the normal form. Whenever our procedure identifies a unique path, that path corresponds to a Nash equilibrium. Moreover, our procedure rules out all Nash equilibria that contain (weakly) dominated strategies. Further, we show how our notion of "reasonable" paths leads to the backwards induction solution in the case of games of perfect information, and to forward induction in the case of games of imperfect information. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：