Compiling Higher-Order Functions for Tagged-Dataflow. - Panos Rondogiannis; William W. Wadge (IFIP PACT, 1994)

Higher-order dataflow and its implementation on stock hardware. - Panos Rondogiannis; William W. Wadge (SAC, 1994)

Petri-Net-Based Deadlock Analysis of Process Algebra Programs. - Panos Rondogiannis; Mantis H. M. Cheng (Sci. Comput. Program., 1994)

Higher-order functional languages and intensional logic. - Panos Rondogiannis (1994)

Cactus: A Branching-Time Logic Programming Language. - Panos Rondogiannis; Manolis Gergatsoulis; Themis Panayiotopoulos (ECSQARU-FAPR, 1997)

First-Order Functional Languages and Intensional Logic. - Panos Rondogiannis; William W. Wadge (J. Funct. Program., 1997)

Branching-Time Logic Programming: The Language Cactus and its Applications. - Panos Rondogiannis; Manolis Gergatsoulis; Themis Panayiotopoulos (Comput. Lang., 1998)

On the Number of Spanning Trees of Multi-Star Related Graphs. - Stavros D. Nikolopoulos; Panos Rondogiannis (Inf. Process. Lett., 1998)

Higher-Order Functional Languages and Intensional Logic. - Panos Rondogiannis; William W. Wadge (J. Funct. Program., 1999)

Adding multidimensionality to procedural programming languages. - Panos Rondogiannis (Softw. Pract. Exp., 1999)

Multidimensional XML. - Yannis Stavrakas; Manolis Gergatsoulis; Panos Rondogiannis (DCW, 2000)

Temporal Disjunctive Logic Programming. - Manolis Gergatsoulis; Panos Rondogiannis; Themis Panayiotopoulos (New Gener. Comput., 2000)

A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs. - Petros Potikas; Panos Rondogiannis; Manolis Gergatsoulis (LOPSTR, 2001)

The Branching-Time Transformation Technique for Chain Datalog Programs. - Panos Rondogiannis; Manolis Gergatsoulis (J. Intell. Inf. Syst., 2001)

Stratified negation in temporal logic programming and the cycle-sum test. - Panos Rondogiannis (Theor. Comput. Sci., 2001)

An Infinite-Valued Semantics for Logic Programs with Negation. - Panos Rondogiannis; William W. Wadge (JELIA, 2002)

A limit characterization for the number of spanning trees of graphs. - Stavros D. Nikolopoulos; Christos Nomikos; Panos Rondogiannis (Inf. Process. Lett., 2004)

An infinite-game semantics for negation in logic programming. - Panos Rondogiannis; William W. Wadge (GALOP@ETAPS, 2005)

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics. - Christos Nomikos; Panos Rondogiannis; William W. Wadge (ICLP, 2005)

Temporal stratification tests for linear and branching-time deductive databases. - Christos Nomikos; Panos Rondogiannis; Manolis Gergatsoulis (Theor. Comput. Sci., 2005)

Minimum model semantics for logic programs with negation-as-failure. - Panos Rondogiannis; William W. Wadge (ACM Trans. Comput. Log., 2005)

A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs. - Petros Potikas; Panos Rondogiannis; Manolis Gergatsoulis (Fundam. Informaticae, 2006)

A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation. - Pedro Cabalar; David Pearce 001; Panos Rondogiannis; William W. Wadge (LPNMR, 2007)

SECASA 2008 Workshop Organization. - Weichang Du; John Plaice; Panagiotis Rondogiannis (COMPSAC, 2008)

General Logic Programs as Infinite Games. - Chrysida Galanaki; Panos Rondogiannis; William W. Wadge (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

On the Semantic Approaches to Boolean Grammars. - Vassilis Kountouriotis; Christos Nomikos; Panos Rondogiannis (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

An infinite-game semantics for well-founded negation in logic programming. - Chrysida Galanaki; Panos Rondogiannis; William W. Wadge (Ann. Pure Appl. Log., 2008)

Locally stratified Boolean grammars. - Christos Nomikos; Panos Rondogiannis (Inf. Comput., 2008)

Efficient Intensional Implementation for Lazy Functional Languages. - Angelos Charalambidis; Athanasios Grivas; Nikolaos S. Papaspyrou; Panos Rondogiannis (Math. Comput. Sci., 2008)

Well-founded semantics for Boolean grammars. - Vassilis Kountouriotis; Christos Nomikos; Panos Rondogiannis (Inf. Comput., 2009)

Strong equivalence of logic programs under the infinite-valued semantics. - Christos Nomikos; Panos Rondogiannis; William W. Wadge (Inf. Process. Lett., 2009)

Fixed-Point Semantics for Non-Monotonic Formalisms. - Panos Rondogiannis (FICS, 2010)

A game-theoretic characterization of Boolean grammars. - Vassilis Kountouriotis; Christos Nomikos; Panos Rondogiannis (Theor. Comput. Sci., 2011)

On the expressive power of univariate equations over sets of natural numbers. - Alexander Okhotin; Panos Rondogiannis (Inf. Comput., 2012)

Models and Games by Jouko Väänänen, Cambridge University Press, Cambridge Studies in Advanced Mathematics Series 132, 2011. Hardcover, ISBN 978-0-521-51812-3, 367 pp. - Panos Rondogiannis (Theory Pract. Log. Program., 2012)

The Generalized Intensional Transformation for Implementing Lazy Functional Languages. - Georgios Fourtounis 001; Nikolaos Papaspyrou; Panos Rondogiannis (PADL, 2013)

The infinite-valued semantics: overview, recent results and future directions. - Panos Rondogiannis; Antonis Troumpoukis (J. Appl. Non Class. Logics, 2013)

Extensional Higher-Order Logic Programming. - Angelos Charalambidis; Konstantinos Handjopoulos; Panagiotis Rondogiannis; William W. Wadge (ACM Trans. Comput. Log., 2013)

Tagged Dataflow: a Formal Model for Iterative Map-Reduce. - Angelos Charalambidis; Nikolaos Papaspyrou; Panos Rondogiannis (EDBT/ICDT Workshops, 2014)

Constructive Negation in Extensional Higher-Order Logic Programming. - Angelos Charalambidis; Panos Rondogiannis (KR, 2014)

Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars. - Zoltán Ésik; Panos Rondogiannis (WoLLIC, 2014)

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. - Angelos Charalambidis; Zoltán Ésik; Panos Rondogiannis (Theory Pract. Log. Program., 2014)

Expressing preferences in logic programming using an infinite-valued logic. - Panos Rondogiannis; Antonis Troumpoukis (PPDP, 2015)

A fixed point theorem for non-monotonic functions. - Zoltán Ésik; Panos Rondogiannis (Theor. Comput. Sci., 2015)

Overview of an Abstract Fixed Point Theory for Non-Monotonic Functions and its Applications to Logic Programming. - Angelos Charalambidis; Panos Rondogiannis (Acta Cybern., 2017)

Game semantics for non-monotonic intensional logic programming. - Chrysida Galanaki; Christos Nomikos; Panos Rondogiannis (Ann. Pure Appl. Log., 2017)

The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs. - Panos Rondogiannis; Ioanna Symeonidou (CoRR, 2017)

Equivalence of two fixed-point semantics for definitional higher-order logic programs. - Angelos Charalambidis; Panos Rondogiannis; Ioanna Symeonidou (Theor. Comput. Sci., 2017)

The intricacies of three-valued extensional semantics for higher-order logic programs. - Panos Rondogiannis; Ioanna Symeonidou (Theory Pract. Log. Program., 2017)

Extensional Semantics for Higher-Order Logic Programs with Negation. - Panos Rondogiannis; Ioanna Symeonidou (Log. Methods Comput. Sci., 2018)

Higher-order logic programming: An expressive language for representing qualitative preferences. - Angelos Charalambidis; Panos Rondogiannis; Antonis Troumpoukis (Sci. Comput. Program., 2018)

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs. - Angelos Charalambidis; Panos Rondogiannis; Ioanna Symeonidou (Theory Pract. Log. Program., 2018)

The Expressive Power of Higher-Order Datalog. - Angelos Charalambidis; Christos Nomikos; Panos Rondogiannis (Theory Pract. Log. Program., 2019)

A Fixed Point Theorem on Lexicographic Lattice Structures. - Angelos Charalambidis; Giannos Chatziagapis; Panos Rondogiannis (LICS, 2020)

Lexicographic Logic: a Many-valued Logic for Preference Representation. - Angelos Charalambidis; Giorgos Papadimitriou; Panos Rondogiannis; Antonis Troumpoukis (CoRR, 2020)

A Many-valued Logic for Lexicographic Preference Representation. - Angelos Charalambidis; George Papadimitriou 005; Panos Rondogiannis; Antonis Troumpoukis (KR, 2021)

A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction. - Angelos Charalambidis; Panos Rondogiannis; Antonis Troumpoukis (Theory Pract. Log. Program., 2021)

Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective. - Angelos Charalambidis; Christos Nomikos; Panos Rondogiannis (Theory Pract. Log. Program., 2022)

Categorical Approximation Fixpoint Theory. - Angelos Charalambidis; Panos Rondogiannis (JELIA, 2023)

Non-monotone Fixpoint Theory Based on the Structure of Weak Bilattices. - Angelos Charalambidis; Giannos Chatziagapis; Babis Kostopoulos; Panos Rondogiannis (KR, 2024)

Recursive Function Definitions in Static Dataflow Graphs and their Implementation in TensorFlow. - Kelly Kostopoulou; Angelos Charalambidis; Panos Rondogiannis (CoRR, 2024)

The Stable Model Semantics for Higher-Order Logic Programming. - Bart Bogaerts 001; Angelos Charalambidis; Giannos Chatziagapis; Babis Kostopoulos; Samuele Pollaci; Panos Rondogiannis (Theory Pract. Log. Program., 2024)

The Power of Negation in Higher-Order Datalog. - Angelos Charalambidis; Babis Kostopoulos; Christos Nomikos; Panos Rondogiannis (CoRR, 2025)