Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Knowledge representation (68T30) Agent technology and artificial intelligence (68T42)
Recommendations
Cites work
- A characterization of eventual Byzantine agreement
- A guide to completeness and complexity for modal logics of knowledge and belief
- A little knowledge goes a long way
- A predicate transformer approach to knowledge and knowledge-based protocols (extended abstract)
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Game theory
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 4197470 (Why is no real title available?)
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Knowledge and common knowledge in a distributed environment
- Knowledge-oriented programming
- Modelling knowledge and action in distributed systems
- Programming simultaneous actions using common knowledge
- Proving Liveness Properties of Concurrent Programs
- Random generation of combinatorial structures from a uniform distribution
- Reasoning about infinite computations
- Relationships between nondeterministic and deterministic tape complexities
- Simulating synchronized clocks and common knowledge in distributed systems
- The complexity of facets (and some facets of complexity)
- The complexity of propositional linear temporal logics
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Using knowledge to optimally achieve coordination in distributed systems
Cited in
(23)- Optimal aggregation algorithms for middleware.
- Knowledge-based programs as succinct policies for partially observable domains
- Propositional gossip protocols
- Knowledge-based strategies for multi-agent teams playing against nature
- The logic of gossiping
- Planning-based knowing how: a unified approach
- Characterizing solution concepts in terms of common knowledge of rationality
- Minimal number of calls in propositional protocols
- Verified synthesis of knowledge-based programs in finite synchronous environments
- scientific article; zbMATH DE number 1512613 (Why is no real title available?)
- scientific article; zbMATH DE number 2182499 (Why is no real title available?)
- Hidden protocols: modifying our expectations in an evolving world
- scientific article; zbMATH DE number 7440211 (Why is no real title available?)
- A dynamic epistemic framework for conformant planning
- Open problems in a logic of gossips
- A note on knowledge-based programs and specifications
- Using counterfactuals in knowledge-based programming
- Dynamic epistemic logics
- A formalisation of violation, error recovery, and enforcement in the bit transmission problem
- An epistemic separation logic with action models
- Interpreting knowledge-based programs
- Finite state implementations of knowledge-based programs (extended abstract)
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
This page was built for publication: Knowledge-based programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137342)
