On the Geometry of Perfect Recall

Classification of Cancer Recurrence with Alpha-Beta BAM

Mathematical Problems in Engineering ◽

10.1155/2009/680212 ◽

2009 ◽

Vol 2009 ◽

pp. 1-14 ◽

Cited By ~ 2

Author(s):

María Elena Acevedo ◽

Marco Antonio Acevedo ◽

Federico Felipe

Keyword(s):

Breast Cancer ◽

Stable State ◽

Cancer Recurrence ◽

Breast Cancer Surgery ◽

Associative Memories ◽

Training Set ◽

Perfect Recall ◽

Alpha Beta ◽

Leave One Out

Bidirectional Associative Memories (BAMs) based on first model proposed by Kosko do not have perfect recall of training set, and their algorithm must iterate until it reaches a stable state. In this work, we use the model of Alpha-Beta BAM to classify automatically cancer recurrence in female patients with a previous breast cancer surgery. Alpha-Beta BAM presents perfect recall of all the training patterns and it has a one-shot algorithm; these advantages make to Alpha-Beta BAM a suitable tool for classification. We use data from Haberman database, and leave-one-out algorithm was applied to analyze the performance of our model as classifier. We obtain a percentage of classification of 99.98%.

Download Full-text

Timed ATL: Forget Memory, Just Count

Journal of Artificial Intelligence Research ◽

10.1613/jair.1.11612 ◽

2019 ◽

Vol 66 ◽

pp. 197-223

Author(s):

Michal Jozef Knapik ◽

Etienne Andre ◽

Laure Petrucci ◽

Wojciech Jamroga ◽

Wojciech Penczek

Keyword(s):

Model Checking ◽

Temporal Logic ◽

Discrete Time ◽

The Other ◽

Simple Pattern ◽

Perfect Recall ◽

Other Hand ◽

Compact Representations ◽

Time Extension ◽

Number Of Visits

In this paper we investigate the Timed Alternating-Time Temporal Logic (TATL), a discrete-time extension of ATL. In particular, we propose, systematize, and further study semantic variants of TATL, based on different notions of a strategy. The notions are derived from different assumptions about the agents’ memory and observational capabilities, and range from timed perfect recall to untimed memoryless plans. We also introduce a new semantics based on counting the number of visits to locations during the play. We show that all the semantics, except for the untimed memoryless one, are equivalent when punctuality constraints are not allowed in the formulae. In fact, abilities in all those notions of a strategy collapse to the “counting” semantics with only two actions allowed per location. On the other hand, this simple pattern does not extend to the full TATL. As a consequence, we establish a hierarchy of TATL semantics, based on the expressivity of the underlying strategies, and we show when some of the semantics coincide. In particular, we prove that more compact representations are possible for a reasonable subset of TATL specifications, which should improve the efficiency of model checking and strategy synthesis.

Download Full-text