#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1994

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Panos Rondogiannis, William W. Wadge
- ACM Trans. Comput. Log.
- 2005

We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics, the meaning of a program is, as in the classical case, the unique <i>minimum</i> model in a program-independent ordering. We use an expanded truth domain that has an uncountable linearly ordered set of… (More)

- Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis
- Developments in Language Theory
- 2006

Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In this paper we give a novel semantics for boolean grammars which applies to all such grammars , independently of their syntax. The key idea of our proposal comes from the area of negation in… (More)

- Zoltán Ésik, Panos Rondogiannis
- Theor. Comput. Sci.
- 2015

Cím: A fixed point theorem for non-monotonic functions

- Christos Nomikos, Panos Rondogiannis, Manolis Gergatsoulis
- Theor. Comput. Sci.
- 2005

We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal… (More)

- Christos Nomikos, Panos Rondogiannis
- LATA
- 2007

We introduce locally stratified Boolean grammars, a natural subclass of Boolean grammars with many desirable properties. Informally, if a grammar is locally stratified then the set of all pairs of the form (nonterminal, string) of the grammar can be mapped to a (possibly infinite) set of strata so as that the following holds: if the membership of a string w… (More)

- Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis
- Theor. Comput. Sci.
- 2009

We obtain a simple, purely game-theoretic characterization of Boolean grammars In particular, we propose a two-player infinite game of perfect information for Boolean grammars, which is equivalent to their well-founded semantics. The game is directly applicable to the simpler classes of conjunctive and context-free grammars, and offers a promising new… (More)

- Panos Rondogiannis, William W. Wadge
- J. Funct. Program.
- 1999

In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates user-defined functions from the source program, by appropriately introducing context… (More)

- Panos Rondogiannis, William W. Wadge
- J. Funct. Program.
- 1997

The purpose of this paper is to demonstrate that rst-order functional programs can be transformed into intensional programs of nullary variables, in a semantics preserving way. On the foundational side, the goal of our study is to bring new insights and a better understanding of the nature of functional languages. From a practical point of view, our… (More)

- Panos Rondogiannis, Manolis Gergatsoulis, Themis Panayiotopoulos
- Comput. Lang.
- 1998

Temporal programming languages provide a powerful means for the description and implementation of dynamic systems. However, most temporal languages are based on linear time, a fact that renders them unsuitable for certain types of applications (such as expressing properties of nondeterministic programs). In this paper we introduce the new temporal logic… (More)

- Stavros D. Nikolopoulos, Panos Rondogiannis
- Inf. Process. Lett.
- 1998

In this paper we compute the number of spanning trees of a specific family of graphs using techniques from linear algebra and matrix theory. More specifically, we consider the graphs that result from a complete graph K, after removing a set of edges that spans a multi-star graph K,,, (al, ~2,. , a,). We derive closed formulas for the number of spanning… (More)