1
.
Published Material
Up to my home directory 2
NIL
Theses
(1) David Billington (1972) Sentences Preserved Under Model-theoretic Constructions , B.Sc. Hons. Thesis, Department of Mathematics, Monash University, December 1972, 74pp.3
NIL
(2) David Billington (1975) Two Model Constructions and Unary Algebras , M.Sc. Thesis, Department of Mathematics, Monash University, December 1975, 87pp.
4
NIL
(3) David Billington (1981) Degree Multisets of Hypergraphs , Ph.D. Thesis, Department of Mathematics, University of Melbourne, December 1981, 180pp.
5
NIL
6
NIL
Refereed Journal Publications
(1) David Billington (1980) "Degree Sequences Uniquely Realisable within sets of Hypergraphs", Ars Combinatoria , 10 (1980), 65-81.7
NIL
(2) David Billington (1982) "A Simple Proof that All 1-Designs Exist", Discrete Mathematics , 42 (1982), 321-322.
8
NIL
(3) David Billington (1983) "The Connectedness of the Graph of Exact m-Graphic Realisations of a Degree Multiset", Ars Combinatoria , 16 (1983), 183-221.
9
NIL
(4) David Billington (1986) "Lattices and Degree Sequences of Uniform Hypergraphs", Ars Combinatoria , 21A (1986), 9-19.
10
NIL
(5) David Billington (1987) "The (s,p)-Exchange Property", Ars Combinatoria , 23 (1987), 185-200.
11
NIL
(6) David Billington (1988) "Conditions for Degree Sequences to be Realisable by 3-Uniform Hypergraphs", The Journal of Combinatorial Mathematics and Combinatorial Computing , 3 , (1988), 71-91.
12
NIL
(7) David Billington, Koen De Coster, and Donald Nute (1990) "A Modular Translation from Defeasible Nets to Defeasible Logics", Journal of Experimental and Theoretical Artificial Intelligence , 2 (1990), 151-177.
13
NIL
(8) David Billington (1993) "Using the Context-Free Pumping Lemma", Communications of the ACM , 36 (4) (1993), 21 & 81.
14
NIL
(9) David Billington (1993) "Defeasible Logic is Stable", Journal of Logic and Computation , 3 (4) August 1993, 379-400.
15
NIL
(10) David Billington and R. Geoff. Dromey (1996) "The Co-invariant Generator: an Aid in Deriving Loop Bodies", Formal Aspects of Computing , 8 (1) 1996, 108-126. (This paper version is almost incomprehensible due to 252 errors. A corrected electronic postscript version is at http://www.cs.man.ac.uk/fmethods/facj/e-papers/index.html )
16
NIL
17
NIL
Refereed Conference Publications
(1) David Billington (1980) "Degree Sequences Uniquely Realisable by Hypergraphs", Combinatorial Mathematics VII , Lecture Notes in Mathematics 829 , 59-68. (Springer-Verlag, Berlin, Heidelberg, New York, 1980).18
NIL
(2) David Billington (1981) "Connected Subgraphs of the Graph of Multigraphic Realisations of a Degree Sequence", Combinatorial Mathematics VIII , Lecture Notes in Mathematics 884 , 125-135. (Springer-Verlag, Berlin, Heidelberg, New York, 1981).
19
NIL
(3) David Billington (1982) "The Graph of Hypergraphic Realisations of Denumerable Multisets of Degrees", Combinatorial Mathematics IX , Lecture Notes in Mathematics 952 , 150-181. (Springer-Verlag, Berlin, Heidelberg, New York, 1982).
20
NIL
(4) D.E. Abel, C. Bailes, D. Billington, T.A. Chorvat, R.G. Dromey, D.D. Grant, and F. Suraweera (1989) "Program Derivation: A Clarification of Some Issues", Australian Computer Science Communications , 11 Nr.1 (1989), 108-119, Proceedings of the 12th Australian Computer Science Conference.
21
NIL
(5) David Billington, Koen De Coster, and Donald Nute (1989) "Defeasible Nets are Special Defeasible Logics", Proceedings of the 3rd Australian Joint Artificial Intelligence Conference , 1989, 363-375.
22
NIL
(6) David Billington (1990) "Some results on Defeasible Logic", Australian Computer Science Communications , 12 Nr.1 (1990), 11-20, Proceedings of the 13th Australian Computer Science Conference.
23
NIL
(7) Rachel Fordyce and David Billington (1992) "DLog(e): An Implementation of Defeasible Logic", Proceedings of the 5th Australian Joint Conference on Artificial Intelligence , 1992, 284-289.
24
NIL
(8) David Billington (1994) "Adding Disjunction to Defeasible Logic", Proceedings of the 7th Australian Joint Conference on Artificial Intelligence , 1994, 259-266. An earlier version entitled, Defeasible Logic with Disjunction, appeared in Proceedings of the Disjunctive Logic Programs Workshop within the International Logic Programming Symposium , San Diego, California, USA 1991, 1-15.
25
NIL
26
NIL
Refereed Workshop Articles
(1) Donald Nute, David Billington, and Koen De Coster (1989) "Defeasible Logics and Inheritance Hierarchies with Exceptions", Proceedings of the Tubingen Workshop on Semantic Nets, Inheritance, and Nonmonotonic Reasoning , University of Tubingen, Germany 1989, 69-82.27
NIL
(2) David Billington (1995) "Representing Beliefs Using Defeasible Logic", Proceedings of the First Australian Workshop on Commonsense Reasoning within the 8th Australian Joint Artificial Intelligence Conference , Canberra, Australia 1995, 12-22.
28
NIL
(3) David Billington (1996) "A Defeasible Logic with Quantifiers", Proceedings of the Workshop on Reasoning with Incomplete and Changing Information within the 4th Pacific Rim International Conference on Artificial Intelligence , Cairns, Australia 1996, 12 pages.
29
NIL
30
NIL
Book Review
David Billington (1994) Review of Gerhard Brewka's book "Nonmonotonic Reasoning: Logical Foundations of Commonsense", Journal of Logic and Computation , 4 (3) June 1994, 328-329.31
NIL
32
NIL
Dated: 18 July 1996
Author: David Billington