default search action
Panos Rondogiannis
Person information
- affiliation: National and Kapodistrian University of Athens, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i14]Bart Bogaerts, Angelos Charalambidis, Giannos Chatziagapis, Babis Kostopoulos, Samuele Pollaci, Panos Rondogiannis:
The Stable Model Semantics for Higher-Order Logic Programming. CoRR abs/2408.10563 (2024) - 2023
- [c29]Angelos Charalambidis
, Panos Rondogiannis:
Categorical Approximation Fixpoint Theory. JELIA 2023: 515-530 - 2022
- [j35]Angelos Charalambidis
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective. Theory Pract. Log. Program. 22(5): 708-722 (2022) - [i13]Angelos Charalambidis
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective. CoRR abs/2205.04882 (2022) - 2021
- [j34]Angelos Charalambidis
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction. Theory Pract. Log. Program. 21(5): 629-645 (2021) - [c28]Angelos Charalambidis, George Papadimitriou, Panos Rondogiannis, Antonis Troumpoukis:
A Many-valued Logic for Lexicographic Preference Representation. KR 2021: 646-650 - [i12]Angelos Charalambidis, Panos Rondogiannis, Antonis Troumpoukis:
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction. CoRR abs/2108.03369 (2021) - 2020
- [c27]Angelos Charalambidis
A Fixed Point Theorem on Lexicographic Lattice Structures. LICS 2020: 301-311 - [i11]Angelos Charalambidis, Giorgos Papadimitriou, Panos Rondogiannis, Antonis Troumpoukis:
Lexicographic Logic: a Many-valued Logic for Preference Representation. CoRR abs/2012.10940 (2020)
2010 – 2019
- 2019
- [j33]Angelos Charalambidis
The Expressive Power of Higher-Order Datalog. Theory Pract. Log. Program. 19(5-6): 925-940 (2019) - [i10]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
The Expressive Power of Higher-Order Datalog. CoRR abs/1907.09820 (2019) - 2018
- [j32]Panos Rondogiannis, Ioanna Symeonidou:
Extensional Semantics for Higher-Order Logic Programs with Negation. Log. Methods Comput. Sci. 14(2) (2018) - [j31]Angelos Charalambidis
Higher-order logic programming: An expressive language for representing qualitative preferences. Sci. Comput. Program. 155: 173-197 (2018) - [j30]Angelos Charalambidis
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs. Theory Pract. Log. Program. 18(3-4): 421-437 (2018) - [c26]Panos Rondogiannis, Ioanna Symeonidou:
The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs. IJCAI 2018: 5344-5348 - [i9]Angelos Charalambidis, Panos Rondogiannis, Ioanna Symeonidou:
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs. CoRR abs/1804.08335 (2018) - 2017
- [j29]Angelos Charalambidis
Overview of an Abstract Fixed Point Theory for Non-Monotonic Functions and its Applications to Logic Programming. Acta Cybern. 23(1): 319-326 (2017) - [j28]Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game semantics for non-monotonic intensional logic programming. Ann. Pure Appl. Log. 168(2): 234-253 (2017) - [j27]Angelos Charalambidis
Equivalence of two fixed-point semantics for definitional higher-order logic programs. Theor. Comput. Sci. 668: 27-42 (2017) - [j26]Panos Rondogiannis, Ioanna Symeonidou:
The intricacies of three-valued extensional semantics for higher-order logic programs. Theory Pract. Log. Program. 17(5-6): 974-991 (2017) - [i8]Panos Rondogiannis, Ioanna Symeonidou:
Extensional Semantics for Higher-Order Logic Programs with Negation. CoRR abs/1701.08622 (2017) - [i7]Panos Rondogiannis, Ioanna Symeonidou:
The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs. CoRR abs/1707.04704 (2017) - 2016
- [c25]Panos Rondogiannis, Ioanna Symeonidou:
Extensional Semantics for Higher-Order Logic Programs with Negation. JELIA 2016: 447-462 - [c24]Angelos Charalambidis
Higher-order logic programming: an expressive language for representing qualitative preferences. PPDP 2016: 24-37 - 2015
- [j25]Zoltán Ésik, Panos Rondogiannis:
A fixed point theorem for non-monotonic functions. Theor. Comput. Sci. 574: 18-38 (2015) - [c23]Panos Rondogiannis, Antonis Troumpoukis
Expressing preferences in logic programming using an infinite-valued logic. PPDP 2015: 208-219 - [c22]Angelos Charalambidis
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs. FICS 2015: 18-32 - 2014
- [j24]Angelos Charalambidis
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. Theory Pract. Log. Program. 14(4-5): 725-737 (2014) - [c21]Angelos Charalambidis, Nikolaos Papaspyrou, Panos Rondogiannis:
Tagged Dataflow: a Formal Model for Iterative Map-Reduce. EDBT/ICDT Workshops 2014: 29-36 - [c20]Angelos Charalambidis, Panos Rondogiannis:
Constructive Negation in Extensional Higher-Order Logic Programming. KR 2014 - [c19]Zoltán Ésik, Panos Rondogiannis:
Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars. WoLLIC 2014: 166-180 - [i6]Zoltán Ésik, Panos Rondogiannis:
A Fixed Point Theorem for Non-Monotonic Functions. CoRR abs/1402.0299 (2014) - [i5]Angelos Charalambidis, Zoltán Ésik, Panos Rondogiannis:
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation. CoRR abs/1405.3792 (2014) - 2013
- [j23]Panos Rondogiannis, Antonis Troumpoukis
The infinite-valued semantics: overview, recent results and future directions. J. Appl. Non Class. Logics 23(1-2): 213-228 (2013) - [j22]Angelos Charalambidis
Extensional Higher-Order Logic Programming. ACM Trans. Comput. Log. 14(3): 21:1-21:40 (2013) - [c18]Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game Semantics for Non-monotonic Intensional Logic Programming. LPNMR 2013: 329-341 - [c17]Georgios Fourtounis, Nikolaos Papaspyrou
The Generalized Intensional Transformation for Implementing Lazy Functional Languages. PADL 2013: 157-172 - 2012
- [j21]Alexander Okhotin
On the expressive power of univariate equations over sets of natural numbers. Inf. Comput. 212: 1-14 (2012) - [j20]Panos Rondogiannis:
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. Theory Pract. Log. Program. 12(3): 413-416 (2012) - 2011
- [j19]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A game-theoretic characterization of Boolean grammars. Theor. Comput. Sci. 412(12-14): 1169-1183 (2011) - [i4]Angelos Charalambidis, Konstantinos Handjopoulos, Panos Rondogiannis, William W. Wadge:
Extensional Higher-Order Logic Programming. CoRR abs/1106.3457 (2011) - 2010
- [c16]Panos Rondogiannis:
Fixed-Point Semantics for Non-Monotonic Formalisms. FICS 2010: 17 - [c15]Angelos Charalambidis
Extensional Higher-Order Logic Programming. JELIA 2010: 91-103
2000 – 2009
- 2009
- [j18]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-founded semantics for Boolean grammars. Inf. Comput. 207(9): 945-967 (2009) - [j17]Christos Nomikos, Panos Rondogiannis, William W. Wadge:
Strong equivalence of logic programs under the infinite-valued semantics. Inf. Process. Lett. 109(11): 576-581 (2009) - [c14]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A Game-Theoretic Characterization of Boolean Grammars. Developments in Language Theory 2009: 334-347 - 2008
- [j16]Chrysida Galanaki, Panos Rondogiannis, William W. Wadge:
An infinite-game semantics for well-founded negation in logic programming. Ann. Pure Appl. Log. 151(2-3): 70-88 (2008) - [j15]Christos Nomikos, Panos Rondogiannis:
Locally stratified Boolean grammars. Inf. Comput. 206(9-10): 1219-1233 (2008) - [j14]Angelos Charalambidis
Efficient Intensional Implementation for Lazy Functional Languages. Math. Comput. Sci. 2(1): 123-141 (2008) - [c13]Weichang Du, John Plaice, Panagiotis Rondogiannis:
SECASA 2008 Workshop Organization. COMPSAC 2008: 1253 - [c12]Alexander Okhotin
On the expressive power of univariate equations over sets of natural numbers. IFIP TCS 2008: 215-227 - [i3]Chrysida Galanaki, Panos Rondogiannis, William W. Wadge:
General Logic Programs as Infinite Games. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - [i2]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
On the Semantic Approaches to Boolean Grammars. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - 2007
- [c11]Christos Nomikos, Panos Rondogiannis:
Locally Stratified Boolean Grammars. LATA 2007: 437-448 - [c10]Pedro Cabalar, David Pearce, Panos Rondogiannis, William W. Wadge:
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation. LPNMR 2007: 44-57 - 2006
- [j13]Petros Potikas
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs. Fundam. Informaticae 72(4): 485-527 (2006) - [c9]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-Founded Semantics for Boolean Grammars. Developments in Language Theory 2006: 203-214 - 2005
- [j12]Christos Nomikos, Panos Rondogiannis, Manolis Gergatsoulis:
Temporal stratification tests for linear and branching-time deductive databases. Theor. Comput. Sci. 342(2-3): 382-415 (2005) - [j11]Panos Rondogiannis, William W. Wadge:
Minimum model semantics for logic programs with negation-as-failure. ACM Trans. Comput. Log. 6(2): 441-467 (2005) - [c8]Panos Rondogiannis, William W. Wadge:
An infinite-game semantics for negation in logic programming. GALOP@ETAPS 2005: 77-91 - [c7]Christos Nomikos, Panos Rondogiannis, William W. Wadge:
A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics. ICLP 2005: 414-415 - 2004
- [j10]Stavros D. Nikolopoulos, Christos Nomikos, Panos Rondogiannis:
A limit characterization for the number of spanning trees of graphs. Inf. Process. Lett. 90(6): 307-313 (2004) - 2003
- [i1]Panos Rondogiannis, William W. Wadge:
Minimum Model Semantics for Logic Programs with Negation-as-Failure. CoRR cs.LO/0306017 (2003) - 2002
- [c6]Panos Rondogiannis, William W. Wadge:
An Infinite-Valued Semantics for Logic Programs with Negation. JELIA 2002: 456-467 - 2001
- [j9]Panos Rondogiannis, Manolis Gergatsoulis:
The Branching-Time Transformation Technique for Chain Datalog Programs. J. Intell. Inf. Syst. 17(1): 71-94 (2001) - [j8]Panos Rondogiannis:
Stratified negation in temporal logic programming and the cycle-sum test. Theor. Comput. Sci. 254(1-2): 663-676 (2001) - [c5]Petros Potikas
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs. LOPSTR 2001: 25-45 - 2000
- [j7]Manolis Gergatsoulis, Panos Rondogiannis, Themis Panayiotopoulos:
Temporal Disjunctive Logic Programming. New Gener. Comput. 19(1): 87-100 (2000) - [c4]Yannis Stavrakas, Manolis Gergatsoulis, Panos Rondogiannis:
Multidimensional XML. DCW 2000: 100-109
1990 – 1999
- 1999
- [j6]Panos Rondogiannis, William W. Wadge:
Higher-Order Functional Languages and Intensional Logic. J. Funct. Program. 9(5): 527-564 (1999) - [j5]Panos Rondogiannis:
Adding multidimensionality to procedural programming languages. Softw. Pract. Exp. 29(13): 1201-1221 (1999) - 1998
- [j4]Panos Rondogiannis, Manolis Gergatsoulis, Themis Panayiotopoulos:
Branching-Time Logic Programming: The Language Cactus and its Applications. Comput. Lang. 24(3): 155-178 (1998) - [j3]Stavros D. Nikolopoulos, Panos Rondogiannis:
On the Number of Spanning Trees of Multi-Star Related Graphs. Inf. Process. Lett. 65(4): 183-188 (1998) - 1997
- [j2]Panos Rondogiannis, William W. Wadge:
First-Order Functional Languages and Intensional Logic. J. Funct. Program. 7(1): 73-101 (1997) - [c3]Panos Rondogiannis, Manolis Gergatsoulis, Themis Panayiotopoulos:
Cactus: A Branching-Time Logic Programming Language. ECSQARU-FAPR 1997: 511-524 - 1994
- [b1]Panos Rondogiannis:
Higher-order functional languages and intensional logic. University of Victoria, Canada, 1994 - [j1]Panos Rondogiannis, Mantis H. M. Cheng:
Petri-Net-Based Deadlock Analysis of Process Algebra Programs. Sci. Comput. Program. 23(1): 55-89 (1994) - [c2]Panos Rondogiannis, William W. Wadge:
Compiling Higher-Order Functions for Tagged-Dataflow. IFIP PACT 1994: 269-278 - [c1]Panos Rondogiannis, William W. Wadge:
Higher-order dataflow and its implementation on stock hardware. SAC 1994: 431-435
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: