75,451 Hits in 3.4 sec

A complete inference system for a class of regular behaviours

Robin Milner
1984 Journal of computer and system sciences (Print)  
A central result of the paper is a complete inference system for finitely presented behaviours, closely analogous to that of Salomaa [9] for regular sets of words.  ...  In fact, the next section provides a complete inference system for such behaviours.  ... 
doi:10.1016/0022-0000(84)90023-0 fatcat:whq43r4gnnf7zpd2lgvs7s2zja

Page 3433 of Mathematical Reviews Vol. , Issue 89F [page]

1989 Mathematical Reviews  
Summary: “The equationally complete proof system for ‘if-then- else’ of S. L. Bloom and R.  ...  We give an algorithm which reduces the inference problem for even linear languages to that for regular sets. With it, any algorithm for regular sets is available for inferring even linear languages.  ... 

Page 2672 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
System Sci. 28 (1984), no. 3, 439-466; MR 86h:68050] presented a sound and complete equational axiomatization of strong bisimulation for a regular subset of CCS formed from the null process 0, process  ...  {For the entire collection see MR 2001c:68009. } 2001d:68173 68Q85 68Q55 68Q60 Stark, Eugene W. (1-SUNYS; Stony Brook, NY); Smolka, Scott A. (1-SUNYS; Stony Brook, NY) A complete axiom system for finite-state  ... 

Page 3755 of Mathematical Reviews Vol. , Issue 86h [page]

1986 Mathematical Reviews  
Milner, Robin (4-EDIN-C) 86h:68050 A complete inference system for a class of regular behaviours. J. Comput. System Sci. 28 (1984), no. 3, 439-466.  ...  The main result of the paper consists in the presentation of an inference system for the algebra of behaviours. This inference system is proved sound and complete. Mila E.  ... 

A survey of grammatical inference in software engineering

Andrew Stevenson, James R. Cordy
2014 Science of Computer Programming  
Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by  ...  Unlike these other fields, which use grammars as a convenient tool to model naturally occuring patterns, software engineering treats grammars as first-class objects typically created and maintained for  ...  class diagram of the system from the inferred grammar.  ... 
doi:10.1016/j.scico.2014.05.008 fatcat:xwasotc745ekbhaoq2n43vrufm

Page 1072 of Mathematical Reviews Vol. , Issue 88b [page]

1988 Mathematical Reviews  
Summary: “Suppose one is given a description of a system, together with an observation of the system’s behaviour which conflicts with the way the system is meant to behave.  ...  This is taken as support for the use of systems such as semantic networks which, although not completely understood, can compute quickiy.  ... 

Structure and abstraction in phonetic computation: Learning to generalise among concurrent acquisition problems

Bill Thompson, Bart de Boer
2017 Journal of Language Evolution  
We present a probabilistic model for jointly inferring individual sound classes and a system-wide blueprint for the balance of shared and idiosyncratic structure among these classes.  ...  Sound systems vary dramatically in their lower-level details as a result of cultural evolution, but the presence of systematic organisation is universal.  ...  Unlike model M1, the accuracy of learning about a class C j is not always at the mercy of the quality of the data available for that class: instead, system-wide regularities can bootstrap learning.  ... 
doi:10.1093/jole/lzx013 fatcat:zew2ju3ihrbt5ed2temxbcznoi

Improving dynamic software analysis by applying grammar inference principles

Neil Walkinshaw, Kirill Bogdanov, Mike Holcombe, Sarah Salahuddin
2008 Journal of Software Maintenance and Evolution Research and Practice  
Dynamic analysis is a family of techniques in the domain of software engineering that attempts to infer rules that govern the behaviour of software systems from a sample of executions.  ...  Despite their disparate domains, both fields have broadly similar aims; they try to infer rules that govern the behaviour of some unknown system from a sample of observations.  ...  ACKNOWLEDGEMENTS The authors thank the anonymous referees for their valuable comments.  ... 
doi:10.1002/smr.373 fatcat:4cbdwhpg5bg7vlgj7qnw4y657y

Page 6368 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
“In Part II, we show that there is a class of SL-systems (NP- regular SL-systems) for which the f-solvability problem is NP- complete.  ...  On the other hand we are able to define a class of SL-systems (regular SL-systems) for which the £-solvability problem is decidable in polynomial time.  ... 

Modelling the Interaction Levels in HCI Using an Intelligent Hybrid System with Interactive Agents: A Case Study of an Interactive Museum Exhibition Module in Mexico

Ricardo Rosales, Manuel Castañón-Puga, Felipe Lara-Rosano, Josue Flores-Parra, Richard Evans, Nora Osuna-Millan, Carelia Gaxiola-Pacheco
2018 Applied Sciences  
Technology has become a necessity in our everyday lives and essential for completing activities we typically take for granted; technologies can assist us by completing set tasks or achieving desired goals  ...  In our research, we analyse the evaluation made by an on-site observer from a sample of 500 users that visited "El Trompo" Museo Interactivo Tijuana in Mexico to set-up a Fuzzy Inference System (FIS) [  ...  Acknowledgments: We would like to thank the Mexican National Council for Science and Technology, The Autonomous University of Baja California and "El Trompo" Museo Interactivo Tijuana, A.C., in Mexico,  ... 
doi:10.3390/app8030446 fatcat:bz3jbiewoffujdnjjxr6dkzoom

Chaos in Hamiltonians with a Cosmological Time Dependence [article]

Henry E. Kandrup
1999 arXiv   pre-print
This paper summarises a numerical investigation of how the usual manifestations of chaos and regularity for flows in time-independent Hamiltonians can be alterred by a systematic time-dependence of the  ...  One still infers sharp distinctions between regular and chaotic behaviour, even though "regular" does not mean "periodic" and "chaotic" will not in general imply strictly exponential sensitivity towards  ...  ACKNOWLEDGMENTS The author would like to acknowledge arguments with himself, most of which he lost.  ... 
arXiv:astro-ph/9903434v1 fatcat:2pfxar65jzg5toylb3k5ddwhhy

Utilising Semantic Technologies for Decision Support in Dementia Care

T. Osman, S. Rmaswamy, S. Mahmoud, M. Saeed
2013 2013 UKSim 15th International Conference on Computer Modelling and Simulation  
of decision support for remote healthcare systems.  ...  monitoring of the patient's behaviour.  ...  instance as a member of the class DCAlarmingBathroomUsagePattern during the inference process.  ... 
doi:10.1109/uksim.2013.110 dblp:conf/uksim/OsmanRMS13 fatcat:d2vuznujhzdkli44jxgjbgke4e

Predicting Perceptual Speed from Search Behaviour

Olivia Foulds, Alessandro Suglia, Leif Azzopardi, Martin Halvey
2020 Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval  
Additionally, we identified different behavioural components for specific PS tests, implying that each PS test measures different aspects of a person's cognitive ability.  ...  However PS tests are difficult to administer which limits the design of user-adaptive systems that can automatically infer PS to appropriately accommodate low PS users.  ...  The authors would like to thank Dr David Maxwell for his contribution towards the search system developed for the user study and the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/3397271.3401210 dblp:conf/sigir/FouldsSAH20 fatcat:ip246xzk4fanjieqe3k5z7cuya

Enabling Adaptation in Trust Computations

Longo Luca, Dondio Pierpaolo, Bresciani Riccardo, Barrett Stephen, Butterfield Andrew
2009 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns  
In this work we address the problem by presenting a self-adaptive model for Trust computations.  ...  Digital systems have been rapidly evolving within highly dynamic and unstructured environments, where the lack of a central authority forces entities to interact with each other through collaboration and  ...  (A→ACTIVITY, P→PRESENCE, F→FREQUENCY, R→REGULARITY) Trust class a certain behaviour (i.e. a certain combination of Computational Trust schemes).  ... 
doi:10.1109/computationworld.2009.70 fatcat:r2zr7hec4jdbrlfkoavhdtg5ue


2006 The Evolution of Language  
Using mathematical and computer modelling, we show how a very small bias towards regularity can be accentuated by the process of cultural transmission in which language is passed from generation to generation  ...  Cultural evolution therefore plays as big a role as prior bias in determining the form of emergent languages, showing that language can only be explained in terms of the interaction of biological evolution  ...  The dynamics of this system can be completely characterized for a particular value of m (the bottleneck) and !  ... 
doi:10.1142/9789812774262_0011 fatcat:e4ic7744rzfdbfnrfet5qwex6e
« Previous Showing results 1 — 15 out of 75,451 results