Camera Ready !UL>
Registration Form !UL>
Page updating dates !UL>
Tabulation in Parsing and Deduction
Following TAPD'98 in Paris (France) next TAPD event will be held in Vigo (Spain), in September, 2000. The conference will be previous to SEPLN 2000, the conference of the Spanish Society for Natural Language Processing.
Tabulation techniques are becoming a common way to deal with highly redundant computations occurring, for instance, in Natural Language Processing, Logic Programming, Deductive Databases, or Abstract Interpretation, and related to phenomena such as ambiguity. non-determinism, or domain ordering.
Different approaches, including for example Chart Parsing, Magic-Set rewriting, Memoization, and Dynamic Programming, have been proposed whose key idea is to keep traces of computations to achieve computation sharing and loop detection. In addition, tabulation also offers more flexibility to investigate new parsing or proof strategies and to represent ambiguity by shared structures (Shared Proof or Parse Forest).
The first objective of this workshop is to compare and discuss these
different approaches. The second objective is to present tabulation and
tabular systems to potential users in different application areas. One
major area of application is Natural Language Processing, where tabulation
has been known for a long time (CKY, Earley, chart parsing). However, sophisticated
tabulation techniques are required for the more and more complex grammatical
formalisms now used in NLP (unification, constraints, structural complexity).
Contributions in other areas, such as picture parsing, genome analysis,
or complete deduction techniques, are also encouraged.
Topics (not exclusive)
Chart Parsing, Tabling, Memoization, Dynamic Programming, Magic Set, Generic Fix-Point Algorithms.
Parsing, Generation, Logic Programming, Deductive Databases,
Abstract Interpretation, Deduction in Knowledge Bases, Theorem Proving.
How to improve tabular evaluation.
Dealing with large tables (structure sharing, term indexing), Execution models Exploiting the domain ordering.
Their formal analysis, representation and processing.
The workshop will be a 3-day event that provides a forum for individual presentations of the accepted contributions as well as group discussions.
Submission ProcedureAuthors are invited to submit before April 28, 2000 a 4-page position paper or abstract concerning a theoretical contribution or a system to be presented. Due to tight time constraints, submissions will be handled exclusively electronically (LaTeX, PostScript, dvi or ascii format). Submissions should include the title, authors' names, affiliations, addresses, and e-mail. Submissions must be sent to the chairman David S. Warren
The collection of selected papers will be available at the
Submission of contributions: April 28, 2000 Notification of acceptance: June 1, 2000 Final versions due: July 14, 2000
TAPD'2000 Secretariat Escuela Superior de Ingeniería Informática Campus as Lagoas, s/n 32004 Ourense Spain
WWW homepage: http://coleweb.dc.fi.udc.es/tapd2000/
[Server root] [Cole Home] Report Bug
Original URL of this page: http://coleweb.dc.fi.udc.es/tapd2000/tapd.html
Last modified: Tuesday, October 03, 2000
Return to main page