2 citations · 2 across the 2 of their papers we have counts for
5 papers
Lexicographic Logic: a Many-valued Logic for Preference Representation
Angelos Charalambidis, Giorgos Papadimitriou, Panos Rondogiannis +1
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical prop…
The Expressive Power of Higher-Order Datalog
Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis
A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend…
Predicate Specialization for Definitional Higher-order Logic Programs
Antonis Troumpoukis, Angelos Charalambidis
Higher-order logic programming is an interesting extension of traditional logic programming that allows predicates to appear as arguments and variables to be used where predicates…
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
Angelos Charalambidis, Panos Rondogiannis, Ioanna Symeonidou
We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as…
Extensional Higher-Order Logic Programming
A. Charalambidis, K. Handjopoulos, P. Rondogiannis +1
We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff t…