1. TAPD 1998: Paris, France

• Mark-Jan Nederhof:
  Linear Indexed Automata and Tabulation of TAG Parsing. 1-9
  Electronic Edition (link) BibTeX
• V. Díaz, V. Carrillo, M. Toro:
  Elementary Tree Representation. 10-15
  Electronic Edition (link) BibTeX
• John A. Carroll, Nicolas Nicolov, Olga Shaumyan, Martine Smets, David J. Weir:
  Grammar Compaction and Computation Sharing in Automata-based Parsing. 16-25
  Electronic Edition (link) BibTeX
• Kôiti Hasida, Takashi Miyata:
  Parsing and Generation with Tabulation and Compilation. 26-35
  Electronic Edition (link) BibTeX
• Hadar Shemtov:
  A Method for Preserving Ambiguities in Chart Generation. 36-43
  Electronic Edition (link) BibTeX
• Manuel Vilares Ferro, Miguel A. Alonso, Jorge Graña Gil, David Cabrero Souto:
  GALENA: Tabular DCG Parsing for Natural Languages. 44-51
  Electronic Edition (link) BibTeX
• Vitor Rocio, José Gabriel Lopes:
  Partial Parsing, Deduction and Tabling. 52-61
  Electronic Edition (link) BibTeX
• Juliana Freire, Terrance Swift, David Scott Warren:
  Scheduling in SLG Revisited. 62-66
  Electronic Edition (link) BibTeX
• Carlos Viegas Damásio, Luís Moniz Pereira:
  A General Tabulation Procedure for Extended Constraint Logic Programs. 67-74
  Electronic Edition (link) BibTeX
• José Júlio Alferes, Luís Moniz Pereira:
  Tabling Abduction. 75-82
  Electronic Edition (link) BibTeX
• Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka:
  Tabulation-based Induction Proofs with Application to Automated Verification. 83-88
  Electronic Edition (link) BibTeX
• A. G. Manousopoulou, George K. Papakonstantinou, Panayotis Tsanakas:
  A Chart-like Parser for Context Sensitive Grammars. 89-95
  Electronic Edition (link) BibTeX
• Hans Leiß:
  Bounded Fixed-Point Definability and Tabular Recognition of Languages. 96-107
  Electronic Edition (link) BibTeX
• Mark Hepple:
  Linear Categorial Deduction via First-order Compilation. 108-117
  Electronic Edition (link) BibTeX
• Gerda Janssens, Konstantinos F. Sagonas:
  On the Use of Tabling for Abstract Interpretation: An Experiment with Abstract Equation Systems. 118-126
  Electronic Edition (link) BibTeX
• Kazuhiko Ozeki:
  A Tabular Method of Finding the Optimal Word String together with its Dependency Structure. 127-132
  Electronic Edition (link) BibTeX
• Jean-Cédric Chappelier, Martin Rajman:
  A Generalized CYK Algorithm for Parsing Stochastic CFG. 133-137
  Electronic Edition (link) BibTeX