• 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...