Publications (3)0 Total impact
-
[show abstract]
[hide abstract]
ABSTRACT: This paper presents a novel multi-lingual progress protocol generation module. The module is used within the speech--to--speech translation system verbmobil. The task of the protocol is to give the dialogue partners a brief description of the content of their dialogue. We utilize an abstract representation describing, for instance, thematic information and dialogue acts of the dialogue utterances. From this representation we generate simplified paraphrases of the individual turns of the dialogue which together make up the protocol. Instead of writing completely new software, the protocol generation component is almost exclusively composed of already existing modules in the system which are extended by planning and formatting routines for protocol formulations. We describe how the abstract information is extracted from user utterances in different languages and how the abstract thematic representation is used to generate a protocol in one specific language. Future directions are given.
05/2000;
-
[show abstract]
[hide abstract]
ABSTRACT: We present a theoretical and practical approach to the modular natural deduction presentation of modal logics and their implementation in a logical framework. Our work treats a large and well-known class of modal logics (including K, D, T , B, S4, S4:2, KD45, S5) in a uniform way with respect to soundness and completeness for semantics, and faithfulness and adequacy of the implementation. Moreover, it results in a pleasingly simple and usable implementation of these logics. / 1 0.1 Introduction Logical Frameworks such as the Edinburgh LF (Harper et al. 1993) and Isabelle (Paulson 1994) have been proposed as a solution to the problem of the explosion of logics and specialized provers for them. However, it is also acknowledged that this solution is not perfect: these frameworks are best suited for encoding `well-behaved' natural deduction formalisms with metatheories that don't deviate too far from the metatheory of the framework logic. Modal logics, in particular, are considered dif...
03/1996;
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing constraint logic programming systems. Contents 1 Introduction 2 2 Constraint Logic Programming with 0-1 Constraints 3 2.1 Main problems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2 Pseudo-Boolean and finite domain constraints : : : : : : : : : : : : : : : : : : : : : : 6 3 Solving 0-1 Constraints 6 3.1 Equality descriptions of the solution set : : : : : : : : : : : : : : : : : : : : : : : : : 6 3.2 Inequality descriptions : : : : : : : : : : : : : : : : : : :...
05/1994;
