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

Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics II

引用

Studia Logica 2000年第2期64卷 151-172页

作者： Sofronie-Stokkermans, Viorica Max-Planck-Institut für Informatik Programming Logics Group Saarbrücken D-66123 Im Stadtwald Germany

The main goal of this paper is to explain the link between the algebraic models and the Kripke-style models for certain classes of propositional non-classical logics. We consider logics that are sound and complete with respect to varieties of distributive lattices with certain classes of well-behaved operators for which a Priestley-style duality holds, and present a way of constructing topological and non-topological Kripke-style models for these types of logics. Moreover, we show that, under certain additional assumptions on the variety of the algebraic models of the given logics, soundness and completeness with respect to these classes of Kripke-style models follows by using entirely algebraical arguments from the soundness and completeness of the logic with respect to its algebraic models. © 2000 Kluwer Academic Publishers.

关键词： Distributive lattices Kripke models Non-classical logic Priestley duality

来源：评论

学校读者我要写书评

暂无评论

Parallel execution of multi-set constraint rewrite rules 08

Parallel execution of multi-set constraint rewrite rules

引用

PPDP 2008: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative programming

作者： Sulzmann, Martin Lam, Edmund S. L. Programming Logics and Semantics Group IT University of Copenhagen Rued Langgaards Vej 7 2300 Copenhagen S Denmark School of Computing National University of Singapore S16 Level 5 3 Science Drive 2 Singapore 117543 Singapore

ISBN: (纸本)9781605581170

Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be applied simultaneously as long as they do not interfere with each other. We wish that the underlying constraint rewrite implementation executes rewrite steps in parallel on increasingly popular becoming multi-core architectures. We design and implement efficient algorithms which allow for the parallel execution of multi-set constraint rewrite rules. Our experiments show that we obtain some significant speed-ups on multi-core architectures. Copyright © 2008 ACM.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Friends or foes An AI planning perspective on abstraction and search

Friends or foes An AI planning perspective on abstraction an...

引用

ICAPS 2006 - 16th International Conference on Automated Planning and Scheduling

作者： Hoffmann, Jörg Sabharwal, Ashish Domshlak, Carmel Programming Logics Group Max Planck Institute for CS 66123 Saarbrücken Germany Dept. of Computer Science Cornell University Ithaca NY 14853-7501 United States Fac. of Industrial Engr. and Management Technion Israel Institute of Technology Haifa 32000 Israel

There is increasing awareness that planning and model checking are closely related fields. Abstraction means to perform search in an over-approximation of the original problem instance, with a potentially much smaller state space. This is the most essential method in model checking. One would expect that it can also be made successful in planning. We show, however, that this is likely to not be the case. The main reason is that, while in model checking one traditionally uses blind search to exhaust the state space and prove the absence of solutions, in planning informed search is used to find solutions. We give an exhaustive theoretical and practical account of the use of abstraction in planning. For all abstraction (over-approximation) methods known in planning, we prove that they cannot improve the best-case behavior of informed search. While this is easy to see for heuristic search, we were quite surprised to find that it also holds, in most cases, for the resolution-style proofs of unsolvability underlying SAT-based optimal planners. This result is potentially relevant also for model checking, where SAT-based techniques have recently been combined with abstraction. Exploring the issue in planning practice, we find that even hand-made abstractions do not tend to improve the performance of planners, unless the attacked task contains huge amounts of irrelevance. We relate these findings to the kinds of application domains that are typically addressed in model checking.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：