On the Complexity of Branching-Time Logics (2009)
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, past modalities, and...
On the Hybrid Extension of CTL and CTL+ (2009)
Kara, Ahmet, Lange, Martin, Schwentick, Thomas, Weber, Volker
The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results...
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I (2009)
Meier, Arne, Mundhenk, Martin, Schneider, Thomas, Thomas, Michael, Weber, Volker, Weiss, Felix
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate...
Complexity of Hybrid Logics over Transitive Frames (2008)
Mundhenk, Martin, Schneider, Thomas, Schwentick, Thomas, Weber, Volker
This paper examines the complexity of hybrid logics over transitive frames, transitive trees, and linear frames. We show that satisfiability over transitive frames for the hybrid language extended...
Hybrid Branching-Time Logics (2008)
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we restrict to logics...
Using Hybrid Connectionist Learning for Improving Speech/Language Analysis (2008)
. In this paper we describe a screening approach for speech/ language analysis using learned, flat connectionist representations. For investigating this approach we built a hybrid connectionist...
Hybrid Branching-Time Logics (2007)
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single...
Bounded-variable fragments of hybrid logics (2007)
Thomas Schwentick, Volker Weber
Abstract. Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is undecidable...
Dynamic Complexity Theory Revisited (2005)
Volker Weber, Thomas Schwentick
Abstract. Dynamic complexity asks for the effort needed to maintain the information about properties of a structure under operations changing the structure. This paper introduces a refined notion of...
Complexity of hybrid logics over transitive frames (2005)
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
Abstract. This paper examines the complexity of hybrid logics over transitive frames and transitive trees. We show that satisfiability over transitive frames for the hybrid language extended with ↓...
Dynamic Complexity Theory Revisited (2005)
Volker Weber, Thomas Schwentick
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of dynamic problems which...
Complexity of Hybrid Logics over Transitive Frames (2005)
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
This paper examines the complexity of hybrid logics over transitive frames and transitive trees. We show that satisfiability over transitive frames for the hybrid language extended with is...
Complexity of hybrid logics over transitive frames (2005)
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
Abstract. This paper examines the complexity of hybrid logics over transitive frames and transitive trees. We show that satisfiability over transitive frames for the hybrid language extended with #...
Complexity of hybrid logics over transitive frames (2005)
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
Abstract. This paper examines the complexity of hybrid logics over transitive frames and transitive trees. We show that satisfiability over transitive frames for the hybrid language extended with ↓...
Dynamisches Kostenmanagement in kompetenzzentrierten Unternehmensnetzwerken / (2004)
Thesis (doctoral) - Techn. Univ., München, 2004.
Time Mapping with Hypergraphs (1998)
Word graphs are able to represent a large num-ber of different utterance hypotheses in a very compact manner. However, usually they con-tain a huge amount of redundancy in terms of word hypotheses...
Time Mapping with Hypergraphs (1998)
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of word hypotheses that...
Wermter, Stefan, Weber, Volker
In this paper, we describe a so-called screening approach for learning robust processing of spontaneously spoken language. A screening approach is a flat analysis which uses shallow sequences of...
Previous approaches of analyzing spontaneously spoken language often have been based on encoding syntactic and semantic knowledge manually and symbolically. While there has been some progress using...
Previous approaches of analyzing spontaneously spoken language often have been based on encoding syntactic and semantic knowledge manually and symbolically. While there has been some progress using...
Stefan Wermter Wermter, Volker Weber
Previous approaches of analyzing spontaneously spoken language often have been based on encoding syntactic and semantic knowledge manually and symbolically. While there has been some progress using...
Stefan Wermter, Volker Weber (1997)
Stefan Wermter, Stefan Wermter, Volker Weber, Volker Weber, Arbeitsbereich Naturlichsprachliche Systeme, ...
Previous approaches of analyzing spontaneously spoken language often have been based on encoding syntactic and semantic knowledge manually and symbolically. While there has been some progress using...
Previous approaches of analyzing spontaneously spoken language often have been based on encoding syntactic and semantic knowledge manually and symbolically. While there has been some progress using...
Using Hybrid Connectionist Learning for Speech/Language Analysis (1996)
Abstract. In this paper we describe a screening approach forspeech/ language analysis using learned, at connectionist representations. For investigating this approach we built a hybrid connectionist...
Using Hybrid Connectionist Learning for Speech/Language Analysis (1996)
. In this paper we describe a screening approach for speech/ language analysis using learned, flat connectionist representations. For investigating this approach we built a hybrid connectionist...
Spoken Language Processing in the Hybrid Connectionist Architecture SCREEN (1996)
Stefan Wermter, Stefan Wermter, Volker Weber, Volker Weber, Arbeitsbereich Naturlichsprachliche Systeme, ...
In this paper 1 we describe a robust, learning approach to spoken language understanding. Since interactively spoken and computationally analyzed language often contains many errors, robust...
Spoken Language Processing in the Hybrid Connectionist Architecture SCREEN (1996)
Stefan Wermter, Stefan Wermter, Volker Weber, Volker Weber, Arbeitsbereich Naturlichsprachliche Systeme
In this paper 1 we describe a robust, learning approach to spoken language understanding. Since interactively spoken and computationally analyzed language often contains many errors, robust...
Abstract. In this paper we describe a new approach for learning spontaneous language for multiple domains using artificial neural networks. This approach is based on a novel use of flat syntactic and...
. In this paper we describe a new approach for learning spontaneous language for multiple domains using artificial neural networks. This approach is basedon a novel use of flat syntactic and semantic...
Towards Learning Semantics of Spontaneous Dialog Utterances in a Hybrid Framework (1995)
. In contrast to text processing, spontaneous language contains many discontinuities caused by unusual order, false starts, repairs, repetitions, pauses, etc. Data-driven connectionist learning...
Artificial Neural Networks for Repairing Language (1995)
. Spontaneous language contains many discontinuities caused by unusual order, false starts, repairs, repetitions, pauses, etc. Since data-driven artificial neural networks possess an inherent fault...
Learning Fault-tolerant Speech Parsing with SCREEN (1994)
Wermter, Stefan, Weber, Volker
This paper describes a new approach and a system SCREEN for fault-tolerant speech parsing. SCREEEN stands for Symbolic Connectionist Robust EnterprisE for Natural language. Speech parsing describes...
Stefan Wermter, Volker Weber (1994)
Vm-Report Juni, Stefan Wermter, Stefan Wermter, Volker Weber, Volker Weber, Arbeitsbereich Naturlichsprachliche Systeme, ...
This paper 1 describes a new approach and a system SCREEN 2 for faulttolerant speech parsing. Speech parsing describes the syntactic and semantic analysis of spontaneous spoken language. The general...
Learning Fault-tolerant Speech Parsing with SCREEN (1994)
This paper describes a new approach and a system SCREEN 1 for fault-tolerant speech parsing. Speech parsing describes the syntactic and semantic analysis of spontaneous spoken language. The general...
Learning Fault-tolerant Speech Parsing with SCREEN (1994)
Stefan Wermter, Stefan Wermter, Volker Weber, Volker Weber, Arbeitsbereich Naturlichsprachliche Systeme, ...
This paper 1 describes a new approach and a system SCREEN 2 for faulttolerant speech parsing. Speech parsing describes the syntactic and semantic analysis of spontaneous spoken language. The general...
Unification in Prolog by Connectionist Models (1993)
This paper describes a connectionist unification strategy. We introduce an uncertainty measure for unification. A self-organizing feature map is used for learning a similarity measure and a...
Connectionist Unifying Prolog (1993)
We introduce an connectionist approach to unification using a local and a distributed representation. A Prolog-System using these unification-strategies has been build. Prolog is a Logic Programming...
Titel und Aufgaben der ädilizischen Gemeindebeamten im römischen Pompeji. (1970)
Erscheint in 2 Bd.
Tübingen, Med. F., Diss. v. 11. Juli 1967.
Thesis (doctoral)--Eberhard-Karls-Universität zu Tübingen, 1967.