scientific article; zbMATH DE number 795590

Yoram Moses, Moshe Y. Vardi, Joseph Y. Halpern, Ronald Fagin

Publication date: 11 September 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

program specification knowledge multi-agent system distributed system temporal reasoning formal epistemology common knowledge logical omniscience distributed knowledge temporal knowledge possible-worlds model

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) General topics in artificial intelligence (68T01)

Related Items (only showing first 100 items - show all)

Model Checking Information Flow in Reactive Systems ⋮ Specification and Verification of Multi-Agent Systems ⋮ The Truth about Defaults ⋮ Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains ⋮ Epistemic planning for single- and multi-agent systems ⋮ An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking ⋮ Axiomatization and completeness of lexicographic products of modal logics ⋮ Logics of Rational Interaction ⋮ Exploring the Power of Converse Events ⋮ Unnamed Item ⋮ Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators ⋮ Conflict Resolution in Multi-agent Systems with Typed Connections for Ontology Population ⋮ Deriving Inverse Operators for Modal Logic ⋮ Propositional Dynamic Logic for Petri Nets with Iteration ⋮ Two Ways to Common Knowledge ⋮ Generalized DEL-Sequents ⋮ Building an Epistemic Logic for Argumentation ⋮ Non-finitely axiomatisable two-dimensional modal logics ⋮ Beyond Lamport's Happened-before ⋮ Finitary S5-Theories ⋮ Efficient Program Transformers for Translating LCC to PDL ⋮ A Logic for Belief Contraction ⋮ Coordinated consensus in dynamic networks ⋮ Error-free multi-valued consensus with byzantine failures ⋮ Distributed graph coloring in a few rounds ⋮ MIS on trees ⋮ Toward more localized local algorithms ⋮ The complexity of robust atomic storage ⋮ Resilience of mutual exclusion algorithms to transient memory faults ⋮ The impact of memory models on software reliability in multiprocessors ⋮ A complexity separation between the cache-coherent and distributed shared memory models ⋮ From bounded to unbounded concurrency objects and back ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Locally checkable proofs ⋮ Fault-tolerant spanners ⋮ Adaptively secure broadcast, revisited ⋮ Scalable rational secret sharing ⋮ Analyzing consistency properties for fun and profit ⋮ Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions ⋮ Optimal-time adaptive strong renaming, with applications to counting ⋮ The round complexity of distributed sorting ⋮ A tight unconditional lower bound on distributed randomwalk computation ⋮ Minimum congestion mapping in a cloud ⋮ Conflict on a communication channel ⋮ Stability of a peer-to-peer communication system ⋮ Tight bounds on information dissemination in sparse mobile networks ⋮ Time-efficient randomized multiple-message broadcast in radio networks ⋮ Faster information dissemination in dynamic networks via network coding ⋮ Reasoning About Strategies ⋮ An Epistemic Separation Logic ⋮ Mathematical Arguments and Distributed Knowledge ⋮ Agency and Interaction What We Are and What We Do in Formal Epistemology ⋮ On Logics of Knowledge and Belief ⋮ Sentences, Belief and Logical Omniscience, or What Does Deduction Tell Us? ⋮ The Logic of Justification ⋮ Some Computational Constraints in Epistemic Logic ⋮ The Logic of Public Announcements, Common Knowledge, and Private Suspicions ⋮ Unnamed Item ⋮ Dynamic Epistemic Logic and Logical Omniscience ⋮ A New Approach to Epistemic Logic ⋮ Group Knowledge in Interrogative Epistemology ⋮ Topological Subset Space Models for Public Announcements ⋮ Known Unknowns: Time Bounds and Knowledge of Ignorance ⋮ Playing Cards with Hintikka: An Introduction to Dynamic Epistemic Logic ⋮ Hintikka’s Knowledge and Belief in Flux ⋮ Possible Worlds Semantics Based on Observation and Communication ⋮ The Proof Theory of Common Knowledge ⋮ Beyond Knowing That: A New Generation of Epistemic Logics ⋮ Epistemic Logic with Evidence and Relevant Alternatives ⋮ Why Bother with Syntax? ⋮ The Pleasure of Gossip ⋮ Automatic Data-Abstraction in Model Checking Multi-Agent Systems ⋮ Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic ⋮ Symbolic Model Checking the Knowledge in Herbivore Protocol ⋮ A Dynamic Logic of Interrogative Inquiry ⋮ Logical Foundations of Evidential Reasoning with Contradictory Information ⋮ Distributed Modal Logic ⋮ Some Remarks on the Proof-Theory and the Semantics of Infinitary Modal Logic ⋮ Default Rules in the Logic of First-Degree Entailments ⋮ Modelling Sources of Inconsistent Information in Paraconsistent Modal Logic ⋮ Relating Truth, Knowledge and Belief in Epistemic States ⋮ Inference Rules in Multi-agents’ Temporal Logics ⋮ Learning in a Changing World, an Algebraic Modal Logical Approach ⋮ Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments ⋮ Three Steps ⋮ A Modal Framework for Relating Belief and Signed Information ⋮ On the Definability of Simulability and Bisimilarity by Finite Epistemic Models ⋮ Alternating-Time Temporal Announcement Logic ⋮ Knowledge and Action in Semi-public Environments ⋮ Seeing, Knowledge and Common Knowledge ⋮ An Epistemic Logic with Hypotheses ⋮ Public Announcement Logic with Distributed Knowledge ⋮ On Logic of Belief-Disagreement among Agents ⋮ Towards an Awareness-Based Semantics for Security Protocol Analysis ⋮ Information based reasoning about security protocols ⋮ Xheal ⋮ Classical Knowledge for Quantum Cryptographic Reasoning ⋮ Temporal Logics of Knowledge and their Applications in Security ⋮ A Characterization of Dynamic Networks Where Consensus Is Solvable ⋮ A Compositional Automata-based Approach for Model Checking Multi-Agent Systems

This page was built for publication: