scientific article; zbMATH DE number 795590

zbMATH Open0839.68095MaRDI QIDQ4845472FDOQ4845472

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

Publication date: 11 September 1995

Title of this publication is not available (Why is that?)

Recommendations

• Knowledge and common knowledge in a distributed environment
• scientific article; zbMATH DE number 67445
• Common knowledge and update in finite environments
• What can machines know?
• scientific article; zbMATH DE number 1547706

zbMATH Keywords

multi-agent systemcommon knowledgeknowledgetemporal reasoningdistributed systemprogram specificationlogical omniscienceformal epistemologydistributed knowledgetemporal knowledgepossible-worlds model

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
• Resilience of mutual exclusion algorithms to transient memory faults
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• A public announcement separation logic
• A hybrid logic for reasoning about knowledge and topology
• Quantified temporal alethic boulesic doxastic logic
• Rosenkranz's logic of justification and unprovability
• Some forms of collectively bringing about or `seeing to it that'
• A positive information logic for inferential information
• Reasoning about data and information. Abstraction between states and commodities
• Model Checking Information Flow in Reactive Systems
• Adaptively secure broadcast, revisited
• Belief ascription under bounded resources
• Relating truth, knowledge and belief in epistemic states
• Epistemic Strategies and Games on Concurrent Processes
• A model for updates in a multi-agent setting
• Strong completeness theorems for weak logics of common belief
• Intentions and potential intentions revisited
• Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
• Common knowledge does not have the Beth property
• Introspective unawareness and observable choice
• Verifying time, memory and communication bounds in systems of reasoning agents
• Sub-models for interactive unawareness
• Epistemic models of shallow depths and decision making in games: Horticulture
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• Representations and solutions for game-theoretic problems
• The dynamics of epistemic attitudes in resource-bounded agents
• A survey of challenges for runtime verification from advanced application domains (beyond software)
• Connectionist modal logic: representing modalities in neural networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Interactions between knowledge, action and commitment within agent dynamic logic
• On the unusual effectiveness of logic in computer science
• A dynamic logic of interrogative inquiry
• Security invariants in discrete transition systems
• On the nonexistence of universal information structures
• Toward an epistemic-logical theory of categorization
• Structuring unreliable radio networks
• Semantical considerations on multiagent only knowing
• A history based approximate epistemic action theory for efficient postdictive reasoning
• Possibilistic reasoning with partially ordered beliefs
• Decidability of logics based on an indeterministic metric tense logic
• Relativized common knowledge for dynamic epistemic logic
• A logical characterisation of qualitative coalitional games
• A computer scientist looks at game theory.
• Comments to `Logics of public communications'
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation
• A general approach to multi-agent minimal knowledge: With tools and samples
• Parameterized modal satisfiability
• Knowledge means ‘all’, belief means ‘most’
• Unification in epistemic logics
• Decidable Extensions of Hennessy-Milner Logic
• Standard state space models of unawareness (extended abstract)
• Continuous Consensus with Failures and Recoveries
• Reprint of: Reasoning about knowledge of unawareness revisited
• A logic for reasoning about knowledge of unawareness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Preferential reasoning for modal logics
• Reasoning about knowledge and probability
• CoCon: a conference management system with formally verified document confidentiality
• Epistemic logic without closure
• Knowledge and common knowledge in a distributed environment
• The problem of rational knowledge
• Logics of informational interactions
• Cut-free common knowledge
• Logic and Game Theory
• Deduction chains for common knowledge
• PLQP \& Company: decidable logics for quantum algorithms
• Natural language and logic of agency
• Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
• Correlated knowledge: an epistemic-logic view on quantum entanglement
• Mechanising first-order temporal resolution
• Generalized probabilism: Dutch books and accuracy domination
• Characterizations of maximal consistent theories in the formal deductive system \(\mathcal L^{*}\) (NM-logic) and Cantor space
• Bounded model checking for knowledge and real time
• Strong planning under partial observability
• The logic of public announcements, common knowledge, and private suspicions
• On the dynamics of institutional agreements
• Keep `hoping' for rationality: a solution to the backward induction paradox
• Distributed graph coloring in a few rounds
• Doxastic logic: a new approach
• A compositional automata-based approach for model checking multi-agent systems
• Time-efficient randomized multiple-message broadcast in radio networks
• \({\mathcal E}\)-connections of abstract description systems
• Knowledge, action, and the frame problem
• A computationally grounded, weighted doxastic logic
• Checking EMTLK properties of timed interpreted systems via bounded model checking
• The undecidability of quantified announcements
• Alternative semantics for unawareness
• Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
• Syntactic foundations for unawareness of theorems
• Products of ‘transitive” modal logics
• Autonomous agents coordination: action languages meet CLP(\(\mathcal {FD}\)) and Linda
• EXPtime tableaux for ALC
• Cut-free sequent systems for temporal logic
• Refinement modal logic
• On axiomatizations of public announcement logic
• A semantic characterization of a useful fragment of the situation calculus with knowledge
• Dynamic reasoning with qualified syllogisms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845472)