Titlebook: Logical Foundations of Computer Science; International Sympos Sergei Artemov,Anil Nerode Conference proceedings 2013 Springer-Verlag Berlin

engagement

Sergei Artemov,Anil NerodeUp to date results.Fast track conference proceedings.State of the art research

翻動(dòng)

Antarctic

摸索

民間傳說(shuō)

Logical Foundations of Computer Science978-3-642-35722-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

構(gòu)成

Iterated Contraction Based on Indistinguishability,We introduce a class of set-theoretic operators on a tolerance space that models the process of minimal belief contraction, and therefore a natural process of iterated contraction can be defined. We characterize the class of contraction operators and study the properties of the associated iterated belief contraction.

Entrancing

貪婪性

Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification,evious notions of products in three directions: they are based on a control-flow graph representation of programs, they are applicable to non-deterministic languages, and they are by construction asymmetric. Thanks to these characteristics, asymmetric products allow to validate abstraction/refinemen

Spangle

Multiplayer Cost Games with Simple Nash Equilibria, are an idealisation. Realistically, agents have to decide on their moves with very limited resources, and complicated strategies that require exponential—or even non-elementary—implementations cannot realistically be implemented. The existence of simple strategies that we prove in this paper theref

dissolution