Abstract:

This paper presents an approach to monitor healthcare workflows using a logic-based formal method. We introduce a monitoring architecture with workflows and knowledge bases, and propose a logical language, FO-LTL-K, to express temporal and knowledge properties to be monitored. We formalize some of the norms for palliative care using the proposed logic and characterize the complexity of the model checking problem.

Keywords: Data and knowledge integration, Temporal knowledge representations, Logic-based methods, Ontologies, Complexity.

Accepted by the Second International Workshop on Knowledge Representation for Health Care (KR4HC-2010), Lisbon, Portugal, August 2010.

Related posts:

1. Enhancing Patient-centered Palliative Care With Collaborative Agents Authors: Ji Ruan, Wendy MacCaull, and Heather Jewers Centre of...
2. Micro-Blogging in Health Care (1) First Thoughts Micro-blogging has increasingly been an important tool for communication among...
3. FWD: FIVE YEARS OF LOGICAL METHODS IN COMPUTER SCIENCE I like this idea: Open and Free Access to high...

Related posts brought to you by Yet Another Related Posts Plugin.

Abstract:

In this paper, we propose the use of an agent-based architecture to enhance workflow system capacity to support interprofessional, patient-centred palliative care delivery. This paper outlines the concept of palliative care and describes how agents can be used to assist care providers to address the needs of the patient and family. Our architecture is illustrated in a diagram and the agents are described in terms of the services they provide, and the dependencies among them. The dependencies determine the information flow, which facilitates the communication and collaboration among the patient and care providers.

Keywords: Agent-based Modelling; Patient-centred Healthcare; Palliative Care; Collaboration; Team Approach

Accepted by the Second International Workshop on Collaborative Agents – REsearch and Development (CARE 2010), Toronto, Canada, August 2010.

Related posts:

1. Micro-Blogging in Health Care (1) First Thoughts Micro-blogging has increasingly been an important tool for communication among...
2. CFP: The 13th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2010) An interesting venue to submit your papers. PRIMA is a...

Related posts brought to you by Yet Another Related Posts Plugin.

Authors: Ji Ruan, Wiebe van der Hoek, and Michael Wooldridge

Abstract: The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just the ability to play a specific game. Participants in the competition are provided with a previously unknown game specified in GDL, and are required to dynamically and autonomously determine how best to play this game. Recently, there has been much interest in the use of strategic cooperation logics for reasoning about game-like scenarios – the Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is perhaps the best known example. Such logics are specifically intended to support reasoning about game-theoretic properties of multi-agent systems. In short, the aim of this article is to make a concrete link between ATL and GDL, with the ultimate goal of using ATL to reason about GDL-specified games. We make the following contributions. First, we demonstrate that GDL can be understood as a specification language for ATL models, and prove that the problem of interpreting ATL formulae over propositional GDL descriptions is EXPTIME-complete. Second, we use ATL to characterize a class of ‘fair playability’ conditions, which might or might not hold of various games.

Keywords: Verification, general game playing, game description language, alternating-time temporal logic, model checking.

Link to an online version: http://portal.acm.org/citation.cfm?id=1666968.1666995&coll=&dl=

Bibtex:

@article{RuanHW:2009JLC,
author = {Ruan, Ji and van der Hoek, Wiebe and Wooldridge, Michael},
title = {Verification of Games in the Game Description Language},
journal = {J. Log. and Comput.},
volume = {19},
number = {6},
year = {2009},
issn = {0955-792X},
pages = {1127–1156},
doi = {http://dx.doi.org/10.1093/logcom/exp039},
publisher = {Oxford University Press},
address = {Oxford, UK},
}

No related posts.

Related posts brought to you by Yet Another Related Posts Plugin.

Here is the preview version (final draft). The first version was submitted on 8th August, 2008.

Jane’s notification:

Dear Ji Ruan

I’m writing about the revised version of your submission to the Agents Corner of the Journal of Logic and Computation, ‘Verification of Games in the Game Description Language’,  JLC 08-37.

Both referees have approved the revised version and, therefore, the editors have accepted the paper for publication.

Please will you send me the final files – I will need source file(s) and corresponding pdf, which OUP will prepare for publication.

Sincerely
Jane Spurr

–

Department of Computer Science,            tel: + (0)20 7848 2987
King’s College, Strand,                    fax: + (0)20 7240 1071
London WC2R 2LS.

Related posts:

1. Data-Aware Monitoring For Healthcare Workflows Using Formal Methods Authors: Ji Ruan and Wendy MacCaull Centre of Logic and...

Related posts brought to you by Yet Another Related Posts Plugin.

PhD Thesis: Reasoning about Time, Action and Knowledge in Multi-Agent Systems

Related posts:

1. My Coming talk in Liverpool: Connecting Dynamic Epistemic and Temporal Epistemic Logics For Multi-Agent Systems Title: Connecting Dynamic Epistemic and Temporal Epistemic Logics For Multi-Agent...

Related posts brought to you by Yet Another Related Posts Plugin.

jiblog-in-china, originally uploaded by jiruan.

I am now in a netbar in Shanghai. The above screen copy shows my blog is not accessible in China.

The GFW (Great Fire
Wall) is responsible for that. I am glad that we have such a ‘wonderful’ thing in China.

No related posts.

Related posts brought to you by Yet Another Related Posts Plugin.

July 2009 Update: This paper has been accepted by the JLC.

March 2009 Update: The Journal of Logic and Computation (JLC) has sent us back the reviews, and we need a revision before it gets accepted.

–

This is a joint work with my PhD supervisors Wiebe van der Hoek and Michael Wooldridge.

It is submitted to the Journal of Logic and Computation. Comments are very welcomed and please contact ji@jiruan.net ( or j.ruan@csc.liv.ac.uk as listed in the paper).

Abstract:

The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just the ability to play a specific game. Participants in the competition are provided with a previously unknown game specified in GDL, and are required to dynamically and autonomously determine how best to play this game. Recently, there has been much interest in the use of strategic cooperation logics for reasoning about game-like scenarios — the Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is perhaps the best known example. Such logics are specifically intended to support reasoning about game-theoretic properties of multi-agent systems. In short, the aim of this article is to make a concrete link between ATL and GDL, with the ultimate goal of using ATL to reason about GDL-specified games.  We make three main contributions. First, we demonstrate that GDL can be understood as a specification language for ATL models, and prove that the problem of interpreting ATL formulae over propositional GDL descriptions is EXPTIME-complete. Second, we use ATL to characterize a class of “fair playability” conditions, which might or might not hold of various games. Third, we describe an automated tool that transforms a GDL description into RML, the model description language for the Mocha model checker, thereby permitting the use of Mocha for verifying playability properties on the RML description. We also present some experimental results on the use of this tool.

No related posts.

Related posts brought to you by Yet Another Related Posts Plugin.

PDF Download: Strategy Logics and the Game Description Language.

Any comments are welcome!

ABSTRACT: The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just to play a specific game. Participants in the competition are provided with a game specified in GDL, and then required to play this game. Recently, there has been much interest in the use of strategic cooperation logics for reasoning about game-like scenarios, Alternating-time Temporal Logic (ATL) is perhaps the best known example. The aim of this paper is to make a link between ATL and GDL. We show that a GDL specification can be viewed as a specification of an ATL model, and that ATL can thus be interpreted over GDL specifications. Our main result is that it is possible to translate a propositional GDL specification into an “equivalent” ATL specification, which is only polynomially larger than the original GDL specification. As a corollary, we are able to characterise the complexity of reasoning about GDL-specified games using ATL: it is EXPTIME-complete.

Acknowledgment: We would like to thank Dirk Walther and two anonymous reviewers for comments and helpful suggestions.

Related posts:

1. My Coming talk in Liverpool: Connecting Dynamic Epistemic and Temporal Epistemic Logics For Multi-Agent Systems Title: Connecting Dynamic Epistemic and Temporal Epistemic Logics For Multi-Agent...
2. Private: Submission on Healthcare (protected due to review process) \begin{abstract} Healthcare systems are essential in maintaining the well-being of...

Related posts brought to you by Yet Another Related Posts Plugin.

PDF Download: Sum and Product in Dynamic Epistemic Logic

Abstract:

The Sum-and-Product riddle was first published in the reference H. Freudenthal (1969, Nieuw Archief voor Wiskunde 3, 152) [6].We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community. This includes some references to precursors of the riddle, that were previously (as far as we know) unknown.

We then model the Sum-and-Product riddle in a modal logic called public announcement logic. This logic contains operators for knowledge, but also operators for the informational consequences of public announcements. The logic is interpreted on multi-agent Kripke models. The information in the riddle can be represented in the traditional way by number pairs, so that Sum knows their sum and Product their product, but also as an interpreted system, so that Sum and Product at least know their local state. We show that the different representations are isomorphic. We also provide characteristic formulas of the initial epistemic state of the riddle. We analyse one of the announcements towards the solution of the riddle as a so-called unsuccessful update: a formula that becomes false because it is announced.

The riddle is then implemented and its solution verified in the epistemic model checker DEMO. This can be done, we think, surprisingly elegantly. The results are compared with other work in epistemic model checking and the complexity is experimentally investigated for several representations and parameter settings.

Keywords: Modal logic, puzzle math, dynamic epistemic logic, characteristic formula, model checking.

Published at Journal of Logic and Computation 2008 18(4):563-588; doi:10.1093/logcom/exm081

We gave a joint talk in the University of Groningen:

Related posts:

1. My Coming talk in Liverpool: Connecting Dynamic Epistemic and Temporal Epistemic Logics For Multi-Agent Systems Title: Connecting Dynamic Epistemic and Temporal Epistemic Logics For Multi-Agent...
2. Data-Aware Monitoring For Healthcare Workflows Using Formal Methods Authors: Ji Ruan and Wendy MacCaull Centre of Logic and...

Related posts brought to you by Yet Another Related Posts Plugin.

A pre-publication version is open for download: Action Emulation.

Abstract:

The effects of public announcements, private communications, deceptive messages to groups, and so on, can all be captured by a general mechanism of updating multi-agent models with so-called update action models [3], now in widespread use (see [9] for a textbook treatment). There is a natural extension of the definition of a bisimulation to action models. Surely enough, updating with bisimilar action models gives the same result (modulo bisimulation). But the converse turns out to be false: there are examples of pairs of non-bisimilar update models with the same update effect. This paper is a quest for a notion of structural equivalence that is more appropriate for action models than bisimulation. We propose action emulation as a notion of structural equivalence more appropriate for action models, and generalizing standard bisimulation. It is proved that action emulation provides a full characterisation of update effect. The important case of updating with purely propositional information is treated first, as an easy stepping stone for the more general treatment.

Acknowledgement: Thanks to Johan van Benthem, Hans van Ditmarsch and Albert Visser for inspiring discussions, and thanks to two anonymous reviewers for helpful comments. We are grateful to our editor Wiebe van der Hoek for encouragement and patience. The first author(van Eijck) is grateful to the Netherlands Institute for Advanced Studies in Wassenaar (NIAS) for providing the opportunity to complete this paper as Fellow-in-Residence.

Further comments are welcomed!

No related posts.

Related posts brought to you by Yet Another Related Posts Plugin.