Ron van der Meyden:
Publications Sorted by Area
The following lists contain some overlaps:
Reasoning about Knowledge
 [C60] The complexity of approximations for epistemic synthesis (extended abstract),
Xiaowei Huang and Ron Van Der Meyden, 4th Workshop on Synthesis, San Francisco,
Jul 2015.
 [C59] Undecidable Cases of Model Checking Probabilistic TemporalEpistemic Logic (Extended Abstract),
Ron Van Der Meyden and Manas Patra, TARK 2015.
 [A6] Undecidable Cases of Model Checking Probabilistic TemporalEpistemic Logic,
Ron Van Der Meyden and Manas Patra, arXiv:1511.03003 (extended version of [C59]).

[C58] Symbolic
Model Checking Epistemic Strategy Logic, X. Huang and R. van der
Meyden, AAAI 2014, pp. 14261432.
 [C57] An epistemic strategy logic, X. Huang and R. van der Meyden,
2nd International Workshop on Strategic Reasoning
April 56, 2014, Grenoble, France, pp. 3541.
 [C56] A temporal logic of strategic knowledge, X. Huang and R. van der Meyden, KR 2014.
 [C55]
Symbolic Synthesis for Epistemic Specifications with Observational Semantics,
X. Huang and R. van der Meyden, TACAS 2014, pp. 455469.
 [C54]
Symbolic Synthesis of Knowledgebased Program Implementations with Synchronous Semantics,
X. Huang And R. van der Meyden, TARK 2013, pp 121130 (2013).
 [C52]
Synthesizing Strategies for Epistemic Goals by Epistemic Model Checking: an application to PursuitEvasion Games,
X. Huang and R. van der Meyden, AAAI2012.
 [C51] Symbolic Model Checking of Probabilistic Knowledge, X. Huang, C. Luo and R. van der Meyden,
Proc. 13th Conf. on Theoretical Aspects of Knowledge and Rationality, TARK 2011, Gronigen, Jul 2011, pp. 177186.
 [C50]
Abstraction for Epistemic Model Checking of DiningCryptographers based Protocols,
O. AlBataineh and R. van der Meyden,
Proc. 13th Conf. on Theoretical Aspects of Knowledge and Rationality, TARK 2011, Gronigen, Jul 2011, pp. 247256. Extended version, see [M10]
 [C49] Model Checking Knowledge in PursuitEvasion Games, X. Huang, P. Maupin and R. van der Meyden,
International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Jul 2011.
 [C47] Epistemic Model Checking for KnowledgeBased Program
Implementation: an Application to Anonymous Broadcast, O. AlBataineh and
R. van der Meyden, SecureComm'10,
6th International ICST Conference on
Security and Privacy in Communication Networks, Singapore, Sept 79 2010.
 [C46] The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time, X. Huang and
R. van der Meyden, ECAI 2010 (Extended version)
 [C45] Improved Bounded Model Checking for a
Fair BranchingTime Temporal Epistemic Logic
X. Huang and C. Luo and R. van der Meyden,
in Proc. Sixth Int. Workshop on Model Checking and Artificial Intelligence,
(MoChArt 2010), pp. 95111, Springer LNAI No. 6572, 2011.
An extended abstract of this paper appears as
Improved Bounded Model Checking for a Fair BranchingTime Temporal Epistemic Logic (Extended Abstract)
X. Huang and C. Luo and R. van der Meyden,
Proc. AAMAS 2010, (Copyright IFAAMAS.)
 [C43] Model Checking Games for a Fair BranchingTime Temporal Epistemic Logic
X. Huang and R. van der Meyden, Australasian Joint Conference on
Artificial Intelligence, Melbourne, Dec 2009.
 [C42] Deriving Epistemic Conclusions from Agent Architecture,
S. Chong and R. van der Meyden, Theoretical Aspects of Rationality
and Knowledge, TARK 2009, Jul 68, 2009, Stanford, pp 6170.
 [C39] On notions of causality and distributed knowledge, R. van
der Meyden, KR 2008: Eleventh International Conference on Principles
of Knowledge Representation and Reasoning, Sydney, Australia,
September 1619, 2008, pp. 209219. (see [M8] for an extended version.)
 [B5] Two applications of epistemic logic in computer security,
R. van der Meyden, in Logic at the Crossroads, A Gupta et al (eds),
Allied Publishers, New Delhi, 2007, pp. 207222.
 [C36]
Preservation of Epistemic Properties in
Security Protocol Implementations, R. van der Meyden and T. Wilke,
in Proc. Conf on Theoretical Aspects of Rationality and
Knowledge, Brussels, July 2007, pp 212221.
 [C35] Model Checking Knowledge and Linear Time:
PSPACE Cases, Kai Engelhardt, Peter Gammie, and Ron van der Meyden,
in Proc Symposium on Logical Foundations of Computer Science, New York, June
2007, pp. 195211. (for extended version, see [M2])
 [C31] Model Checking Russian Cards ,
H.P. van Ditmarsch, W. van der Hoek, R. van der Meyden, J. Ruan,
Electronic Notes in Theoretical Computer Science
Volume 149, Issue 2 , 14 February 2006, Pages 105123
Proceedings of the Third Workshop on Model Checking and Artificial Intelligence (MoChArt 2005) August 27, 2005  San Francisco, CA, USA.
 [E2]
Theoretical Aspects of Rationality and Knowledge,
proceedings of the 10th Conference, Singapore, June 1013, 2005,
R. van der Meyden, editor.

[C30] Synthesis of Distributed Systems from Knowledgebased Specifications, R. van der Meyden, T. Wilke, CONCUR 2005  Concurrency Theory, 16th International Conference, San Francisco, Aug 2005, pp. 562576 An extended
version of this paper appears as
UNSW CSE technical report 0504
 [B4] Axioms for Logics of Knowledge and
Past Time: Synchrony and Unique Initial States
, T. French, R. van der Meyden and M. Reynolds, Advances in Modal
Logic, Volume 5, Schmidt, R. A. et al (eds), King's College
Publications}, London, 2005, pp. 5372.
 [C27] MCK: Model Checking
the Logic of Knowledge
P. Gammie and R. van der Meyden, 16th International conference
on Computer Aided Verification, CAV 2004, pp. 479 483. (Copyright
SpringerVerlag)
 [C24] Knowledge in Quantum Systems, R. van der Meyden and M. Patra,
Theoretical Aspects of Knowledge and Rationality, Bloomington, Indiana, June 2003
(This version corrects an error in the statement of Proposition 2 in the published paper.)
 [C26] Symbolic Model Checking the Knowledge of the Dining
Cryptographers R. van der Meyden and K. Su, 17th IEEE Computer Security
Foundations Workshop, Asilomar, June 2004, pp. 280291
 [J12] Complete Axiomatizations for Reasoning about
Knowledge and Branching Time , R. van der Meyden and
K. Wong, Studia Logica, Vol 75, No 1, Oct 2003 pp. 93123.
 [J10] Complete Axiomatizations for Reasoning
about Knowledge and Time , J. Y. Halpern, R. van der Meyden and
M. Y. Vardi, SIAM Journal on Computing, Vol 33, No. 3, 2004,
pp. 674703.
 [B3] Modal Logics with a Hierarchy of
Local Propositional Quantifiers , Kai Engelhardt, R. van der
Meyden and Kaile Su, Advances in Modal Logic Volume 4, P. Balbiani et
al (eds) World Scientific, 2003, pp. 930.
(A Preliminary Version is in Proc. Advances
in Modal Logic, Toulouse, Oct. 2002.)
 [W3] Modal Logics with a Hierarchy of Local Propositional Quantifiers,
K. Engelhardt and R. van der Meyden, FLOC'99 Workshop
on Complexity Theoretic and Recursion Theoretic
Methods in Databases, AI and Finite Model Theory, Trento, July 1999.
 [J8] Knowledge in MultiAgent Systems:
Initial Configurations and Broadcast, A.R. Lomuscio, R. van der
Meyden, M. D. Ryan, ACM Transactions on Computational Logic
Vol 1, No 2, October 2000
 [C18]
Model Checking Knowledge and Time in Systems with
Perfect Recall, R. van der Meyden and
N. Shilov
, Proc. Conf. on Foundations of Software Technology and
Theoretical Computer Science, Madras, Dec 1999.
Springer LNCS No. 1738, pp. 432445.
(Copyright
SpringerVerlag)
 [C15] Synthesis from KnowledgeBased
Specifications. R. van der Meyden and M. Y. Vardi,
Proc. CONCUR'98, 9th International Conf. on Concurrency Theory,
Springer LNCS No. 1466, Nice, Sept 98, pp. 3449.
(Copyright
SpringerVerlag) Extended version: see [A2]
 [A2] Synthesis from KnowledgeBased Specifications
Ron van der Meyden, Moshe Y. Vardi, CoRR abs/1307.6333 (2013)
 [C14] Knowledge and the Logic of Local
Propositions, K. Engelhardt, R. van der Meyden and Y. Moses,
Conf. on Theoretical Aspects of Rationality and Knowledge,
Evanston Il, July 98.
 [B1] Constructing Finite State Implementations
of Knowledge Based Programs with Perfect Recall,
R. van der Meyden, in Intelligent Agent Systems:
Theoretical and Practical Issues (Based on a Workshop Held at
PRICAI'96, Cairns, Australia, Aug 1996) , Springer LNAI No. 1209, 1997,
pp. 135152.
 [C13] Finite State Implementations of
KnowledgeBased Programs, R. van der Meyden, in Proc. Conf. on
Foundations of Software Technology and Theoretical Computer
Science, Hyderabad India, Dec 1996, Springer LNCS No. 1180,
pp. 262273.
 [C12] KnowledgeBased Programs: on the Complexity
of Perfect Recall in Finite Environments (Extended Abstract),
R. van der Meyden, Proceedings of the Conference on Theoretical
Aspects of Reasoning about Knowledge, Renesse, Netherlands, March
1996, pp. 3150.
 [C8] Mutual Belief Revision (Preliminary Report),
R. van der Meyden, in
Proceedings of the International Conference on Principles of Knowledge
Representation and Reasoning, Bonn, May 1994, pp. 595606.
 [J5] Common Knowledge and Update in Finite
Environments, R. van der Meyden, Information and Computation
Vol 140, No. 2, Feb 1998, pp. 115157. A preliminary version of
this paper appeared in Proceedings of the Conference on
Theoretical Aspects of Reasoning about Knowledge, Pacific Grove
CA, March 1994.
 [C10] Common Knowledge and Update in Finite
Environments, R. van der Meyden, Proceedings of the Conference on
Theoretical Aspects of Reasoning about Knowledge, Pacific Grove
CA, March 1994, pp. 225242. (journal version: [J5])
 [C9] Axioms for Knowledge and Time in Distributed Systems with Perfect Recall,
R. van der Meyden, Proc. IEEE Symposium on Logic in Computer Science,
Paris, July 1994, pp. 448457. (Full version, largely, but not
entirely, subsumed by [J10].)
Formal Methods for Distributed Computing
(see also the section on Reasoning about Knowledge)
 [C29] A knowledge based analysis of cache coherence,
K. Baukus and R. van der Meyden, International Conference on Formal Engineering Methods,
Seattle, Nov 2004, LNCS No. 3308, pp. 99114.
(Copyright
SpringerVerlag)
 [C22] A Refinement Theory that Supports Reasoning about
Knowledge and Time for Synchronous Agents, K. Engelhardt, R. van
der Meyden and Yoram Moses, 8th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning, Dec
2001, Havana, Cuba, pp. 125141.
 [W4] KnowledgeBased Specification: Investigating Distributed
Mutual Exclusion, U. Bonollo, R. van der Meyden, E.A. Sonenberg, Bar
Ilan Symposium on Foundations of AI, Israel, June 2001
 [C20] On Refinement and Temporal
Annotations, R. van der Meyden and Y. Moses,
Formal Techniques in RealTime and Fault Tolerant Systems,
Proc. 6th International Symposium, FTRTFT 2000} Pune, India, September 2022,
2000. Springer LNCS Vol. 1926.
(Copyright
SpringerVerlag)
 [C19] A Program Refinement Framework Supporting
Reasoning about Knowledge and Time, Kai Engelhardt, Ron van
der Meyden, and Yoram Moses, Foundations of Software Science and
Computation Structures, European Joint Conferences on Theory and
Practice of Software (ETAPS 2000), Berlin, March 2000.
Springer LNCS Vol. 1784
(Copyright
SpringerVerlag)
 [C16] TopDown Considerations on Distributed Systems, R. van der Meyden
and Y. Moses, Proc. 12th International Symposium on Distributed
Computing, DISC'98, Andros, Greece, Sept 1998, Springer LNCS
No. 1499, pp. 1619  abstract of invited talk by Yoram Moses.
 [W2] Issues for a Temporal Refinement Calculus, R. van der Meyden and
Y. Moses, progress report paper presented at the International
Refinement Workshop/Formal Methods Pacific, Canberra, Sept. 98.
Published in Australian National University Technical Report TRCS9809. (see also [C20])
Formal Methods for Computer Security / Deontic Logic
 [A7] Dynamic Intransitive Noninterference Revisited S. Eggert and R. van der Meyden. arXiv:1601.05187.
 [J19] Using architecture to reason about
information security. S. Chong and R. van der Meyden, ACM Transactions on Information and System Security.
Volume 18 Issue 2, December 2015. doi:10.1145/2829949
 [J17]
Information Flow in Systems with Schedulers (Part II:Refinement) ,
R. van der Meyden, C. Zhang, Theoretical Computer Science, Vol 484, pp. 7092 (2013)
doi: 10.1016/j.tcs.2013.01.002
 [J16] Information Flow in Systems with Schedulers (Part I:Definitions) ,
R. van der Meyden, C. Zhang, Theoretical Computer Science,
Vol. 467, Jan 2013, pp. 6888. doi: 10.1016/j.tcs.2012.10.047
 [C53] Intransitive Noninterference in Nondeterministic Systems,
K. Engelhardt, R. van der Meyden and C. Zhang, ACM CCS, pp. 869880, 2012.
 [C51] Symbolic Model Checking of Probabilistic Knowledge, X. Huang, C. Luo and R. van der Meyden,
Proc. 13th Conf. on Theoretical Aspects of Knowledge and Rationality, TARK 2011, Gronigen, Jul 2011, pp. 177186.
 [C50]
Abstraction for Epistemic Model Checking of DiningCryptographers based Protocols,
O. AlBataineh and R. van der Meyden,
Proc. 13th Conf. on Theoretical Aspects of Knowledge and Rationality, TARK 2011, Gronigen, Jul 2011, pp. 247256. Extended version, see [M10]
 [C48] The Complexity of Intransitive Noninterference, S. Eggert, R. van der Meyden,
H. Schnoor, T. Wilke, IEEE Symp. on Security & Privacy, Oakland, May 2011. Extended version: see [A1]
 [A1] Complexity and Unwinding for Intransitive Noninterference
Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke, CoRR abs/1308.1204 (2013)
 [C47] Epistemic Model Checking for KnowledgeBased Program
Implementation: an Application to Anonymous Broadcast, O. AlBataineh and
R. van der Meyden, SecureComm'10,
6th International ICST Conference on
Security and Privacy in Communication Networks, Singapore, Sept 79 2010.
 [J20]
The complexity of synchronous notions of information flow security,
Franck Cassez, Ron van der Meyden, Chenyi Zhang, Theor. Comput. Sci. 631: 1642 (2016)
 [C44] The Complexity of Synchronous Notions of Information Flow Security,
F. Cassez, R. van der Meyden and C. Zhang,
FoSSaCS 2010, 13th International Conference on
Foundations of Software Science and Computation Structures,
March 20  28, 2010, Paphos, Cyprus.
(Copyright
SpringerVerlag)
 [C42] Deriving Epistemic Conclusions from Agent Architecture,
S. Chong and R. van der Meyden, Theoretical Aspects of Rationality
and Knowledge, TARK 2009, pp 6170.
 [J15] Architectural refinement and notions of intransitive
noninterference, R. van der Meyden, Formal Aspects of Computing 24(46): 769792 (2012).
An earlier version of this paper appeared in
International Symposium on Engineering Secure Software and Systems, February 0406, 2009
Leuven, Belgium, Springer LNCS No 5429, pp. 6074.
 [C40] Access Control and Information Flow in Transactional
Memory, A. Cohen, R. van der Meyden and L. Zuck, Workshop on Formal
Aspects of Security and Trust, Malaga, Spain, Oct 910, 2008,
Spinger LNCS No. 5491, pp. 316330, 2009.
 [C39] On notions of causality and distributed knowledge, R. van
der Meyden, KR 2008: Eleventh International Conference on Principles
of Knowledge Representation and Reasoning, Sydney, Australia,
September 1619, 2008, pp. 209219. (see [M8] for an extended version.)
 [C38] Information Flow in Systems with Schedulers,
R. van der Meyden and C. Zhang, IEEE Symposium on Computer Security Foundations,
Pittsburgh, June 2008, pp. 301312. (See [J16] for extended version.)
 [B5] Two applications of epistemic logic in computer security,
R. van der Meyden, in
Logic at the Crossroads, A Gupta et al (eds),
Allied Publishers, New Delhi, 2007, pp. 207222.
 [J18] What, indeed, is intransitive noninterference?, R. van
der Meyden, Journal of Computer Security 23(2): 197228 (2015) This is an extended version of a paper that appears in
Proc. European Symposium on Research in Computer Security, Dresden, Sept 2007, LNCS Vol. 4734,
pp. 235250.
 [C36]
Preservation of Epistemic Properties in
Security Protocol Implementations, R. van der Meyden and T. Wilke,
in Proc. Conf on Theoretical Aspects of Rationality and
Knowledge, Brussels, July 2007.
 [C33] Algorithmic Verification of
Noninterference Properties, R. van der Meyden and C. Zhang, Views
on Designing Complex Architectures, Bertinoro, Italy, Sept 1617,
2006, in Electronic Notes in Theoretical Computer Science 168: 6175
(2007).
 [C32] A Comparison of Semantic Models for Noninterference, R. van
der Meyden and C. Zhang, Proc. Workshop on Formal Aspects of Security
and Trust, August 2627 2006, Hamilton, Ontario, Canada. LNCS Vol
4691, Sept 2007, pp. 235249. (for full version, see [J13])
 [J13] A Comparison of Semantic Models for Noninterference, R. van
der Meyden and C. Zhang, Theoretical Computer Science, Vol. 411, Issue 47, Oct 2010,
pp. 41234147.
 [S4] Revisiting the Foundations of Authentication Logics
J.Y. Halpern, R. van der Meyden, R. Pucella, submitted for publication
 [C26] Symbolic Model Checking the Knowledge of the Dining
Cryptographers R. van der Meyden and K. Su, 17th IEEE Computer Security
Foundations Workshop, Asilomar, June 2004, pp. 280291
 [J11] A logical reconstruction of SPKI,
J.Y. Halpern and R. van der Meyden, extended version of [C21],
Journal of Computer Security, Volume 11, Issue 4, 2003,. pp 581614.
(a special issue of Journal of Computer Security containing selected papers from CSFW'01.)
 [C21] A logical reconstruction of SPKI, J.Y. Halpern and R. van
der Meyden, Proc. IEEE Computer Security Foundations Workshop, 2001, pp. 5970.
(for full version, see [J11])
 [J7]
A logic for SDSI's Linked Local Name Spaces , J. Y. Halpern and
R. van der Meyden, Journal of Computer Security, vol. 9, number
1,2, pp. 75  104, 2001. (a special issue of the Journal of
Computer Security containing selected papers from CSFW 99.)
 [C17]
A logic for SDSI's Linked Local Name Spaces (Preliminary Version),
J. Y. Halpern and R. van der Meyden,
IEEE Computer Security Foundations Workshop, June 1999.
Journal version = [J7]
 [C4]
A Clausal Logic for Deontic Action Specification, R. van der Meyden,
Proceedings of the International Logic Programming Symposium,
San Diego, October 1991, pp. 221238. MIT Press.
 [J3] The Dynamic Logic of
Permission, R. van der Meyden, Journal of Logic and
Computation, Vol 6, No. 3 pp. 465479, 1996. A version of this
paper appeared at the IEEE Symposium on Logic in Computer
Science, Philadelphia, 1990.
 [C1] The Dynamic Logic of Permission, R. van der Meyden,
Proceedings of the IEEE Symposium on Logic in Computer Science,
Philadelphia, June 1990, pp. 7278. IEEE Press. (journal version: [J3])
Database Theory/Logic Programming
 [PHD]
The Complexity of Querying
Indefinite Information: Defined Relations, Recursion and Linear Order,
R. van der Meyden, PhD thesis, Rutgers University 1992. (520K compressed Postscript)
 [E1] Logics
for Emerging Applications of Databases, J. Chomicki, R. van der Meyden,
G. Saake (eds), Springer 2003
 [B2]
Logical Approaches to Incomplete Information: A Survey, R. van
der Meyden, in Logics for
Databases and Information Systems, J. Chomicki and G. Saake
eds, Kluwer, 1998, pp. 309358.
 [J9] Predicate Boundedness of Linear
Monadic Datalog is in PSPACE, R. van der Meyden,
International Journal of Foundations of Computer Science,
Vol 11, No 4 (2000) pp. 591612
(an earlier
version is SCS&E Report 9205, Sept 1992, University of New South
Wales)
 [J6]
Containment and Optimization of Object Preserving Conjunctive Queries,
Edward P.F. Chan and R. van der Meyden. SIAM Journal on Computing 29(4): 13711400 (2000)
 [C11]
Testing Containment of ObjectOriented Conjunctive Queries is
$\Pi^{p}_{2}$hard, E.P.F. Chan and R. van der Meyden,
First Annual International Computing and Combinatorics Conference,
Xi'an, China, August, 1995, (also appears as Technical Report
CS9429, University of Waterloo, Sept 1994) (subsumed by [J6])
 [J2]
Complexity Tailored Design: A New Design Methodology for
Databases with Incomplete Information, T. Imielinksi,
R. van der Meyden and K. Vadaparty, Journal of Computer and Systems
Science, Vol 51, No. 3, Dec 1995, pp. 405432.
 [J1]
Recursively Indefinite Databases, R. van der Meyden,
Theoretical Computer Science 116(1,2) (1993) pp. 151194  a
special issue of TCS containing selected papers from ICDT'90,
P. Kanellakis and S. Abiteboul, eds.
 [C3] Indefinite Reasoning with Definite Rules, L. T. McCarty and
R. van der Meyden, Proceedings of the International Joint
Conference on Artificial Intelligence, Sydney, August 1991,
pp. 890896. Morgan Kaufmann.
 [C2]
Recursively Indefinite Databases, R. van der Meyden, Proceedings of the
International Conference on Database Theory, Paris, December 1990,
pp. 364 378, Springer LNCS No. 470, P. Kanellakis and S. Abiteboul, eds.
(journal version: [J1])
 [W1] Reasoning with Recursive Relations: Negation, Inequality and
Linear Order, R. van der Meyden, Proceedings of the
Workshop on Deductive Databases held at the International Logic
Programming Symposium, October 1991, pp. 6271.
 [C7]
An Intuitionistic Interpretation of Finite and Infinite Failure,
L. T. McCarty and R. van der Meyden,
Proceedings of the 2nd International Workshop on Logic Programming
and NonMonotonic Reasoning, Lisbon, June 1993, pp. 417437. MIT Press.
 [C6]
Reasoning about Indefinite Actions , L. T. McCarty and R. van der
Meyden, Proceedings of the 3rd International Conference on
Principles of Knowledge Representation and Reasoning, Cambridge,
Mass., October 1992, pp. 5970. Morgan Kaufmann.
 [J4] The Complexity of Querying Indefinite
Information about Linearly Ordered Domains, R. van der Meyden,
Journal of Computer and Systems
Science Vol 54, No. 1, Feb 1997, pp. 113135  a special issue
of JCSS containing selected papers from the ACM Symposium on
Principles of Database Systems, San Diego, June 1992.
 [C5]
The Complexity of Querying Indefinite Information about Linearly
Ordered Domains, R. van der Meyden, Proceedings of the ACM
Symposium on Principles of Database Systems, San Diego, June 1992,
pp. 331345. ACM Press. (journal version: [J4])
Quantum Computing
 [J14] Consistent Assignment of Quantum Probabilities, M. Patra and R. van der Meyden,
J. of Physics A: Mathematical and Theoretical 45 (2012) 075304, doi:10.1088/17518113/45/7/075304

[C25] A Logic for Probability in Quantum Systems, R. van der Meyden and M. Patra, Proc. Computer Science Logic and 8th Kurt Gödel Colloquium, Vienna, Austria, 25th  30th August 2003, pp. 427440
(prepublication version)
 [C24] Knowledge in Quantum Systems, R. van
der Meyden and M. Patra, Theoretical Aspects of Knowledge and
Rationality, Bloomington, Indiana, June 2003, pp. 104  117
Other