Anzeige der Dokumente 1-20 von 89

    • Parallele Automaten 

      Kutrib, Martin (1994)
    • On stack-augmented polyautomata 

      Kutrib, Martin (1995)
      A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of real­time, linear­time and ...
    • On time computability of functions in one-way cellular automata 

      Buchholz, Thomas; Kutrib, Martin (1995)
      The capability of one­way (space­bounded) cellular automata (OCA) to time­compute functions is investigated. That means given an constant input of length n a distinguished cell has to enter a distinguished state exactly ...
    • On the power of one-way bounded cellular time computers 

      Buchholz, Thomas; Kutrib, Martin (1996)
      Comparisons of different cellular devices and the investigation of their computing power can be made in terms of their capabilities to time­construct and time­compute functions. Time­construction means that a distinguished ...
    • Informatik an der JLUG : "Interdiziplinärer Workshop" 

      Kröger, Henner; Kutrib, Martin (1996)
    • Some relations between massively parallel arrays 

      Buchholz, Thomas; Kutrib, Martin (1996)
      Relations between various models for massively parallel computers are investigated. These are arrays of finite­state machines -- eventually augmented by pushdown storage -- operating synchronously. The architectures differ ...
    • Existential second-order logic over strings 

      Eiter, Thomas; Gottlob, Georg; Gurevich, Yuri (1997)
      Existential second­order logic (ESO) and monadic second­order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was ...
    • Enhancing symbolic model checking by AI techniques 

      Buccafurri, Francesco; Eiter, Thomas; Gottlob, Georg; Leone, Nicola (1997)
      Comparisons of different cellular devices and the investigation of their computing power can be made in terms of their capabilities to time­construct and time­compute functions. Time­construction means that a distinguished ...
    • Räumliche Konzentration der Verpackungsmaschinenbau-Industrie in Mittelhessen : Eine Analyse des Gründungsgeschehens 

      Mossig, Ivo (1998)
      Stellt man die Standorte der Verpackungsmaschinenbau-Betriebe in Deutschland1 dar, so fällt auf, daß sich die Betriebe nicht gleichmäßig verteilen, sondern auf wenige Schwerpunktregionen konzentrieren (vgl. Abb. 1). Die ...
    • Decision lists and related Boolean functions 

      Eiter, Thomas; Ibaraki, Toshihide; Makino, Kazuhisa (1998)
      We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1­decision lists has interesting relationships to ...
    • On interacting automata with limited nondeterminism 

      Buchholz, Thomas; Klein, Andreas; Kutrib, Martin (1998)
      One­way and two­way cellular language acceptors with restricted non­ determinism are investigated. The number of nondeterministic state transitions is regarded as limited resource which depends on the length of the input. ...
    • Probalistic and truth-functional many-valued logic programming 

      Lukasiewicz, Thomas (1998)
      We introduce probabilistic many­valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex ...
    • Computing intersections of Horn theories for reasoning with models 

      Eiter, Thomas; Ibaraki, Toshihide; Makino, Kazuhisa (1998)
      Model­based reasoning has been proposed as an alternative form of representing and accessing logical knowledge bases. In this approach, a knowledge base is represented by a set of characteristic models. In this paper, we ...
    • On time reduction and simulation in cellular spaces 

      Buchholz, Thomas; Klein, Andreas; Kutrib, Martin (1998)
      We prove a generalized and corrected version of the time reduction theorem for cellular spaces. One basic tool for investigations in this field is the concept of simulation between systems of automata. We propose a general ...
    • One guess one-way cellular arrays 

      Buchholz, Thomas; Klein, Andreas; Kutrib, Martin (1998)
      One­way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a limit to exactly one step does not decrease ...
    • A first-order representation of stable models 

      Eiter, Thomas; Lu, James; Subrahmanian, V.S (1998)
      Turi (1991) introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a constrained interpretation. We investigate ...
    • Heterogeneous active agents 

      Eiter, Thomas; Subrahmanian, V.S; Pick, George (1998)
      Over the years, many different agent programming languages have been proposed. In this paper, we propose a concept called Agent Programs using which, the way an agent should act in various situations can be declaratively ...
    • Preferred answer sets for extended logic programs 

      Brewka, Gerd; Eiter, Thomas (1998)
      In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules ...
    • On tally languages and generalized interacting automata 

      Buchholz, Thomas; Klein, Andreas; Kutrib, Martin (1999)
      Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well­known result that each tally language acceptable by a classical one­way cellular ...