%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:14 +0100 GMT
%    
% Selection : Author: Anton_Nijholt
%




@InProceedings{Duchier:2000,
      AUTHOR = {Duchier, Denys},
      TITLE = {A Model-Eliminative Treatment of Quantifier-Free Tree Descriptions},
      YEAR = {2000},
      BOOKTITLE = {Algebraic Methods in Language Processing (AMILP '00). 16th Twente Workshop on Language Technology (TWLT 16) and 2nd AMAST Workshop, May 20-22},
      PAGES = {55-66},
      EDITOR = {Heylen, D. and Nijholt, Anton and Scollo, G.},
      ADDRESS = {Iowa City, Iowa, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-amilp.ps.gz},
      ABSTRACT = {Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. For practical applications, it is essential to be able to decide satisfiability and enumerate solutions efficiently. This challenge cannot realistically be met by brute force enumeration. However it can be addressed very effectively by constraint propagation as provided by modern constraint technology. Previously, we studied the conjunctive fragment of tree descriptions and showed how the problem of finding minimal models of a conjunctive tree description could be transformed into a constraint satisfaction problem (CSP) on finite set variables. In this paper, we extend our account to the fragment that admits both negation and disjunction, but still leaves out quantification. Again we provide a reduction to a CSP. While our previous encoding introduced the reader to set constraints and disjunctive propagators, we now extend our arsenal with selection propagators.},
      ANNOTE = {COLIURL : Duchier:2000:MET.pdf Duchier:2000:MET.ps}
}

@InCollection{Nederhof:2000_3,
      AUTHOR = {Nederhof, Mark-Jan},
      TITLE = {Regular Approximation of CFLs: A Grammatical View},
      YEAR = {2000},
      BOOKTITLE = {Advances in Probabilistic and other Parsing Technologies},
      PAGES = {221-241},
      EDITOR = {Bunt, Harry and Nijholt, Anton},
      PUBLISHER = {Kluwer Academic Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.ps.gz},
      ABSTRACT = {We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.},
      ANNOTE = {COLIURL : Nederhof:2000:RACa.pdf Nederhof:2000:RACa.ps}
}

@InCollection{Nederhof:2000_4,
      AUTHOR = {Nederhof, Mark-Jan},
      TITLE = {Regular Approximation of CFLs: A Grammatical View},
      YEAR = {2000},
      BOOKTITLE = {Advances in Probabilistic and other Parsing Technologies},
      PAGES = {221-241},
      EDITOR = {Bunt, Harry and Nijholt, Anton},
      PUBLISHER = {Kluwer Academic Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.entry},
      ANNOTE = {COLIURL : Nederhof:2000:RAC.pdf Nederhof:2000:RAC.ps}
}

@InProceedings{Neumann:1993,
      AUTHOR = {Neumann, Günter},
      TITLE = {Design Principles of the Disco System},
      YEAR = {1993},
      BOOKTITLE = {Proceedings of the Twente Workshop on Language Technology (TWLT 5). Natural Language Interfaces, June 3-4},
      EDITOR = {de Jong, Franciska and Nijholt, Anton},
      ADDRESS = {University of Twente, Enschede, The Netherlands},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/disco-archi.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/disco-archi.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/disco-archi.ps.Z http://www.dfki.de/cl/papers/cl-abstracts.html#disco-archi.abstract}
}