4 citations · 6 across the 4 of their papers we have counts for
4 papers
The Power of Negation in Higher-Order Datalog
Angelos Charalambidis, Babis Kostopoulos, Christos Nomikos +1
We investigate the expressive power of Higher-Order Datalog under both the well-founded and the stable model semantics, establishing tight connections with complexity classe…
Efficient query evaluation techniques over large amount of distributed linked data
Eleftherios Kalogeros, Manolis Gergatsoulis, Matthew Damigos +1
As RDF becomes more widely established and the amount of linked data is rapidly increasing, the efficient querying of large amount of data becomes a significant challenge. In this…
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initi…
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…