Panos Rondogiannis

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Recursive Function Definitions in Static Dataflow Graphs and their Implementation in TensorFlow 2024 Kelly Kostopoulou
Angelos Charalambidis
Panos Rondogiannis
+ PDF Chat The Stable Model Semantics for Higher-Order Logic Programming 2024 Bart Bogaerts
Angelos Charalambidis
Giannos Chatziagapis
Babis Kostopoulos
Samuele Pollaci
Panos Rondogiannis
+ PDF Chat The Stable Model Semantics for Higher-Order Logic Programming 2024 Bart Bogaerts
Angelos Charalambidis
Giannos Chatziagapis
Babis Kostopoulos
Samuele Pollaci
Panos Rondogiannis
+ PDF Chat Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective 2022 Angelos Charalambidis
Christos Nomikos
Panos Rondogiannis
+ Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective 2022 Angelos Charalambidis
Christos Nomikos
Panos Rondogiannis
+ PDF Chat A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction 2021 Angelos Charalambidis
Panos Rondogiannis
Antonis Troumpoukis
+ A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction. 2021 Angelos Charalambidis
Panos Rondogiannis
Antonis Troumpoukis
+ Lexicographic Logic: a Many-valued Logic for Preference Representation. 2020 Angelos Charalambidis
Giorgos Papadimitriou
Panos Rondogiannis
Antonis Troumpoukis
+ Lexicographic Logic: a Many-valued Logic for Preference Representation 2020 Angelos Charalambidis
Giorgos Papadimitriou
Panos Rondogiannis
Antonis Troumpoukis
+ PDF Chat The Expressive Power of Higher-Order Datalog 2019 Angelos Charalambidis
Christos Nomikos
Panos Rondogiannis
+ PDF Chat Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs 2018 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
+ PDF Chat Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs 2018 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
+ The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs 2017 Panos Rondogiannis
Ioanna Symeonidou
+ Equivalence of two fixed-point semantics for definitional higher-order logic programs 2017 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
+ Extensional Semantics for Higher-Order Logic Programs with Negation 2017 Panos Rondogiannis
Ioanna Symeonidou
+ The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs 2017 Panos Rondogiannis
Ioanna Symeonidou
+ PDF Chat Extensional Semantics for Higher-Order Logic Programs with Negation 2016 Panos Rondogiannis
Ioanna Symeonidou
+ PDF Chat Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs 2015 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
+ PDF Chat A fixed point theorem for non-monotonic functions 2015 Zoltán Ésik
Panos Rondogiannis
+ PDF Chat Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation 2014 Angelos Charalambidis
Zoltán Ésik
Panos Rondogiannis
+ A Fixed Point Theorem for Non-Monotonic Functions 2014 Zoltán Ésik
Panos Rondogiannis
+ A Fixed Point Theorem for Non-Monotonic Functions 2014 Zoltán Ésik
Panos Rondogiannis
+ Extensional Higher-Order Logic Programming 2011 Angelos Charalambidis
Konstantinos Handjopoulos
Panos Rondogiannis
William W. Wadge
+ PDF Chat Extensional Higher-Order Logic Programming 2010 Angelos Charalambidis
Konstantinos Handjopoulos
Panos Rondogiannis
William W. Wadge
+ PDF Chat Minimum model semantics for logic programs with negation-as-failure 2005 Panos Rondogiannis
William W. Wadge
+ A limit characterization for the number of spanning trees of graphs 2004 Stavros D. Nikolopoulos
Christos Nomikos
Panos Rondogiannis
+ Minimum Model Semantics for Logic Programs with Negation-as-Failure 2003 Panos Rondogiannis
William W. Wadge
+ Minimum Model Semantics for Logic Programs with Negation-as-Failure 2003 Panos Rondogiannis
William W. Wadge
+ On the number of spanning trees of multi-star related graphs 1998 Stavros D. Nikolopoulos
Panos Rondogiannis
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Extensional Higher-Order Logic Programming 2013 Angelos Charalambidis
Konstantinos Handjopoulos
Panagiotis Rondogiannis
William W. Wadge
10
+ PDF Chat Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation 2014 Angelos Charalambidis
Zoltán Ésik
Panos Rondogiannis
7
+ PDF Chat Minimum model semantics for logic programs with negation-as-failure 2005 Panos Rondogiannis
William W. Wadge
6
+ PDF Chat A fixed point theorem for non-monotonic functions 2015 Zoltán Ésik
Panos Rondogiannis
3
+ An analysis of the equational properties of the well-founded fixed point 2016 Arnaud Carayol
Zoltán Ésik
3
+ Where Mathematics Comes From 2000 George Lakoff
Rafael Núñez
2
+ PDF Chat Stable Models and an Alternative Logic Programming Paradigm 1999 Victor W. Marek
Mirosław Truszczyński
2
+ Equivalence of two fixed-point semantics for definitional higher-order logic programs 2017 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
2
+ PDF Chat Revisiting Explicit Negation in Answer Set Programming 2019 Felicidad Aguado
Pedro Cabalar
Jorge Fandinno
David Pearce
Gilberto Pérez
Concepción Vidal
2
+ PDF Chat Extensional Semantics for Higher-Order Logic Programs with Negation 2016 Panos Rondogiannis
Ioanna Symeonidou
2
+ PDF Chat A formula for the number of spanning trees of a multi-star related graph 1998 Wen-Ming Yan
Wendy Myrvold
Kuo‐Liang Chung
1
+ PDF Chat Extensional Higher-Order Logic Programming 2010 Angelos Charalambidis
Konstantinos Handjopoulos
Panos Rondogiannis
William W. Wadge
1
+ PDF Chat Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs 2018 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
1
+ PDF Chat Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs 2018 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
1
+ A Fixed Point Theorem for Non-Monotonic Functions 2014 Zoltán Ésik
Panos Rondogiannis
1
+ Choice Logics and Their Computational Properties 2021 Michael Bernreiter
Jan Maly
Stefan Woltran
1
+ PDF Chat A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction 2021 Angelos Charalambidis
Panos Rondogiannis
Antonis Troumpoukis
1
+ Constructible falsity 1949 David Nelson
1
+ A Fixed Point Theorem for Non-Monotonic Functions 2014 Zoltán Ésik
Panos Rondogiannis
1
+ J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp. 1988 J. Roger Hindley
Jonathan P. Seldin
1
+ The Lazy Evaluation of Infinitesimal Logic Expressions. 2005 Ruchi Agarwal
William W. Wadge
1
+ PDF Chat On the number of spanning trees of a multi-complete/star related graph 2000 Kuo‐Liang Chung
Wen-Ming Yan
1
+ PDF Chat The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs 2004 Stavros D. Nikolopoulos
Charis Papadopoulos
1
+ On the number of spanning trees of multi-star related graphs 1998 Stavros D. Nikolopoulos
Panos Rondogiannis
1
+ On unreliability polynomials and graph connectivity in reliable network synthesis 1986 F Boesch
1
+ Maximizing spanning trees in almost complete graphs 1997 Bryan Gilbert
Wendy Myrvold
1
+ PDF Chat Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs 2015 Angelos Charalambidis
Panos Rondogiannis
Ioanna Symeonidou
1
+ PDF Chat Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction 2013 Hariolf Betz
Thom Frühwirth
1