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

JOURNAL OF LOGIC AND COMPUTATION 2012年第6期22卷 1391-1403页

作者： Omodeo, Eugenio G. Policriti, Alberto Tomescu, Alexandru I. Univ Trieste Dipartimento Matemat & Informat I-34127 Trieste Italy Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy Univ Bucharest Fac Math & Comp Sci Bucharest 010014 Romania

It is shown that within the language of Set Theory, if membership is assumed to be non-well-founded a la Aczel, then one can state the existence of infinite sets by means of an there exists there exists for all for all prenex sentence. Somewhat surprisingly, this statement of infinity is essentially the one which was proposed in 1988 for well-founded sets, and it is satisfied exclusively by well-founded sets. Stating infinity inside the BSR (Bernays Schonfinkel Ramsey) class of the there exists*for all*-sentences becomes more challenging if no commitment is taken as whether membership is well-founded or not: for this case, we produce an there exists there exists for all for all for all-sentence, thus lowering the complexity of the quantificational prefix with respect to earlier prenex formulations of infinity. We also show that no prenex specification of infinity can have a prefix simpler than there exists there exists for all for all. The problem of determining whether a BSR-sentence involving an uninterpreted predicate symbol and = can be satisfied over a large domain is then reduced to the satisfiability problem for the set theoretic class BSR subject to the ill-foundedness assumption. Envisaged enhancements of this reduction, cleverly exploiting the expressive power of the set theoretic BSR-class, add to the motivation for tackling the satisfaction problem for this class, which appears to be anything but unchallenging.

关键词： computable set theory Bernays-Schonfinkel-Ramsey class infinity axiom non-well-founded sets satisfiability decision algorithms Mathematics Subject Classification (2000) 03E30 03E70

来源：评论

学校读者我要写书评

暂无评论

FLOW FASTER: EFFICIENT decision algorithms FOR PROBABILISTIC SIMULATIONS

引用

13th International Conference on Tools and algorithms for the Construction and Analysis of Systems

作者： Zhang, Lijun Hermanns, Holger Eisenbrand, Friedrich Jansen, David N. Univ Saarland Dept Comp Sci Saarland Germany Ecole Polytech Fed Lausanne Dept Math Lausanne Switzerland Radboud Univ Nijmegen NL-6525 ED Nijmegen Netherlands Univ Aachen Rhein Westfal TH Aachen Aachen Germany

ISBN: (纸本)9783540712084

Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. This paper investigates whether they can be used as effectively as their non-probabilistic counterparts. It presents drastically improved algorithms to decide whether some (discrete- or continuous-time) Markov chain strongly or weakly simulates another, or whether a probabilistic automaton strongly simulates another. The key innovation is the use of parametric maximum flow techniques to amortize computations. We also present a novel algorithm for deciding strong probabilistic simulation preorders on probabilistic automata, which has polynomial complexity via a reduction to an LP problem. When extending the algorithms for probabilistic automata to their continuous-time counterpart, we retain the same complexity for both strong and strong probabilistic simulations.

关键词： Markov chains strong- and weak-simulation decision algorithms parametric maximum flow

来源：评论

学校读者我要写书评

暂无评论

FLOW FASTER: EFFICIENT decision algorithms FOR PROBABILISTIC SIMULATIONS

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2008年第4期4卷

关键词： Markov chains strong- and weak-simulation decision algorithms parametric maximum flow

来源：评论

学校读者我要写书评

暂无评论

A mechanical verification of the stressing algorithm for negative cost cycle detection in networks

引用

SCIENCE OF COMPUTER PROGRAMMING 2011年第7期76卷 609-626页

作者： Shankar, Natarajan Subramani, K. SRI Int Comp Sci Lab Menlo Pk CA 94025 USA W Virginia Univ LDCSEE Morgantown WV 26506 USA

The negative cost cycle detection (NCCD) problem in weighted directed graphs is a fundamental problems in theoretical computer science with applications in a wide range of domains ranging from maximum flows to image segmentation. From the perspective of program verification, this problem is identical to the problem of checking the satisfiability of a conjunction of difference constraints. There exist a number of approaches in the literature for NCCD with each approach having its own set of advantages. Recently, a greedy, space-efficient algorithm called the stressing algorithm was proposed for this problem. In this paper, we present a novel proof of the Stressing algorithm and its verification using the Prototype Verification System (PVS) theorem prover. This example is part of a larger research program to verify the soundness and completeness of a core set of decision procedures. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Negative cost cycle detection Graph algorithms decision algorithms Formal verification Interactive theorem proving

来源：评论

学校读者我要写书评

暂无评论

An overview of vertical handover techniques: algorithms, protocols and tools

引用

COMPUTER COMMUNICATIONS 2011年第8期34卷 985-997页

作者： Marquez-Barja, Johann Calafate, Carlos T. Cano, Juan-Carlos Manzoni, Pietro Univ Politecn Valencia Camino Vera S-N Valencia 46022 Spain

Wireless technologies, under the "Anywhere, Anytime" paradigm, offer users the promise of being always attached to the network. Mobile devices enabled with multiple wireless technologies make possible to maintain seamless connectivity in highly dynamic scenarios such as vehicular networks (VNs), switching from one wireless network to another by using vertical handover techniques (VHO). In this paper we present an overview of VHO techniques, along with the main algorithms, protocols and tools proposed in the literature. In addition we suggest the most appropriate VHO techniques to efficiently communicate in VN environments considering the particular characteristics of this type of networks. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Vertical handover Vehicular networks IEEE 802.21 decision algorithms

来源：评论

学校读者我要写书评

暂无评论

The research on the decision algorithms of Multi-agent based on ant colony of WebGIS

The research on the decision algorithms of Multi-agent based...

引用

IEEE International Conference on Control and Automation

作者： Li, Guangru Li, Yuanhui Sun, Zhi Dalian Maritime Univ ITS Lab Dalian 116026 Peoples R China

On the characteristics of multi-source and mass data of GIS, this paper analyzes and designs the architecture model of WebGIS based on Multi-agent. Moreover, in order to improve the dynamic processing capacity of the ... 详细信息

ISBN: (纸本)9781424408177

关键词： multi-agent decision algorithms ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Integrated decision algorithms for auto-steered electric transmission system asset management

Integrated decision algorithms for auto-steered electric tra...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： McCalley, James Honavar, Vasant Ryan, Sarah Meeker, William Qiao, Daji Roberts, Ron Li, Yuan Pathak, Jyotishman Ye, Mujing Hong, Yili Iowa State Univ Sci & Technol Ames IA 50011 USA

ISBN: (纸本)9783540725831

Electric power transmission systems are comprised of a large number of physical assets, including transmission lines, power transformers, and circuit breakers, that are capital-intensive, highly distributed, and may fail. Managing these assets under resource constraints requires equipment health monitoring integrated with system level decision-making to optimize a number of various operational, maintenance, and investment-related objectives. Industry processes to these ends have evolved ad-hoc over the years, and no systematic structures exist to coordinate the various decision problems. In this paper, we describe our progress in building a prototype structure for this purpose together with a software-hardware environment to deploy and test it. We particularly focus on the decision algorithms and the Benders approach we have taken to solve them in an integrated fashion.

关键词： asset management Benders decomposition condition monitoring decision algorithms electric transmission optimization service-oriented architecture software-hardware

来源：评论

学校读者我要写书评

暂无评论

Logics of Kripke meta-models

引用

LOGIC JOURNAL OF THE IGPL 2010年第6期18卷 823-836页

作者： Babenyshev, Sergey Rybakov, Vladimir Manchester Metropolitan Univ Dept Comp & Math Manchester M1 5GD Lancs England

This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The possible candidates include (but are not restricted to) a number of epistemic, multi-agent, deontological and other well-studied logics. In this construction, that we call refinement, the Kripke structure of a chosen Kripke complete logic is imposed on clusters of the background transitive frame. Refinements fit in a wider framework of fibred logics, while having some unique features. First of all, when applied to classes of frames of Kripke complete logics, refinement preserves good meta-logical properties of constituent logics, in contrast with the well-known products of logics. Another advantage of refinements is that they allow for augmented languages of considerable expressive power, while preserving good meta-logical and semantical properties. In particular we show that refinement of logics preserves the effective finite model property and decidability for a wide class of constituent logics.

关键词： fibred logics multi-modal logics decision algorithms satisfiability Kripke semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Logic with Distances Based on Linear Temporal Frames

Multi-agent Logic with Distances Based on Linear Temporal Fr...

引用

10th International Conference on Artificial Intelligence and Soft Computing (ICAISC 2010)

作者： Rybakov, Vladimir Babenyshev, Sergey Manchester Metropolitan Univ Dept Comp & Math Manchester M1 5GD Lancs England

ISBN: (纸本)9783642132315

The paper investigates a new temporal logic TLDistM, which combines temporal operations with the operations of localised agent's knowledge and operations responsible for measuring distances. The main goal is to construct;a logical framework for modelling logical laws, which describe interactions between such operations. We consider issues of satisfiability and decidability for TLDistM. Our principal result is the algorithm which recognizes theorems of TLDistM, which implies that TLDistM is decidable, and the satisfiability problem for TLDistM, is solvable.

关键词： multi-agent systems multi-modal logics decision algorithms satisfiability Kripke semantics distance measuring

来源：评论

学校读者我要写书评

暂无评论

decision algorithms for fragments of real analysis. 1. Continuous functions with strict convexity and concavity predicates

引用

JOURNAL OF SYMBOLIC COMPUTATION 2006年第7期41卷 763-789页

作者： Cantone, Domenico Cincotti, Gianluca Gallo, Giovanni Univ Catania Dept Math & Comp Sci I-95125 Catania Italy

In this paper we address the decision problem for a fragment of unquantified formulae of real analysis, which, besides the operators of Tarski's theory of reals, includes also strict and non-strict predicates expressing comparison, monotonicity, concavity, and convexity of continuous real functions over possibly unbounded intervals. The decision result is obtained by proving that a formula of our fragment is satisfiable if and only if it admits a parametric "canonical" model, whose existence can be tested by solving a suitable unquantified formula, expressed in the decidable language of Tarski's theory of reals and involving the numerical variables of the initial formula plus various other parameters. This paper generalizes a previous decidability result concerning a more restrictive fragment in which predicates relative to infinite intervals or stating strict concavity and convexity were not expressible. (c) 2006 Elsevier Ltd. All rights reserved.

关键词： decision algorithms elementary analysis monotonicity concavity convexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：