-
41On ideals and stationary reflectionJournal of Symbolic Logic 54 (2): 568-575. 1989.It is a theorem of Prikry [7] that ifκcarries a uniformη-descendingly complete ultrafilter then the stationary reflection propertyfails. In this paper we will derive similar results, but here from properties of filters rather than ultrafilters.Throughoutκandηwill denote regular cardinals withη
-
22Distributive ideals and partition relationsJournal of Symbolic Logic 51 (3): 617-625. 1986.It is a theorem of Rowbottom [12] that ifκis measurable andIis a normal prime ideal onκ, then for eachλ
-
Seminormal $lambda$-Generated Ideals on $P_kappalambda$Journal of Symbolic Logic 53 (1): 92-102. 1988.
-
30Hoare Logic-Based Genetic ProgrammingScience China Information Sciences 54 (3): 623-637. 2011.Almost all existing genetic programming systems deal with fitness evaluation solely by testing. In this paper, by contrast, we present an original approach that combines genetic programming with Hoare logic with the aid of model checking and finite state automata, henceby proposing a brand new verification-focused formal genetic programming system that makes it possible to evolve reliable programs with mathematicallyverified properties.
-
58Complex Systems in Aesthetics and ArtsComplexity 2019 1-2. 2019.The arts are one of the most complex of human endeavours, and so it is fitting that a special issue on Complex Systems in Aesthetics and Arts is being published. As the editors of this special issue, we would like to thank the reviewers of the submitted papers for their hard work in making this issue possible, as well as the authors who submitted their work and were very responsive to the comments of the reviewers and editors.
-
43A hybrid rule-induction/likelihood-ratio based approach for predicting protein-protein interactionsIn L. Magnani (ed.), computational intelligence, . pp. 623--637. 2009.We propose a new hybrid data mining method for predicting protein-protein interactions combining Likelihood-Ratio with rule induction algorithms. In essence, the new method consists of using a rule induction algorithm to discover rules representing partitions of the data, and then the discovered rules are interpreted as “bins” which are used to compute likelihood ratios. This new method is applied to the prediction of protein-protein interactions in the Saccharomyces Cerevisiae genome, using pre…Read more
-
University of KentRegular Faculty
Areas of Interest
| Philosophy of Biology |
| Philosophy of Mathematics |