--- a/publications.html Fri Oct 28 10:16:45 2011 +0100
+++ b/publications.html Fri Oct 28 14:43:57 2011 +0100
@@ -2,7 +2,7 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<HEAD>
<TITLE> Christian Urban </TITLE>
-<BASE HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/">
+<BASE HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">
<script type="text/javascript">
var _gaq = _gaq || [];
@@ -40,18 +40,18 @@
ROWSPAN="17">
<B>Links</B><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/">Home</A><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/publications.html">Publications</A><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/teaching.html">Teaching</A><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/travelling.html">Recent Talks</A><BR>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">Home</A><BR>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/publications.html">Publications</A><BR>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/teaching.html">Teaching</A><BR>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/travelling.html">Recent Talks</A><BR>
<A HREF="http://isabelle.in.tum.de/nominal/">My Research Group</A>
<BR>
<BR>
<B>Handy Information</B><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/logic.html">People in Logic</A><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/programming.html">Programming Languages</A><BR>
-<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/logic.html">People in Logic</A><BR>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/programming.html">Programming Languages</A><BR>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A>
<BR><BR>
<A HREF="http://isabelle.in.tum.de/nominal/">
@@ -75,25 +75,25 @@
<p><B>Mechanizing the Metatheory of Mini-XQuery.</B>
(with Cheney) To appear at CPP 2011.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/cpp-11.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cpp-11.pdf">pdf</A>]
<p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions.</B>
(with Wu and Zhang) Journal version. Submitted.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">pdf</A>]
<p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
(with Kaliszyk) Journal version. Submitted.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]
<p><B>How to Prove False using the Variable Convention.</B>
Appears as a poster at TTVSI, 1 page.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/mike-poster-08.pdf">poster</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-08.pdf">poster</A>]
<p><B>Strong Induction Principles in the Locally Nameless
Representation of Binders (Preliminary Notes).</B> (with Pollack) A shorter version
of this paper was accepted at WMM'07.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/ln.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ln.pdf">pdf</A>]
</TD>
</TR>
@@ -105,7 +105,7 @@
In Proceedings of the 20th European Symposium on Programming (ESOP 2011).
In Volume 6602 of Lecture Notes in Computer Science. Pages 480-500.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6602.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>]
<p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof
Pearl).</B>
@@ -113,13 +113,13 @@
In Proceedings of the 2nd Conference on Interactive Theorem Proving (ITP 2011).
In Volume 6898 of Lecture Notes in Computer Science. Pages 341-356.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6898.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/itp-11.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/itp-11.pdf">pdf</A>]
<p><B>Quotients Revisited for Isabelle/HOL.</B>
(with Kaliszyk) In Proceedings of the ACM Symposium on Applied
Computing (SAC 2011), Software Verification and Testing track,
Pages 1639-1644.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/sac-11.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/sac-11.pdf">pdf</A>]
</TD>
</TR>
@@ -130,7 +130,7 @@
In Proceedings of the 1st Conference on Interactive Theorem Proving (ITP 2010).
In Volume 6172 of Lecture Notes in Computer Science. Pages 35-50.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6172.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
<p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer)
In <A HREF="http://doi.acm.org/10.1145/1877714.1877721">
@@ -140,7 +140,7 @@
<p><B>Nominal Unification Revisited.</B>
(invited paper) In Proceedings of the 24th Workshop on Unification (UNIF 2010).
In Volume 42 of Electronic Proceedings in Theoretical Computer Science. Pages 1-11, 2010.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/univ-10.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/univ-10.pdf">pdf</A>]
</TD>
</TR>
@@ -163,7 +163,7 @@
From Semantics to Computer Science, Essays in Honour of Gilles Kahn,
edited by Bertot, Huet, Levy and Plotkin. Cambridge
University Press, 2009. Pages 363-382.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/w-07.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/w-07.pdf">pdf</A>]
</TD>
</TR>
@@ -173,7 +173,7 @@
<p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer) In Proceedings of the
23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
June 2008. Pages 45-56.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
information is <A HREF="http://isabelle.in.tum.de/nominal/LF/index.html">elsewhere</A>.
<p><B>Nominal Inversion Principles.</B> (with Berghofer)
@@ -181,7 +181,7 @@
Higher Order Logics (TPHOLs'08). In Volume 5170 of Lecture Notes in
Computer Science. Pages 71-85.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5170.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tphols-08.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tphols-08.pdf">pdf</A>]<BR><BR>
(Note that the proof in figure 3 is chosen as an illustrative example to
show how to use inversion principles (the main topic of the paper). If one
@@ -204,7 +204,7 @@
and Applications (RTA 2008). In Volume 5117 of Lecture Notes in Computer Science.
Pages 409-424.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5117.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR>
(This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising
the proof in Nominal Isabelle.)
@@ -220,20 +220,20 @@
of Lecture Notes in Artificial Intelligence. Bremen, Germany.
July 2007. Pages 35-50.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/cade07.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps">ps</A>]
<BR><BR>This paper supersedes the MERLIN-paper from 2005.
<p><B>Nominal Techniques in Isabelle/HOL.</B> In
Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps">ps</A>]
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf">pdf</A>]
<p><B>Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.</B>
(with Narboux) In Proceedings of the International Workshop on Logical Frameworks and
Meta-Languages: Theory and Practice (LFMTP 2007). Electronic Notes in
Theoretical Computer Science. Vol. 196. Pages 3-18.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
(There is a minor problem in the statement on page 4 where we write that alpha-renamings
are required in order to show the equivalence of Q-Beta and Q-Beta': While the equivalence
@@ -253,7 +253,7 @@
<p><B>Proof Theory of Classical Propositional Calculus.</B>
(with Hyland, Bellin and Robinson) In Theoretical Computer
Science 2006. Vol. 364(2). Pages 143-170.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/class-tcs.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/class-tcs.ps">ps</A>]
<p><B>A Recursion Combinator for Nominal Datatypes
Implemented in Isabelle/HOL.</B> (with Berghofer) In Proceedings of the 3rd
@@ -261,19 +261,19 @@
Seattle, USA. In volume 4130 of Lecture Notes in Artificial Intelligence.
Pages 498-512.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4130.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps">ps</A>]
<p><B>Classical Logic is better than Intuitionistic Logic:
A Conjecture about Double-Negation Translations.</B> (with Ratiu) In Proceedings
of the 1st International Workshop on Classical Logic and Computation (CL & C 2006).
Venice, Italy. 20pp.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/clc-06.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/clc-06.ps">ps</A>]
<p><B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> (with Berghofer)
In Proceedings of the International Workshop on Logical Frameworks and
Meta-Languages: Theory and Practice (LFMTP 2006). Electronic Notes in
Theoretical Computer Science. Vol. 174(5). Pages 53-67.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps">ps</A>]
</TD>
</TR>
@@ -283,8 +283,8 @@
<p><B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions.</B> (with Norrish)
In Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
Binding and Names (MERLIN 2005). Tallinn, Estonia. September 2005. Pages 25-32. © ACM, Inc.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps">ps</A>]
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf">pdf</A>]
<p>
(There was a small typo in the definition of permutation equality, which has been corrected
in the versions above. This paper received favourable comments on the
@@ -294,13 +294,13 @@
Conference on Automated Deduction (CADE 2005). In volume 3632 of Lecture Notes in Artificial
Intelligence. Tallinn, Estonia. July 2005. Pages 38-53.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3632.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">ps</A>]
<p><B>Avoiding Equivariance in Alpha-Prolog.</B> (with Cheney) In Proceedings of the 7th
International Conference on Typed Lambda Calculi and Applications (TLCA 2005).
In Volume 3461 of Lecture Notes in Computer Science. Nara, Japan. April 2005. Pages 401-416.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3461.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/alpha-tlca.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/alpha-tlca.ps">ps</A>]
</TD>
</TR>
@@ -310,8 +310,8 @@
<H3>2004</H3>
<p><B>Nominal Unification.</B> (with Pitts and Gabbay) In Theoretical Computer Science
2004. Vol. 323(1-3). Pages 473-497.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.ps">ps</A>]
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.pdf">pdf</A>]
<p><B>Nominal Techniques for Reasoning about Formal Languages.</B> Reader for an advanced
course at the ESSLLI summer school. 26 Pages. Appeared as LORIA technical report.
@@ -321,7 +321,7 @@
(ICLP 2004). In Volume 3132 of Lecture Notes in Computer Science. St-Malo, France.
September 2004. Pages 269-283.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3132.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/alpha-iclp.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/alpha-iclp.ps">ps</A>]
</TD>
</TR>
@@ -333,18 +333,18 @@
(CSL & KGC 2003). In Volume 2803 of Lecture Notes in Computer Science. Vienna, Austria.
August 2003. Pages 513-527.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t2803.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nomu.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu.ps">ps</A>]
<p><B>System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo
Alpha-Equivalence.</B> (with Cheney) In Proceedings of the 17th International Workshop on
Unification, UNIF'03. Valencia, Spain. June 2003. Technical Report
DSIC-II/12/03, Departamento de Sistemas Informaticos y Computacion,
Universidad Politecnica de Valencia, 2003. Pages 15-19.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/aprolog.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/aprolog.ps">ps</A>]
<p><B>Work in Progress: Logic Programming with Names and Binding.</B> (with Cheney)
CoLogNet Newsletter No. 4, 2003. Pages 25-28.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/aprolog-colognet.ps">ps</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/aprolog-colognet.ps">ps</A>]
</TD>
</TR>
@@ -354,7 +354,7 @@
<p><B>Strong Normalisation of Herbelin's Explicit Substitution Calculus with
Substitution Propagation.</B>
(with Dyckhoff) Journal of Logic and Computation, Volume 13, No 5, Pages 689-706.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/jlc-03.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/jlc-03.pdf">pdf</A>]
<!--
<p><B>Revisiting Zucker's Work on the Correspondence Between Cut-Elimination and
@@ -368,22 +368,22 @@
<H3>2001</H3>
<p><B>Strong Normalisation of Cut-Elimination in Classical Logic.</B> (with Bierman)
Fundamenta Informaticae, 45(1-2), January 2001, Pages 123-155.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/fi-01.ps.gz">ps.gz</A>]
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/fi-01.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/fi-01.ps.gz">ps.gz</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/fi-01.pdf">pdf</A>]
<p><B>Strong Normalisation of Herbelin's Explicit Substitution Calculus with
Substitution Propagation.</B> (with Dyckhoff) In Proceedings of the 4th
Workshop on Explicit Substitutions Theory and Applications (WESTAPP'01).
Logic Group Preprint series No 210. Utrecht, the Netherlands. May 2001. Pages 26-45.
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/westapp-01.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/westapp-01.pdf">pdf</A>]
<p><B>Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.</B>
In Proceedings of the 5th International Conference on Typed Lambda Calculi and
Applications (TLCA 2001). In Volume 2044 of Lecture Notes in
Computer Science. Krakow, Poland. May 2001. Pages 415-429.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t2044.htm">Springer Verlag</A>
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.ps.gz">ps.gz</A>]
- [<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.pdf">pdf</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.ps.gz">ps.gz</A>]
+ [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.pdf">pdf</A>]
</TD>
</TR>
@@ -392,8 +392,8 @@
<H3>2000</H3>
<p><B>Classical Logic and Computation.</B>
Ph.D. Thesis, University of Cambridge. Supervised by Dr Gavin Bierman. October 2000.
-Some details are <A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/PhD/">elsewhere</A>.
-[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/Phd-Urban.ps.gz">ps.gz</A>]
+Some details are <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/PhD/">elsewhere</A>.
+[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Phd-Urban.ps.gz">ps.gz</A>]
</TD>
</TR>
@@ -405,8 +405,8 @@
Lambda Calculi and Applications (TLCA 1999). In Volume 1581 of Lecture Notes in
Computer Science. L'Aquila, Italy. April 1999. Pages 365-380.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t1581.htm">Springer Verlag</A>
-[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tlca-99.ps.gz">ps.gz</A>]
-[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tlca-99.pdf">pdf</A>]
+[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.ps.gz">ps.gz</A>]
+[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.pdf">pdf</A>]
</TD>
</TR>
@@ -418,7 +418,7 @@
Analytic Tableaux and Related Methods (TABELAUX 1998). In Volume 1397 of Lecture Notes in
Artificial Intelligence. Oisterwijk, the Netherlands. May 1998. Pages 313-319.
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t1397.htm">Springer Verlag</A>
-[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tableaux-98.ps.gz">ps.gz</A>]
+[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-98.ps.gz">ps.gz</A>]
</TD>
</TR>