O. I. Al-Bataineh & R. van der Meyden (2011):
Abstraction for epistemic model checking of dining cryptographers-based protocols.
In: Proc. of the 13th Conf. on Theoretical Aspects of Rationality and Knowledge (TARK-2011),
pp. 247–256,
doi:10.1145/2000378.2000408.
O. Al Bataineh & R. van der Meyden (2010):
Epistemic Model Checking for Knowledge-Based Program Implementation: an Application to Anonymous Broadcast.
In: SecureComm'10, 6th International ICST Conference on Security and Privacy in Communication Networks,
doi:10.1007/978-3-642-16161-2_25.
K. Baukus & R. van der Meyden (2004):
A Knowledge Based Analysis of Cache Coherence.
In: Proc. 6th Int. Conf. on Formal Engineering Methods, ICFEM 2004,
pp. 99–114,
doi:10.1007/978-3-540-30482-1_15.
U. Bertelè & F. Brioschi (1972):
Nonserial Dynamic Programming.
Academic Press.
I. Boureanu, M. Cohen & A. Lomuscio (2009):
Automatic verification of temporal-epistemic properties of cryptographic protocols.
Journal of Applied Non-Classical Logics 19(4),
pp. 463–487,
doi:10.3166/jancl.19.463-487.
M. Bozzano, A. Cimatti, M. Gario & S. Tonetta (2015):
Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic.
Logical Methods in Computer Science 11(4),
doi:10.2168/LMCS-11(4:4)2015.
D. Chaum (1988):
The Dining Cryptographers problem: Unconditional sender and recipient untraceability.
Journal of Cryptology,
pp. 65–75,
doi:10.1007/BF00206326.
A. Darwiche (1997):
A Logical Notion of Conditional Independence: Properties and Application.
Artif. Intell. 97(1-2),
pp. 45–82,
doi:10.1016/S0004-3702(97)00042-8.
A. Darwiche (1998):
Model-Based Diagnosis using Structured System Descriptions.
J. Artif. Intell. Res. (JAIR) 8,
pp. 165–222,
doi:10.1613/jair.462.
H. P. van Ditmarsch, W. van der Hoek, R. van der Meyden & J. Ruan (2006):
Model Checking Russian Cards.
Electr. Notes Theor. Comput. Sci. 149(2),
pp. 105–123,
doi:10.1016/j.entcs.2005.07.029.
R. Fagin (1977):
Multivalued Dependencies and a New Normal Form for Relational Databases.
ACM Trans. Database Syst. 2(3),
pp. 262–278,
doi:10.1145/320557.320571.
P. Gammie & R. van der Meyden (2004):
MCK: Model checking the logic of knowledge.
In: Proc. 16th Int. Conf. on computer aided verification (CAV'04),
pp. 479–483,
doi:10.1007/978-3-540-72734-7_14.
X. Huang, P. Maupin & R. van der Meyden (2011):
Model Checking Knowledge in Pursuit Evasion Games.
In: IJCAI 2011, Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence,
pp. 240–245,
doi:10.5591/978-1-57735-516-8/IJCAI11-051.
X. Huang, J. Ruan & M. Thielscher (2013):
Model Checking for Reasoning about Incomplete Information Games.
In: Proc. AI 2013: Advances in Artificial Intelligence - 26th Australasian Joint Conf.,
pp. 246–258,
doi:10.1007/978-3-319-03680-9_27.
C. Hur, A. V. Nori, S. K. Rajamani & S. Samuel (2014):
Slicing probabilistic programs.
In: ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI'14,
pp. 16,
doi:10.1145/2594291.2594303.
J. Kohlas & P.P. Shenoy (2000):
Computation in Valuation Algebras.
In: Algorithms for Uncertainty and Defeasible Reasoning: Handbook of Defeasible Reasoning and Uncertainty Management Systems 5.
Kluwer Academic Publishers,
pp. 5–39,
doi:10.1007/978-94-017-1737-3_2.
D. Koller & N. Friedman (2009):
Probabilistic Graphical Models.
MIT Press.
A. Kong (1986):
Multivariate Belief Functions and Graphical Models.
Department of Statistics, Harvard University.
S. L. Lauritzen, A. Philip Dawid, B. N. Larsen & H. Leimer (1990):
Independence properties of directed markov fields.
Networks 20(5),
pp. 491–505,
doi:10.1002/net.3230200503.
D. Maier (1983):
The Theory of Relational Databases.
Computer Science Press.
R. van der Meyden & K. Su (2004):
Symbolic model checking the knowledge of the dining cryptographers.
In: Proc. 17th IEEE Computer Security Foundation Workshop.
IEEE Computer Society,
pp. 280–291,
doi:10.1109/CSFW.2004.19.
S. Olmsted (1983):
On representing and Solving Decision Problems.
Dept. of Engineering-Economic Systems, Stanford University.
J. Pearl (1988):
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.
Morgan Kaufmann,
San Mateo, CA.
R. L. Rivest (1999):
Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer.
Unpublished, but available at http://theory.lcs.mit.edu/~rivest/publications.html.
P.P. Shenoy (1989):
A valuation-based language for expert systems.
Int. J. of Approximate Reasoning 3,
pp. 383–411,
doi:10.1016/0888-613X(89)90009-1.
P.P Shenoy (1992):
Valuation-Based Systems: A Framework for Managing Uncertainty in Expert Systems.
In: L.A. Zadeh & J. Kacprzyk: Fuzzy Logic for the Management of Uncertainty.
John Wiley and Sons,
pp. 83–104.
P.P. Shenoy & G. Shafer (1990):
Axioms for Probability and Belief Function Propagation.
In: R.D. Shachter, T.S. Levitt, J.F. Lemmer & L.N. Kanal: Uncertainty in Artifical Intelligence 4.
North Holland,
pp. 169–198,
doi:10.1016/B978-0-444-88650-7.50019-6.
W. Spohn (1988):
Ordinal conditional functions: a dynamic theory of epistemic states.
In: W.L. Harper & B. Skyrms: Causation in Decision, Belief Change, and Statistics.
Springer,
pp. 105–134,
doi:10.1007/978-94-009-2865-7_6.
T. Verma & J.Pearl (1988):
Causal Networks: Semantics and Expressiveness.
In: Proc. 4th Workshop on Uncertainty in AI,
pp. 352–359.
N. Wilson & J. Mengin (2001):
Embedding Logics in the Local Computation Framework.
Journal of Applied Non-Classical Logics 11(3-4),
pp. 239–261,
doi:10.3166/jancl.11.239-267.
eptcs@eptcs.org