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




@InProceedings{Althaus_et_al:2001,
      AUTHOR = {Althaus, Ernst and Duchier, Denys and Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim and Thiel, Sven},
      TITLE = {An Efficient Algorithm for the Configuration Problem of Dominance Graphs},
      YEAR = {2001},
      BOOKTITLE = {12th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 7-9},
      ADDRESS = {Washington D.C., USA},
      PUBLISHER = {ACM Press},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dom-graph.ps.gz},
      ABSTRACT = {Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only emph(normal) dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.},
      ANNOTE = {COLIURL : Althaus:2001:EAC.pdf Althaus:2001:EAC.ps}
}

@Article{Althaus_et_al:2003,
      AUTHOR = {Althaus, Ernst and Duchier, Denys and Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim and Thiel, Sven},
      TITLE = {An Efficient Graph Algorithm for Dominance Constraints},
      YEAR = {2003},
      JOURNAL = {Journal of Algorithms},
      VOLUME = {48},
      PAGES = {194--219},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/eff-dom.ps.gz},
      ABSTRACT = {Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time. Previously, no polynomial time algorithm was known.},
      ANNOTE = {COLIURL : Althaus:19xx:EGA.pdf Althaus:19xx:EGA.ps}
}

@InProceedings{Bodirsky_et_al:2001,
      AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim},
      TITLE = {Beta Reduction Constraints},
      YEAR = {2001},
      BOOKTITLE = {12th International Conference on Rewriting Techniques and Applications (RTA'01), May 22-24},
      PAGES = {31-46},
      EDITOR = {Middeldorp, Aart},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Utrecht, The Netherlands},
      PUBLISHER = {Springer-Verlag},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/beta.ps.gz},
      ABSTRACT = {The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints.},
      ANNOTE = {COLIURL : Bodirski:2001:BRC.pdf Bodirsky:2001:BRC.ps}
}

@InProceedings{Bodirsky_et_al:2001_1,
      AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim},
      TITLE = {Underspecified Beta Reduction},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 6-11},
      PAGES = {74-81},
      ADDRESS = {Toulouse, France},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/usp-beta.ps.gz https://www.coli.uni-saarland.de/~koller/papers/usp-beta.ps.gz},
      ABSTRACT = {For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be beta-reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for $lambda$-structures (CLLS).},
      ANNOTE = {COLIURL : Bodirski:2001:UBR.pdf Bodirsky:2001:UBR.ps}
}

@Article{Egg_et_al:2001,
      AUTHOR = {Egg, Markus and Koller, Alexander and Niehren, Joachim},
      TITLE = {The Constraint Language for Lambda Structures},
      YEAR = {2001},
      JOURNAL = {Journal of Logic, Language, and Information},
      VOLUME = {10},
      NUMBER = {4},
      PAGES = {457-485},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/clls.ps.gz},
      ANNOTE = {COLIURL : Egg:2001:CLL.pdf Egg:2001:CLL.ps}
}

@TechReport{Egg_et_al:1998_1,
      AUTHOR = {Egg, Markus and Koller, Alexander and Niehren, Joachim and Ruhrberg, Peter},
      TITLE = {Constraints over Lambda Structures, Antecedent Contained Deletion, and Quantifier Identities},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Computational Linguistics and Programming Systems Lab, University of the Saarland},
      ABSTRACT = {The constraint language for lambda-structures (CLLS) allows for a simple, integrated, and underspecified treatment of scope, ellipses, anaphora, and their interaction. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. In the case of antecedent contained deletion (ACD), the definition of parallelism in the original version of CLLS is slightly too restrictive due to an overly weak notion of quantifier identity. We show how to extend CLLS with an appropriate notion of quantifier identity such that ACD can be naturally analysed. This sheds some light on conflicting requirements on quantifier representations as needed for ACD and Hirschbühler sentences.}
}

@InProceedings{Erk_Koller:2001,
      AUTHOR = {Erk, Katrin and Koller, Alexander},
      TITLE = {VP Ellipsis by Tree Surgery},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of the 13th Amsterdam Colloquium, December 17-19},
      ADDRESS = {Amsterdam},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/jigsaw.ps.gz},
      ABSTRACT = {We present jigsaw parallelism constraints, a flexible formal tool for replacing parts of trees with other trees. Jigsaw constraints extend the Constraint Language for Lambda Structures, a language used in underspecified semantics to declaratively describe scope, ellipsis, and their interaction, and can be used to improve the coverage of ellipses represented by CLLS.},
      ANNOTE = {COLIURL : Erk:2001:VET.pdf Erk:2001:VET.ps}
}

@Article{Erk_et_al:2003,
      AUTHOR = {Erk, Katrin and Koller, Alexander and Niehren, Joachim},
      TITLE = {Processing Underspecified Semantic Descriptions in the Constraint Language for Lambda Structures},
      YEAR = {2003},
      JOURNAL = {Research on Language and Computation},
      VOLUME = {1},
      PAGES = {127--169},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/cllsproc.ps.gz},
      ABSTRACT = {The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions which combines dominance constraints with powerful parallelism and binding constraints. CLLS was introduced as a uniform framework for defining underspecified semantics representations of natural language sentences, covering scope, ellipsis, and anaphora. This article presents saturation-based algorithms for processing the complete language of CLLS and gives an overview of previous results on questions of processing and complexity.},
      ANNOTE = {COLIURL : Erk:2002:PUS.pdfErk:2002:PUS.ps}
}

@InProceedings{Gabsdil_et_al:2001,
      AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Building a Text Adventure on Description Logic},
      YEAR = {2001},
      BOOKTITLE = {KI-2001 Workshop on Applications of Description Logics, September 18},
      VOLUME = {44},
      EDITOR = {Görz, Günther and Haarslev, V. and Lutz, C. and Möller, R.},
      ADDRESS = {Vienna, Austria},
      PUBLISHER = {CEUR Workshop Proceedings},
      URL = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-44/Gabsdil-et-al.ps.gz},
      ABSTRACT = {We describe an engine for a computer game which employs techniques from computational linguistics and theorem proving based on description logic. We show how we represent a world model as a DL knowledge base and then illustrate how we use it in the computational linguistics modules with the examples of analyzing and generating referring expressions.},
      ANNOTE = {COLIURL : Gabsdil:2001:BTA.pdf Gabsdil:2001:BTA.ps}
}

@InProceedings{Gabsdil_et_al:2001_1,
      AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Playing with Description Logic},
      YEAR = {2001},
      BOOKTITLE = {2nd Workshop on Methods for Modalities (M4M). Application Description, November 29-30},
      ADDRESS = {University of Amsterdam, The Netherlands},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/m4m2.ps.gz},
      ABSTRACT = {We describe an engine for a computer game which has at its core a description logic knowledge base and employs techniques from computational linguistics for its natural language user interface. We show how we represent the state of the game as a DL knowledge base, how we model changes in the world, and how the computational linguistics modules access the knowledge base to analyze the input wrt. the context and produce contextually appropriate output.},
      ANNOTE = {COLIURL : Gabsdil:2001:PDL.pdf Gabsdil:2001:PDL.ps}
}

@InProceedings{Gabsdil_et_al:2002,
      AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Natural Language and Inference in a Computer Game},
      YEAR = {2002},
      BOOKTITLE = {19th International Conference on Computational Linguistics (COLING '02), August 24 - September 1},
      ADDRESS = {Taipei, Taiwan},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/game-nl.ps.gz},
      ABSTRACT = {We present an engine for text adventures -- computer games with which the player interacts using natural language. The system employs current methods from computational linguistics and an efficient inference system for description logic to make the interaction more natural. The inference system is especially useful in the linguistic modules dealing with reference resolution and generation and we show how we use it to rank different readings in the case of referential and syntactic ambiguities. It turns out that the player's utterances are naturally restricted in the game scenario, which simplifies the language processing task.},
      ANNOTE = {COLIURL : Gabsdil:2002:NLI.pdf Gabsdil:2002:NLI.ps}
}

@InProceedings{Jaspars_Koller:1999,
      AUTHOR = {Jaspars, Jan and Koller, Alexander},
      TITLE = {A Calculus for Direct Deduction with Dominance Constraints},
      YEAR = {1999},
      BOOKTITLE = {12th Amsterdam Colloquium (AC '99)},
      ADDRESS = {Amsterdam, The Netherlands},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/domded.ps.gz},
      ABSTRACT = {Underspecification has recently been a popular approach to dealing with ambiguity. An important operation in this context is direct deduction, deduction on underspecified descriptions which is justified by the meaning of the described formulae. Here we instantiate an abstract approach to direct deduction to dominance constraints, a concrete underspecification formalism, and obtain a sound and complete calculus for this formalism.},
      ANNOTE = {COLIURL : Jaspars:1999:CDD.pdf Jaspars:1999:CDD.ps}
}

@InProceedings{Kohlhase_Koller:2000,
      AUTHOR = {Kohlhase, Michael and Koller, Alexander},
      TITLE = {Towards a Tableaux Machine for Language Understanding (ICoS '00)},
      YEAR = {2000},
      BOOKTITLE = {2nd Workshop on Inference in Computational Semantics (ICoS-2), July 30},
      ADDRESS = {Schloss Dagstuhl, Germany},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/txm.ps.gz},
      ABSTRACT = {We outline an abstract inference machine for producing discourse models in natural language understanding. This machine has tableaux as its central data structure and can operate in model generation and theorem proving modes. Search spaces are controlled by keeping track of NP saliences and equipping proof rules with costs.},
      ANNOTE = {COLIURL : Kohlhase:2000:TTM.pdf Kohlhase:2000:TTM.ps}
}

@Article{Kohlhase_Koller:2003,
      AUTHOR = {Kohlhase, Michael and Koller, Alexander},
      TITLE = {Resource-Adaptive Model Generation as a Performance Model},
      YEAR = {2003},
      JOURNAL = {Logic Journal of the IGPL},
      VOLUME = {11},
      NUMBER = {4},
      PAGES = {435--456},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/mgperf.ps.gz},
      ABSTRACT = {Model generation calculi, close relatives of tableau calculi for theorem proving, can be used as competence models for semantic natural language understanding. Unfortunately existing model generation calculi are not yet plausible as performance models of actual human processing, since they fail to capture computational aspects of human language processing. We outline an extended model generation calculus that solves the most unpleasant computational inadequacy; In the extended calculus, tableau expansion rules are equipped with costs, and model construction is a process that optimizes model quality under resource constraints with respect to these costs. We embed the new calculus into an abstract inference machine and illustrate the possibilities of this approach by presenting a partial theory of definites in this setting. In this case study, the constants in the universe are given saliences, that are maintained across the model generation process. This additional data serves as one important source of information for model quality and resource cost estimation.},
      ANNOTE = {COLIURL : Kohlhase:19xx:RAM.pdfKohlhase:19xx:RAM.ps}
}

@InProceedings{Koller:1998,
      AUTHOR = {Koller, Alexander},
      TITLE = {Evaluating Context Unification for Semantic Underspecification},
      YEAR = {1998},
      BOOKTITLE = {3rd ESSLLI Student Session (ESSLLI '98), August 17-28},
      PAGES = {188-199},
      EDITOR = {Korbayova, Ivana},
      ADDRESS = {Saarbrücken, Germany},
      ABSTRACT = {Context unification has been proposed as a powerful formalism for the uniform and underspecified treatment of scope ambiguities and parallelism. We develop an algorithm for context unification that alleviates the enormous computational and overgeneration problems of earlier algorithms. It is incomplete for full context unification, but finds all linguistically relevant solutions. We apply an implementation of the new algorithm to evaluate context unification as a tool for semantic analysis.},
      ANNOTE = {COLIURL : Koller:1998:ECU.pdf}
}

@MastersThesis{Koller:1999,
      AUTHOR = {Koller, Alexander},
      TITLE = {Constraint Languages for Semantic Underspecification},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Computational Linguistics},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Koller99.ps.gz},
      ABSTRACT = {At all levels of linguistic analysis, natural language can be ambiguous. The numbers of readings of different ambiguous components of a sentence or discourse multiply over all these components, yielding a number of readings that can be exponential in the number of ambiguities. Both from a computational and a cognitive point of view, it seems necessary to find small representations for ambiguities that describe all readings in a compact way. This approach is called underspecification, and it has received increasing attention in the past few years. Lately, two particularly elegant formalisms for the underspecified treatment of scope ambiguities in semantics have been proposed: Context Unification and the Constraint Language for Lambda Structures, CLLS. Common to both is that they regard the term representing the semantics of a sentence as a tree and describe it by imposing tree constraints. Furthermore, both offer the expressive power to describe simple ellipses and their interaction with scope ambiguities. This thesis investigates some formal properties of these two formalisms. It examines their relation and shows that, except for a few additional constructs of CLLS, both languages are equivalent in expressive power. In terms of computational complexity, this gives us the immediate result that the complexity of the satisfiability problem of CLLS is exactly the same as that of context unification, which, unfortunately, is unknown. The thesis further investigates the complexity of the satisfiability problem of dominance constraints, an important sublanguage of CLLS, and shows that it is NP-complete. In the course of the discussion of complexity, it also briefly explains how techniques from concurrent constraint programming can be applied to implement solution algorithms for these formalisms.},
      ANNOTE = {COLIURL : Koller:1999:CLS.pdf Koller:1999:CLS.ps}
}

@Proceedings{Alexander_Gideon:2002,
      TITLE = {Proceedings of the Student Research Workshop at ACL-02, July 7-12},
      YEAR = {2002},
      EDITOR = {Koller, Alexander and Mann, Gideon},
      ADDRESS = {Philadelphia, Pennsylvania, USA}
}

@InProceedings{Koller_et_al:2000,
      AUTHOR = {Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim},
      TITLE = {A Polynomial-Time Fragment of Dominance Constraints},
      YEAR = {2000},
      BOOKTITLE = {38th Annual Meeting of the Association of Computational Linguistics (ACL '00), October 1-8},
      ADDRESS = {Hong Kong},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/poly-dom.ps.gz},
      ABSTRACT = {Dominance constraints are a logical language for describing trees that is widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify emphnormal dominance constraints, a natural fragment whose satisfiability problem we show to be in polynomial time. We present a quadratic satisfiability algorithm and use it in another algorithm that enumerates solutions efficiently. Our result is useful for various applications of dominance constraints and related formalisms.},
      ANNOTE = {COLIURL : Koller:2000:PTF.pdf Koller:2000:PTF.ps}
}

@TechReport{Koller_Niehren:1999,
      AUTHOR = {Koller, Alexander and Niehren, Joachim},
      TITLE = {Scope Underspecification and Processing},
      YEAR = {1999},
      TYPE = {Reader for the ESSLLI summer school},
      URL = {http://www.ps.uni-sb.de/~niehren/ESSLLI99/ ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ESSLLI:99.ps.gz},
      ABSTRACT = {This reader contains material for the ESSLLI '99 course, Scope Underspecification and Processing''. The reader and course are aimed at a pretty broad audience; we have tried to only presuppose a very general idea of natural language processing and of first-order logic. Underspecification is a general approach to dealing with ambiguity. In the course, we'll be particularly concerned with scope underspecification, which deals with scope ambiguity, a structural ambiguity of the semantics of a sentence. As scope underspecification is at least partially motivated by computational issues, we will pay particular attention to processing aspects. We're going to show how dominance constraints can be used for scope underspecification and how they can be processed efficiently by using concurrent constraint programming technology.},
      ANNOTE = {COLIURL : Koller:1999:SUP.pdf Koller:1999:SUP.ps}
}

@InProceedings{Koller_Niehren:2000,
      AUTHOR = {Koller, Alexander and Niehren, Joachim},
      TITLE = {Constraint Programming in Computational Linguistics},
      YEAR = {2000},
      BOOKTITLE = {8th CSLI Workshop on Logic Language and Computation, May 30},
      EDITOR = {Barker-Plummer, Dave and Beaver, D. and van Benthem, Johan and Scotto di Luzio, P.},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI},
      URL = {http://www.ps.uni-sb.de/Papers/abstracts/CP-NL.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/CP-NL.ps.gz},
      ABSTRACT = {Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatorial explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing.},
      ANNOTE = {COLIURL : Koller:2000:CPC.pdf Koller:2000:CPC.ps}
}

@InProceedings{Koller_Niehren:2000_1,
      AUTHOR = {Koller, Alexander and Niehren, Joachim},
      TITLE = {On Underspecified Processing of Dynamic Semantics},
      YEAR = {2000},
      BOOKTITLE = {18th International Conference on Computational Linguistics (COLING '00), July 31 - August 4},
      PAGES = {460-466},
      ADDRESS = {Saarbrücken, Germany},
      PUBLISHER = {Morgan Kaufmann},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dynamic.ps.gz},
      ABSTRACT = {We propose a new inference system which operates on underspecified semantic representations of scope and anaphora. This inference system exploits anaphoric accessibility conditions known from dynamic semantics to decide scope ambiguities if possible. The main feature of the system is that it deals with underspecified descriptions directly, i.e. without enumerating readings.},
      ANNOTE = {COLIURL : Koller:2000:UPD.pdf Koller:2000:UPD.ps}
}

@InCollection{Koller_Niehren:2002,
      AUTHOR = {Koller, Alexander and Niehren, Joachim},
      TITLE = {Constraint Programming in Computational Linguistics},
      YEAR = {2002},
      BOOKTITLE = {Words, Proofs, and Diagrams},
      EDITOR = {Barker-Plummer, Dave and Beaver, David I. and van Benthem, Johan and di Luzio, Patrick Scotto},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI Press},
      URL = {http://www.ps.uni-sb.de/Papers/abstracts/CP-NL.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/CP-NL.ps.gz},
      ABSTRACT = {Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatorial explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing.},
      NOTE = {Extended version of a paper at the 8th Stanford Workshop on Logic, Language, and Computation (1999)},
      ANNOTE = {COLIURL : Koller:2002:CPC.pdf Koller:2002:CPC.ps}
}

@InProceedings{Koller_et_al:1999,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Striegnitz, Kristina},
      TITLE = {Relaxing Underspecified Semantic Representations for Reinterpretation},
      YEAR = {1999},
      BOOKTITLE = {6th Meeting on Mathematics of Language (MOL6), July 23-25},
      PAGES = {74-87},
      ADDRESS = {Orlando, Florida, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Relax99.ps.gz},
      ABSTRACT = {Type and sort conflicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which conflicts are avoided by underspecification. The main idea is to derive sufficiently relaxed underspecified semantic representations; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing underspecified representations bears the danger of overgeneration. In this paper, we investigate this problem in the framework of CLLS, where underspecified representations are expressed by tree descriptions subsuming dominance constraints. We introduce some novel properties of dominance constraints and present a safety criterion that ensures that an underspecified description can be relaxed without adding unwanted readings. We then apply this criterion systematically to Egg's analysis and show why its relaxation operation does not lead to overgeneration.},
      ANNOTE = {COLIURL : Koller:1999:RUS.pdf Koller:1999:RUS.ps}
}

@Article{Koller_et_al:2000_1,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Striegnitz, Kristina},
      TITLE = {Relaxing Underspecified Semantic Representations for Reinterpretation},
      YEAR = {2000},
      JOURNAL = {Grammars},
      VOLUME = {3},
      NUMBER = {2-3},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/relax2000.ps.gz},
      ABSTRACT = {Type and sort conflicts in semantics are usually resolved by a process of reinterpretation, which introduces an operator into the semantic representation. We elaborate on the foundations of a recent approach to reinterpretation within a framework for semantic underspecification. In this approach, relaxed underspecified semantic representations are inferred from the syntactic structure, leaving space for subsequent addition of reinterpretation operators. Unfortunately, a structural danger of overgeneration is inherent to the relaxation of underspecified semantic representations. We identify the problem and distinguish structural properties that avoid it. We furthermore develop techniques for proving these properties and apply them to prove the safety of relaxation in a prototypical syntax/semantics interface. In doing so, we present some novel properties of tree descriptions in the constraint language over lambda structures (CLLS).},
      ANNOTE = {COLIURL : Koller:2000:RUS.pdf Koller:2000:RUS.ps}
}

@InProceedings{Koller_et_al:1998,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Treinen, Ralf},
      TITLE = {Dominance Constraints: Algorithms and Complexity},
      YEAR = {1998},
      BOOKTITLE = {3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16},
      ADDRESS = {Grenoble, France},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/DominanceNP98.ps.gz},
      ABSTRACT = {Dominance constraints for finite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their first-order theory. We present two NP algorithms for solving dominance constraints, which have been implemented in the concurrent constraint programming language Oz. The main result of this paper is that the satisfiability problem of dominance constraints is NP-complete. Despite this intractability result, the more sophisticated of our algorithms performs well in an application to scope underspecification. We also show that the existential fragment of the first-order theory of dominance constraints is NP-complete and that the full first-order theory has non-elementary complexity.},
      ANNOTE = {COLIURL : Koller:1998:DCA.pdf Koller:1998:DCA.ps}
}

@InProceedings{Koller_Striegnitz:2002,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Generation as Dependency Parsing},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the 40th Anniversary Meeting of the Association of Computational Linguistics (ACL2002), July 6-12},
      ADDRESS = {University of Pennsylvania, Philadelphia},
      URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/acl2002.ps.gz https://www.coli.uni-saarland.de/~koller/papers/gen-dg.ps.gz},
      ABSTRACT = {Natural-Language Generation from flat semantics is an NP-complete problem. This makes it necessary to develop algorithms that run with reasonable efficiency in practice despite the high worst-case complexity. We show how to convert TAG generation problems into dependency parsing problems, which is useful because optimizations in recent dependency parsers based on constraint programming tackle exactly the combinatorics that make generation hard. Indeed, initial experiments display promising runtimes.},
      ANNOTE = {COLIURL : Koller:2002:GDP.pdf Koller:2002:GDP.ps}
}

@InProceedings{Niehren_Koller:1998,
      AUTHOR = {Niehren, Joachim and Koller, Alexander},
      TITLE = {Dominance Constraints in Context Unification},
      YEAR = {1998},
      BOOKTITLE = {3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16},
      NUMBER = {2014},
      PAGES = {199-218},
      EDITOR = {Moortgat, M.},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Grenoble, France},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Dominance-98.ps.gz},
      ABSTRACT = {Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics, and discourse. Tree descriptions in the language of context unification have attracted some interest in unification and rewriting theory. Recently, dominance constraints and context unification have both been used in different underspecified approaches to the semantics of scope, parallelism, and their interaction. This raises the question whether both description languages are related. In this paper, we show for a first time that dominance constraints can be expressed in context unification. We also prove that dominance constraints extended with parallelism constraints are equal in expressive power to context unification.},
      ANNOTE = {COLIURL : Niehren:1998:DCC.pdf Niehren:1998:DCC.ps}
}

@InProceedings{Althaus_et_al:2004,
      AUTHOR = {Althaus, Ernst and Karamanis, Nikiforos and Koller, Alexander},
      TITLE = {Computing Locally Coherent Discourses},
      YEAR = {2004},
      BOOKTITLE = {Proceedings of the 42nd ACL},
      ADDRESS = {Barcelona}
}

@InProceedings{Debusmann_et_al:2004,
      AUTHOR = {Debusmann, Ralph and Duchier, Denys and Koller, Alexander and Kuhlmann, Marco and Smolka, Gert and Thater, Stefan},
      TITLE = {A Relational Syntax-Semantics Interface Based on Dependency Grammar},
      YEAR = {2004},
      BOOKTITLE = {Proceedings of the 20th COLING},
      ADDRESS = {Geneva}
}

@InProceedings{Dienes_et_al:2003,
      AUTHOR = {Dienes, Peter and Koller, Alexander and Kuhlmann, Marco},
      TITLE = {Statistical A* Dependency Parsing},
      YEAR = {2003},
      BOOKTITLE = {Proceedings of the Workshop on Prospects and Advances in the Syntax/Semantics Interface},
      ADDRESS = {Nancy}
}

@InProceedings{Fuchss_et_al:2004,
      AUTHOR = {Fuchss, Ruth and Koller, Alexander and Niehren, Joachim and Thater, Stefan},
      TITLE = {Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis},
      YEAR = {2004},
      BOOKTITLE = {Proceedings of the 42nd ACL},
      ADDRESS = {Barcelona}
}

@InProceedings{Koller_Kruijff:2004,
      AUTHOR = {Koller, Alexander and Kruijff, Geert-Jan M.},
      TITLE = {Talking Robots With LEGO MindStorms},
      YEAR = {2004},
      BOOKTITLE = {Proceedings of the 20th COLING},
      ADDRESS = {Geneva, Switzerland},
      URL = {Koller:2004:TRL}
}

@Article{Koller_et_al:2004,
      AUTHOR = {Koller, Alexander and Debusmann, Ralph and Gabsdil, Malte and Striegnitz, Kristina},
      TITLE = {Put my galakmid coin into the dispenser and kick it: Computational Linguistics and Theorem Proving in a Computer Game},
      YEAR = {2004},
      JOURNAL = {Journal of Logic, Language and Information: Special Issue on ICoS-3},
      VOLUME = {13},
      NUMBER = {2},
      PAGES = {187--206},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/kluwer2004.ps.gz}
}

@InProceedings{Koller_et_al:2003,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Thater, Stefan},
      TITLE = {Bridging the Gap between Underspecification Formalisms: Hole Semantics as Dominance Constraints},
      YEAR = {2003},
      BOOKTITLE = {Proceedings of the 10th Conference of The European Chapter of the Association for Computational Linguistics},
      PAGES = {195--202},
      ADDRESS = {Budapest, Hungary},
      URL = {Koller:2003:BGB}
}

@InProceedings{KoTh2007,
      AUTHOR = {Koller, Alexander and Thater, Stefan},
      TITLE = {Solving unrestricted dominance graphs},
      YEAR = {2007},
      BOOKTITLE = {Proceedings of the 12th Conference on Formal Grammar, Dublin},
      NOTE = {AK, MP}
}

@InProceedings{KoLa2009,
      AUTHOR = {Koller, Alexander and Lascarides, Alex},
      TITLE = {A logic of semantic representations for shallow parsing},
      YEAR = {2009},
      BOOKTITLE = {EACL 2009 : proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, 30 March – 3 April 2009, Megaron Athens International Conference Centre, Athens, Greece},
      PAGES = {451-459},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InCollection{KoPiTh2009,
      AUTHOR = {Koller, Alexander and Pinkal, Manfred and Thater, Stefan},
      TITLE = {Scope underspecification with tree descriptions : theory and practice},
      YEAR = {2009},
      BOOKTITLE = {Resource-adaptive cognitive processes},
      PAGES = {337-364},
      EDITOR = {Crocker, Matthew W. and Siekmann, Joerg},
      ADDRESS = {Heidelberg [u.a.]},
      PUBLISHER = {Springer},
      NOTE = {AK, MP}
}

@InProceedings{ReEgKo2008,
      AUTHOR = {Regneri, Michaela and Egg, Markus and Koller, Alexander},
      TITLE = {Efficient processing of underspecified discourse representations},
      YEAR = {2008},
      BOOKTITLE = { 		ACL-08: HLT : 46th annual meeting of the Association for Computational Linguistics: human language technologies ; June 16 - 17, 2008, The Ohio State University, Columbus, Ohio, USA},
      PAGES = {245-248},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK, MP}
}

@InProceedings{KoPe2008,
      AUTHOR = {Koller, Alexander and Petrick, Ronald},
      TITLE = {Experiences with planning for natural language generation},
      YEAR = {2008},
      BOOKTITLE = {Proceedings of SPARK-08 : the ICAPS-08 Scheduling and Planning Applications Workshop ; Sydney, Australia, September 15, 2008},
      ADDRESS = {Sidney},
      NOTE = {AK, MP}
}

@InProceedings{ArKoSt2008,
      AUTHOR = {Areces, Carlos and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Referring expressions as formulas of description logic},
      YEAR = {2008},
      BOOKTITLE = {INLG 2008 : Fifth International Natural Language Generation Conference ; proceedings ; June 12–14, 2008 Salt Fork, Ohio, USA},
      PAGES = {42-49},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK, MP}
}

@InProceedings{KoReTh2008,
      AUTHOR = {Koller, Alexander and Regneri, Michaela and Thater, Stefan},
      TITLE = {Regular tree grammars as a formalism for scope underspecification},
      YEAR = {2008},
      BOOKTITLE = {ACL-08: HLT : 46th annual meeting of the Association for Computational Linguistics: human language technologies ; proceedings of the conference ; June 15 - 20, 2008, The Ohio State University, Columbus, Ohio, USA},
      PAGES = {218-226},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK, MP}
}

@InProceedings{GaKo2009,
      AUTHOR = {Garoufi, Konstantina and Koller, Alexander},
      TITLE = {Controlling the spatio-visual context in situated natural language generation},
      YEAR = {2009},
      BOOKTITLE = {Abstracts of the International Conference Space in Language : Pisa, October 8th-10th, 2009 [Elektronische Ressource]},
      ADDRESS = {Pisa},
      NOTE = {AK}
}

@InProceedings{KoKu2009,
      AUTHOR = {Koller, Alexander and Kuhlmann, Marco},
      TITLE = {Dependency trees and the strong generative capacity of CCG},
      YEAR = {2009},
      BOOKTITLE = {EACL 2009 : proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, 30 March – 3 April 2009, Megaron Athens International Conference Centre, Athens, Greece},
      PAGES = {460-468},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InProceedings{ByKoStCaDaMoOb2009,
      AUTHOR = {Byron, Donna and Koller, Alexander and Striegnitz, Kristina and Cassell, Justine and Dale, Robert and Moore, Johanna and Oberlander, Jon},
      TITLE = {Report on the first NLG Challenge on Generating Instructions in Virtual Environments (GIVE)},
      YEAR = {2009},
      BOOKTITLE = {ENLG 2009 : 12th European Workshop on Natural Language Generation ; proceedings of the workshop ; March30 & 31, 2009; Athens, Greece},
      PAGES = {165-173},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InProceedings{ReKoPi2010,
      AUTHOR = {Regneri, Michaela and Koller, Alexander and Pinkal, Manfred},
      TITLE = {Learning Script Knowledge with Web Experiments},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of ACL},
      ADDRESS = {Uppsala},
      ORGANIZATION = {ACL},
      NOTE = {MP, AK}
}

@InProceedings{KoByCaDaStMoOb2009,
      AUTHOR = {Koller, Alexander and Byron, Donna and Cassell, Justine and Dale, Robert and Striegnitz, Kristina and Moore, Johanna and Oberlander, Jon},
      TITLE = {The software architecture for the first Challenge on Generating Instructions in Virtual Environments},
      YEAR = {2009},
      BOOKTITLE = {EACL 2009 : proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, 30 March – 3 April 2009, Megaron Athens International Conference Centre, Athens, Greece},
      PAGES = {33-36},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InProceedings{KoStByCaDaDaMoOb2009,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina and Byron, Donna and Cassell, Justine and Dale, Robert and Dazel-Job, Sara and Moore, Johanna and Oberlander, Jon},
      TITLE = {Validating the web-based evaluation of NLG systems},
      YEAR = {2009},
      BOOKTITLE = {Joint Conference of the 47th Annual Meeting of the Association for Computational Linguistics and 4th International Joint Conference on Natural Language Processing of the AFNLP : proceedings of the conference, 2-7 August 2009, Suntec, Singapore ; ACL-IJCNL},
      PAGES = {301-304},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InCollection{KoThPi2010,
      AUTHOR = {Koller, Alexander and Thater, Stefan and Pinkal, Manfred},
      TITLE = {Scope Underspecification with tree descriptions: Theory and practice},
      YEAR = {2010},
      BOOKTITLE = {Resource Adaptive Cognitive Processes},
      EDITOR = {Siekmann, Joerg and Crocker, Matthew W.},
      SERIES = {Cognitive Technologies Series},
      PUBLISHER = {Springer},
      NOTE = {AK, MP}
}

@InProceedings{KoTh2010a,
      AUTHOR = {Koller, Alexander and Thater, Stefan},
      TITLE = {Computing weakest readings},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL 2010)},
      NOTE = {AK, MP}
}

@InProceedings{KoTh2010,
      AUTHOR = {Koller, Alexander and Thater, Stefan},
      TITLE = {Computing relative normal forms in regular tree languages},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 21st Conference on Rewriting Techniques and Applications (RTA), Edinburgh},
      NOTE = {AK, MP}
}

@InProceedings{BaKo2010,
      AUTHOR = {Bauer, Daniel and Koller, Alexander},
      TITLE = {Sentence generation as planning with Probabilistic LTAG.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 10th TAG+ Workshop, New Haven.},
      NOTE = {AK}
}

@InProceedings{KoStGaByCaDaMoOb2010,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina and Gargett, Andrew and Byron, Donna and Cassell, Justine and Dale, Robert and Moore, Johanna and Oberlander, Jon},
      TITLE = {Report on the Second NLG Challenge on Generating Instructions in Virtual Environments (GIVE-2).},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the International Natural Language Generation Conference (INLG), Dublin.},
      NOTE = {AK}
}

@InProceedings{KuKoSa2010,
      AUTHOR = {Kuhlmann, Marco and Koller, Alexander and Satta, Giorgio},
      TITLE = {The importance of rule restrictions in CCG.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 48th ACL, Uppsala},
      NOTE = {AK}
}

@InProceedings{GaKo2010,
      AUTHOR = {Garoufi, Konstantina and Koller, Alexander},
      TITLE = {Automated planning for situated natural language generation.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL), Uppsala, Sweden, 2010.},
      NOTE = {AK}
}

@InProceedings{KoGaGa2010,
      AUTHOR = {Koller, Alexander and Gargett, Andrew and Garoufi, Konstantina},
      TITLE = {A scalable model of planning perlocutionary acts.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 14th Workshop on the Semantics and Pragmatics of Dialogue (SemDial), Poznan, Poland, 2010.},
      NOTE = {AK}
}

@InProceedings{KoHo2010,
      AUTHOR = {Koller, Alexander and Hoffmann, Jörg},
      TITLE = {Waking up a sleeping rabbit: On natural-language generation with FF.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 20th ICAPS (Short Papers), Toronto.},
      NOTE = {AK}
}

@InProceedings{GaGaKoSt2010,
      AUTHOR = {Gargett, Andrew and Garoufi, Konstantina and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {The GIVE-2 Corpus of Giving Instructions in Virtual Environments.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 7th International Conference on Language Resources and Evaluation (LREC), Malta.},
      NOTE = {AK}
}

@Article{KoPe2010,
      AUTHOR = {Koller, Alexander and Petrick, Ronald},
      TITLE = {Experiences with Planning for Natural Language Generation.(to appear)},
      YEAR = {2010},
      JOURNAL = {Computational Intelligence},
      NOTE = {AK}
}

@InCollection{KoStByCaDaMoOb2010,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina and Byron, Donna and Cassell, Justine and Dale, Robert and Moore, Johanna and Oberlander, Jon},
      TITLE = {The First Challenge on Generating Instructions in Virtual Environments.},
      YEAR = {2010},
      BOOKTITLE = {Empirical Methods in Natural Language Generation},
      EDITOR = {Kramer, Emiel and Theune, Mariet},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer},
      NOTE = {AK}
}

@InProceedings{ReKoRu2011,
      AUTHOR = {Regneri, Michaela and Koller, Alexander and Ruppenhofer, Josef and Pinkal, Manfred},
      TITLE = {Learning script participants from unlabeled data},
      YEAR = {2011},
      MONTH = {12-14 September},
      BOOKTITLE = {Proceedings / International Conference Recent Advances in Natural Language Processing},
      PAGES = {463-470},
      ADDRESS = {Hissar, Bulgaria},
      NOTE = {MP}
}

@InProceedings{KollGa2012,
      AUTHOR = {Koller, Alexander and Garoufi, Konstantina and Staudte, Maria and Crocker, Matthew W.},
      TITLE = {Enhancing referential success by tracking hearer gaze},
      YEAR = {2012},
      MONTH = {5-6 July},
      BOOKTITLE = {13th Annual Meeting of the Special Interest Group on Discourse and Dialogue : SIGdial 2012},
      PAGES = {30-39},
      ADDRESS = {Seoul National University, Seoul, South Korea},
      PUBLISHER = {ACL},
      NOTE = {MC, sonst. Mitarbeiter}
}

@InBook{KoPin2012,
      AUTHOR = {Koller, Alexander and Pinkal, Manfred},
      TITLE = {Semantic research in computational linguistics},
      YEAR = {2012},
      BOOKTITLE = {Semantics : An international handbook of natural language meaning},
      VOLUME = {3},
      EDITOR = {Maienborn, C. and Von Heusinger, K. and Portner, P.},
      ADDRESS = {Berlin},
      PUBLISHER = {Mouton de Gruyter}
}

@InProceedings{StaKoll2012,
      AUTHOR = {Staudte, Maria and Koller, Alexander and Garoufi, Konstantina and Crocker, Matthew W.},
      TITLE = {Using listener gaze to augment speech generation in a virtual 3D environment},
      YEAR = {2012},
      MONTH = {1-4 August},
      BOOKTITLE = {Proceedings of the 34th Annual Meeting of the Cognitive Science Society},
      PAGES = {1007-1012},
      ADDRESS = {Austin, TX},
      ORGANIZATION = {Cognitive Science Society},
      NOTE = {MC, sonst. Mitarbeiter}
}

@Misc{StaCro2012,
      AUTHOR = {Staudte, Maria and Crocker, Matthew W. and Koller, Alexander and Garoufi, Konstantina},
      TITLE = {Grounding spoken instructions using listener gaze in dynamic virtual environments},
      YEAR = {2012},
      HOWPUBLISHED = {Embodied and Situated Language Processing : [5th] ESLP 2012},
      NOTE = {MC, sonst. Mitarbeiter}
}

@Article{DemKell2013,
      AUTHOR = {Demberg, Vera and Keller, Frank and Koller, Alexander},
      TITLE = {Incremental, predictive parsing with psycholinguistically motivated tree-adjoining grammar},
      YEAR = {2013},
      JOURNAL = {Computational linguistics},
      VOLUME = {39},
      NUMBER = {4},
      PAGES = {1025-1066},
      NOTE = {sonst. Mitarbeiter}
}

@Article{GaStaKoCro2016,
      AUTHOR = {Garoufi, Konstantina and Staudte, Maria and Koller, Alexander and Crocker, Matthew W.},
      TITLE = {Exploiting listener gaze to improve situated communication in dynamic virtual environments.},
      YEAR = {2016},
      JOURNAL = {Cognitive Science},
      VOLUME = {40},
      NUMBER = {7},
      PAGES = {1671-1703},
      NOTE = {sonst. Mitarbeiter, AK, MC}
}

@InProceedings{GroKolJoh2016,
      AUTHOR = {Groschwitz, Jonas and Koller, Alexander and Johnson, Mark},
      TITLE = {Efficient techniques for parsing with tree automata},
      YEAR = {2016},
      MONTH = {7-12 August},
      BOOKTITLE = {Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (ACL 2016)},
      PAGES = {2042–2051},
      ADDRESS = {Berlin, Germany},
      NOTE = {AK}
}

@InProceedings{TeiWanKol2016,
      AUTHOR = {Teichmann, Christoph and Wansing, Kasimir and Koller, Alexander},
      TITLE = {Adaptive Importance Sampling from Probabilistic Tree Automata},
      YEAR = {2016},
      MONTH = {12 August},
      BOOKTITLE = {Proceedings of the ACL Workshop on Statistical NLP and Weighted Automata (ACL 2016)},
      PAGES = {11–20},
      ADDRESS = {Berlin, Germany},
      NOTE = {AK}
}

@InProceedings{GGKT2017,
      AUTHOR = {Gontrum, Johannes and Groschwitz, Jonas and Koller, Alexander and Teichmann, Christoph},
      TITLE = {Alto: Rapid Prototyping for Parsing and Translation},
      YEAR = {2017},
      MONTH = {April},
      BOOKTITLE = {Proceedings of the EACL Demo Session},
      ADDRESS = {Valencia, Spanien},
      NOTE = {AK}
}

@InProceedings{VilTeiKol2017,
      AUTHOR = {Villalba, Martin and Teichmann, Christoph and Koller, Alexander},
      TITLE = {Generating Contrastive Referring Expressions},
      YEAR = {2017},
      BOOKTITLE = {Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (ACL)},
      PAGES = {678-687},
      ADDRESS = {Vancouver, Kanada},
      NOTE = {AK}
}

@InProceedings{KolEng2017,
      AUTHOR = {Koller, Alexander and Engonopoulos, Nikolaos},
      TITLE = {Integrated sentence generation with charts},
      YEAR = {2017},
      BOOKTITLE = {Proceedings of the 10th International Conference on Natural Language Generation (INLG)},
      ADDRESS = {Santiago de Compostela, Spain},
      NOTE = {AK}
}

@InProceedings{Koller2017,
      AUTHOR = {Koller, Alexander},
      TITLE = {A feature structure algebra for FTAG},
      YEAR = {2017},
      MONTH = {September},
      BOOKTITLE = {Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+13)},
      ADDRESS = {Umea, Sweden},
      NOTE = {AK}
}

@InProceedings{GFJK2017,
      AUTHOR = {Groschwitz, Jonas and Fowlie, Meaghan and Johnson, Mark and Koller, Alexander},
      TITLE = {A constrained graph algebra for semantic parsing with AMRs},
      YEAR = {2017},
      BOOKTITLE = {Proceedings of the 12th International Conference on Computational Semantics (IWCS)},
      ADDRESS = {Montpellier, Frankreich},
      NOTE = {AK}
}

@InProceedings{TeiKolGro2017,
      AUTHOR = {Teichmann, Christoph and Koller, Alexander and Groschwitz, Jonas},
      TITLE = {Coarse-To-Fine Parsing for Expressive Grammar Formalisms},
      YEAR = {2017},
      BOOKTITLE = {Proceedings of the 15th International Conference on Parsing Technologies (IWPT)},
      ADDRESS = {Pisa, Italien},
      NOTE = {AK}
}

@InProceedings{FowKol2017,
      AUTHOR = {Fowlie, Meaghan and Koller, Alexander},
      TITLE = {Parsing Minimalist Languages with Interpreted Regular Tree Grammars},
      YEAR = {2017},
      BOOKTITLE = {Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+13)},
      ADDRESS = {Umea, Sweden},
      NOTE = {AK}
}