Tractable approximate deduction for OWL

Acknowledgements This work has been partially supported by the European project Marrying Ontologies and Software Technologies (EU ICT2008-216691), the European project Knowledge Driven Data Exploitation (EU FP7/IAPP2011-286348), the UK EPSRC project WhatIf (EP/J014354/1). The authors thank Prof. Ian Horrocks and Dr. Giorgos Stoilos for their helpful discussion on role subsumptions. The authors thank Rafael S. Gonçalves et al. for providing their hotspots ontologies. The authors also thank BoC-group for providing their ADOxx Metamodelling ontologies.Peer reviewedPostprin

The Bonny Method Of Guided Imagery And Music (GIM) And Eating Disorders: Learning From Therapist, Trainer, And Client Experiences

The purpose of this study was to explore the use of The Bonny Method of Guided Imagery and Music (GIM) in the treatment of individuals with eating disorders. There has been a recent growth in the literature describing the use of GIM with individuals with eating disorders in a variety of settings. Two online surveys were distributed to three groups of individuals: GIM practitioners, GIM primary trainers, and individuals who have experienced an eating disorder who have participated in GIM sessions. Results indicated that GIM practitioners who have worked with individuals with eating disorders have employed a number of adaptations or alterations to various aspects of the GIM process including inductions, guiding language, physical environment, and others. Special considerations in assessment and use of GIM, as well as common characteristics that practitioners have found among individuals with whom they have worked were also indicated. While responses from primary trainers were limited, respondents indicated special considerations for individuals with eating disorders that they teach in their advanced trainings. Responses from clients were also limited, but revealed information about the individuals’ courses of GIM treatments and perceptions about helpfulness of participating in the GIM process

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea consists in computing a bisimulation by exploring reachable pairs symbolically, so as to avoid redundancies. This idea can be combined with already existing optimisations, and we show in particular a nice integration with the disjoint sets forest data-structure from Hopcroft and Karp's standard algorithm. Then we consider Kleene algebra with tests (KAT), an algebraic theory that can be used for verification in various domains ranging from compiler optimisation to network programming analysis. This theory is decidable by reduction to language equivalence of automata on guarded strings, a particular kind of automata that have exponentially large alphabets. We propose several methods allowing to construct symbolic automata out of KAT expressions, based either on Brzozowski's derivatives or standard automata constructions. All in all, this results in efficient algorithms for deciding equivalence of KAT expressions

On Sharing, Memoization, and Polynomial Time (Long Version)

We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity