Panos Rondogiannis

Affiliations:
  • National and Kapodistrian University of Athens, Greece


According to our database1, Panos Rondogiannis authored at least 59 papers between 1994 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Categorical Approximation Fixpoint Theory.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2022
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective.
Theory Pract. Log. Program., 2022

2021
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction.
Theory Pract. Log. Program., 2021

A Many-valued Logic for Lexicographic Preference Representation.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

2020
Lexicographic Logic: a Many-valued Logic for Preference Representation.
CoRR, 2020

A Fixed Point Theorem on Lexicographic Lattice Structures.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
The Expressive Power of Higher-Order Datalog.
Theory Pract. Log. Program., 2019

2018
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs.
Theory Pract. Log. Program., 2018

Higher-order logic programming: An expressive language for representing qualitative preferences.
Sci. Comput. Program., 2018

Extensional Semantics for Higher-Order Logic Programs with Negation.
Log. Methods Comput. Sci., 2018

2017
The intricacies of three-valued extensional semantics for higher-order logic programs.
Theory Pract. Log. Program., 2017

Equivalence of two fixed-point semantics for definitional higher-order logic programs.
Theor. Comput. Sci., 2017

The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs.
CoRR, 2017

Game semantics for non-monotonic intensional logic programming.
Ann. Pure Appl. Log., 2017

Overview of an Abstract Fixed Point Theory for Non-Monotonic Functions and its Applications to Logic Programming.
Acta Cybern., 2017

2015
A fixed point theorem for non-monotonic functions.
Theor. Comput. Sci., 2015

Expressing preferences in logic programming using an infinite-valued logic.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

2014
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation.
Theory Pract. Log. Program., 2014

Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars.
Proceedings of the Logic, Language, Information, and Computation, 2014

Constructive Negation in Extensional Higher-Order Logic Programming.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Tagged Dataflow: a Formal Model for Iterative Map-Reduce.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013
Extensional Higher-Order Logic Programming.
ACM Trans. Comput. Log., 2013

The infinite-valued semantics: overview, recent results and future directions.
J. Appl. Non Class. Logics, 2013

The Generalized Intensional Transformation for Implementing Lazy Functional Languages.
Proceedings of the Practical Aspects of Declarative Languages, 2013

2012
<i>Models and Games</i> 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., 2012

On the expressive power of univariate equations over sets of natural numbers.
Inf. Comput., 2012

2011
A game-theoretic characterization of Boolean grammars.
Theor. Comput. Sci., 2011

2010
Fixed-Point Semantics for Non-Monotonic Formalisms.
Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

2009
Strong equivalence of logic programs under the infinite-valued semantics.
Inf. Process. Lett., 2009

Well-founded semantics for Boolean grammars.
Inf. Comput., 2009

2008
Efficient Intensional Implementation for Lazy Functional Languages.
Math. Comput. Sci., 2008

Locally stratified Boolean grammars.
Inf. Comput., 2008

An infinite-game semantics for well-founded negation in logic programming.
Ann. Pure Appl. Log., 2008

On the Semantic Approaches to Boolean Grammars.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

General Logic Programs as Infinite Games.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

SECASA 2008 Workshop Organization.
Proceedings of the 32nd Annual IEEE International Computer Software and Applications Conference, 2008

2007
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

2006
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs.
Fundam. Informaticae, 2006

2005
Minimum model semantics for logic programs with negation-as-failure.
ACM Trans. Comput. Log., 2005

Temporal stratification tests for linear and branching-time deductive databases.
Theor. Comput. Sci., 2005

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics.
Proceedings of the Logic Programming, 21st International Conference, 2005

An infinite-game semantics for negation in logic programming.
Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

2004
A limit characterization for the number of spanning trees of graphs.
Inf. Process. Lett., 2004

2002
An Infinite-Valued Semantics for Logic Programs with Negation.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

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

The Branching-Time Transformation Technique for Chain Datalog Programs.
J. Intell. Inf. Syst., 2001

A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs.
Proceedings of the Logic Based Program Synthesis and Transformation, 2001

2000
Temporal Disjunctive Logic Programming.
New Gener. Comput., 2000

Multidimensional XML.
Proceedings of the Distributed Communities on the Web, Third International Workshop, 2000

1999
Adding multidimensionality to procedural programming languages.
Softw. Pract. Exp., 1999

Higher-Order Functional Languages and Intensional Logic.
J. Funct. Program., 1999

1998
On the Number of Spanning Trees of Multi-Star Related Graphs.
Inf. Process. Lett., 1998

Branching-Time Logic Programming: The Language <i>Cactus</i> and its Applications.
Comput. Lang., 1998

1997
First-Order Functional Languages and Intensional Logic.
J. Funct. Program., 1997

Cactus: A Branching-Time Logic Programming Language.
Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

1994
Higher-order functional languages and intensional logic.
PhD thesis, 1994

Petri-Net-Based Deadlock Analysis of Process Algebra Programs.
Sci. Comput. Program., 1994

Higher-order dataflow and its implementation on stock hardware.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Compiling Higher-Order Functions for Tagged-Dataflow.
Proceedings of the Parallel Architectures and Compilation Techniques, 1994


  Loading...