scientific article; zbMATH DE number 795590
From MaRDI portal
Publication:4845472
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
multi-agent systemcommon knowledgeknowledgetemporal reasoningdistributed systemprogram specificationlogical omniscienceformal epistemologydistributed knowledgetemporal knowledgepossible-worlds model
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)
- Logical omniscience as infeasibility
- The logic of justified belief, explicit knowledge, and conclusive evidence
- Public and private communication are different: Results on relative expressivity
- A logical formalization of the OCC theory of emotions
- Dealing with logical omniscience: expressiveness and pragmatics
- From the knowability paradox to the existence of proofs
- Memory and perfect recall in extensive games
- Byzantine agreement with homonyms
- Decidability: theorems and admissible rules
- On ambiguities in the interpretation of game trees
- Combined model checking for temporal, probabilistic, and real-time logics
- Being realistic about common knowledge: a lewisian approach
- The truth about defaults
- Knowledge updates: Semantics and complexity issues
- Logical pluralism and semantic information
- Characterizing common priors in the form of posteriors
- Information based reasoning about security protocols
- A formal characterisation of Hamblin's action-state semantics
- Coordinated consensus in dynamic networks
- The space complexity of long-lived and one-shot timestamp implementations
- A modal type theory for formalizing trusted communications
- Belief change in branching time: AGM-consistency and iterated revision
- The information in intuitionistic logic
- PDL with intersection and converse: satisfiability and infinite-state model checking
- Completeness for flat modal fixpoint logics
- Inductive reasoning about unawareness
- Introduction: Progress in formal commonsense reasoning
- Tracking evidence
- The logic of risky knowledge, reprised
- Three steps
- A theoretical framework on proactive information exchange in agent teamwork
- Merging frameworks for interaction
- Title not available (Why is that?)
- Toward more localized local algorithms, removing assumptions concerning global knowledge
- Two ways to common knowledge
- Dynamic interactive epistemology
- Knowledge, awareness and probabilistic beliefs
- First-order classical modal logic
- A tight unconditional lower bound on distributed randomwalk computation
- The fundamental problem of logical omniscience
- The shadow knows: refinement and security in sequential programs
- Achieving distributed control through model checking
- Priority scheduling of distributed systems based on model checking
- Possibilistic justification logic: reasoning about justified uncertain beliefs
- A modal framework for relating belief and signed information
- Subjective reasoning -- dynamic games
- A quantified logic of evidence
- Justified common knowledge
- Mathematical modal logic: A view of its evolution
- Inexact knowledge with introspection
- Error-free multi-valued consensus with Byzantine failures
- Syntactic cut-elimination for common knowledge
- Minimum congestion mapping in a cloud
- A refinement theory that supports reasoning about knowledge and time for synchronous agents
- Epistemic conditions for rationalizability
- Common knowledge and update in finite environments
- Probability logic of finitely additive beliefs
- Knowledge, Time, and Logical Omniscience
- On the succinctness of some modal logics
- Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces
- Epistemic logic for rule-based agents
- Dynamic epistemic logic with branching temporal structures
- A complexity separation between the cache-coherent and distributed shared memory models
- Second-order propositional modal logic: expressiveness and completeness results
- Symbolic model checking for alternating projection temporal logic
- Title not available (Why is that?)
- Proof Theory for Distributed Knowledge
- A Simple Modal Logic for Reasoning about Revealed Beliefs
- Action emulation
- Does the deduction theorem fail for modal logic?
- Logic for physical space. From antiquity to present day
- Information flow in systems with schedulers. II: Refinement
- Inverse images of box formulas in modal logic
- Formal reasoning with rough sets in multiple-source approximation systems
- On the logical unsolvability of the Gettier problem
- Exploring the power of converse events
- Correlated information: a logic for multi-partite quantum systems
- Assessing the truth axiom under incomplete information
- Characterizing the common prior assumption.
- Reasoning about ignorance and contradiction: many-valued logics versus epistemic logic
- 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
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)
