OXFORD UNIVERSITY  COMPUTING LABORATORY

Recent Talks

Modularity for Ontologies: Theory and Practice.
A talk given in the Logic and Computation group of the University of Liverpool, February 2008.
Pdf ]

Modularity for Ontologies: Theory and Practice.
A talk given at the Information Systems Seminar in the Oxford University (InfoSys Seminar), November 2007.
Pdf (1M) ]

Modularity for Ontology Development, Maintenance and Reuse.
A short talk given at the Oxfordshire Semantic Web Interest Group (Oxon SWIG), November 2007.
Pdf (468K) ]

Ontology Reuse: Better Safe than Sorry.
A talk given at the 20th International Workshop on Description Logics (DL 2007), June 2007.
Pdf (493K) ]

A Resolution-Based Decision Procedure for SHOIQ.
A talk given at the third International Joint Conference on Automated Reasoning (IJCAR 2006), August 2006.
Pdf (1M) ]

Saturation-Based Decision Procedures.
Slides from my PhD Defence, University of Saarland, 2006, March 2006.
Pdf (2M) ]

A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment.
A talk given at the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004) in Lisbon, Portugal, September 2004.

A Resolution Decision Procedure for the Guarded Fragment With Transitive Guards.
A talk given at the second International Joint Conference on Automated Reasoning (IJCAR 2004), July 2004.
Pdf (400K) ]

Resolution Decision Procedures for the Guarded Fragment with Transitive Guards.
A talk given at the Nancy-Saarbrücken Workshop on Logic, Proofs and Programs in Nancy, France, June 2004.

Using Redundancy and Basicness for Obtaining Decision Procedures for First-Order Fragments.
A talk given at the AG-2 group Logic Seminar in Schloß Ringberg, Germany, December 2003.
PowerPoint (740K) | Pdf (303K) ]

Subsumption of Concepts in DL FL0 for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-Complete.
A talk given at the 16th International Workshop on Description Logics (DL 2003) in Rome, Italy, September 2003.
PostScript [g-zip'd] (174K) | Pdf (1M) ]

Posters

Engineering Logical Algorithms Using Saturation-Based Theorem Proving.
Max-Planck-Institut für Informatik, June 2005.
PostScript [g-zip'd] (100K) | Pdf (105K) ]

Saturation-Based Decision Procedures and Complexity Analysis.
Max-Planck-Institut für Informatik, October 2004.
PowerPoint (1M) | URL ]

Random Image
Random Image
Random Image