Results 1  10
of
117
Accessible independence results for Peano arithmetic
 Bulletin of the London Mathematical Society
, 1982
"... Recently some interesting firstorder statements independent of Peano Arithmetic (P) have been found. Here we present perhaps the first which is, in an informal sense, purely numbertheoretic in character (as opposed to metamathematical or combinatorial). The methods used to prove it, however, are c ..."
Abstract

Cited by 70 (1 self)
 Add to MetaCart
, are combinatorial. We also give another independence result (unashamedly combinatorial in character) proved by the same methods. The first result is an improvement of a theorem of Goodstein [2]. Let m and n be natural numbers, n> 1. We define the base n representation of m as follows: First write m as the sum
Combinatorial Models For Coalgebraic Structures
 Adv. Math
, 1997
"... . We introduce a convenient category of combinatorial objects, known as cellsets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras, and ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
. We introduce a convenient category of combinatorial objects, known as cellsets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras
Building Trees, Hunting for Trees, and Comparing Trees  Theory and Methods in Phylogenetic Analysis
, 1997
"... Phylogenetics is the study and identification of evolutionary patterns and structures in nature; this thesis explores the mathematics of these structures. The basic objects of study are the leaf labelled tree and its substructures: quartets, splits, clusters and rooted triples, among others. We pres ..."
Abstract

Cited by 56 (0 self)
 Add to MetaCart
Phylogenetics is the study and identification of evolutionary patterns and structures in nature; this thesis explores the mathematics of these structures. The basic objects of study are the leaf labelled tree and its substructures: quartets, splits, clusters and rooted triples, among others. We present fundamental theorems and characterisations, as well as e#cient algorithms for a range of phylogenetic problems. It is often possible to deduce phylogenetic information not in the original data. We characterise an intriguing system of inference `rules' that arise in this way, and prove that there exist rules of every order that cannot be reduced to lower order rules.
Applying Artificial Intelligence to Virtual Reality: Intelligent Virtual Environments
 APPLIED ARTIFICIAL INTELLIGENCE
, 2000
"... Reearch into virtual environments on the one hand and artificial intelligence and artificial life on the other has largely been carried out by two different groups of people with different preoccupations and interests, but some convergence is now apparent between the two fields. Applications in w ..."
Abstract

Cited by 49 (5 self)
 Add to MetaCart
Reearch into virtual environments on the one hand and artificial intelligence and artificial life on the other has largely been carried out by two different groups of people with different preoccupations and interests, but some convergence is now apparent between the two fields. Applications in which activity independent of the user takes place  involving crowds or other agents  are beginning to be tackled, while synthetic agents, virtual humans and computer pets are all areas in which techniqes from the two fields require strong integration. The two communities have much to learn from each other if wheels are not to be reinvented on both sides. This paper reviews the issues arising from combining artificial intelligence and artificial life techniques with those of virtual environments to produce just such intelligent virtual environments. The discussion is illustrated with examples that include environments providing knowledge to direct or assist the user rather than r...
Nearest prototype classifier designs: an experimental study
 International Journal of Intelligent Systems
"... We compare eleven methods for finding prototypes upon which to base the nearest prototype classifier. Four methods for prototype selection are discussed: Wilson � Hart Ža condensation � errorediting method., and three types of combinatorial search�random search, genetic algorithm, and tabu search. ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
We compare eleven methods for finding prototypes upon which to base the nearest prototype classifier. Four methods for prototype selection are discussed: Wilson � Hart Ža condensation � errorediting method., and three types of combinatorial search�random search, genetic algorithm, and tabu search
History, overview and recent improvements of EGS4
"... this report has been plagiarised unashamedly from the original EGS3 #Electron Gamma Shower Code Version 3# document authored by Richard Ford and Ralph Nelson #1#. There are several reasons for this aside from laziness. This history predates one of the author's #AFB# involvement with EGS and he ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
this report has been plagiarised unashamedly from the original EGS3 #Electron Gamma Shower Code Version 3# document authored by Richard Ford and Ralph Nelson #1#. There are several reasons for this aside from laziness. This history predates one of the author's #AFB# involvement with EGS and he
History, overview and recent improvements of EGS4
"... this report has been plagiarised unashamedly from the original EGS3 (Electron Gamma Shower Code Version 3) document authored by Richard Ford and Ralph Nelson [1]. There are several reasons for this aside from laziness. This history predates one of the author's (AFB) involvement with EGS and he ..."
Abstract
 Add to MetaCart
this report has been plagiarised unashamedly from the original EGS3 (Electron Gamma Shower Code Version 3) document authored by Richard Ford and Ralph Nelson [1]. There are several reasons for this aside from laziness. This history predates one of the author's (AFB) involvement with EGS and he
Elsevier Editorial System(tm) for Discrete Mathematics Manuscript Draft Manuscript Number: DM 17382R1 Title: The vile, dopy, evil and odious game players Article Type: Special Issue: Sabidussi80
"... Abstract: Many of my friends celebrate these days anniversaries, be it 50th birthday, or 60th, 70th, 80th, even 90th. It is to be deplored that they all accumulate together, rather than distribute themselves uniformly over my lifetime! It's now Gert Sabidussi's turn, who just joined the oc ..."
Abstract
 Add to MetaCart
to provide formal proofs, we addressed this comment by doing two things. • We provided one proof, at the end. • We pointed out explicitly that we did experimental math. We admit that this does only rather partial justice to the referee’s just remark. We unashamedly relied on his giving us an option. Proofs
Superiority Based Revision of Defeasible Theories
 13 INTERNATIONAL WORKSHOP ON NONMONOTONIC REASONING (NMR 2010)
, 2010
"... We propose a systematic investigation on how to modify a preference relation in a defeasible logic theory to change the conclusions of the theory itself. We argue that the approach we adopt is applicable to legal reasoning, where users, in general, cannot change facts and rules, but can propose thei ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
their preferences about the relative strength of the rules. We provide a comprehensive study of the possible combinatorial cases and we identify and analyse the cases where the revision process is successful.
Results 1  10
of
117