Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Christos Nomikos"'
Autor:
Costas D. Koutras, Konstantinos Liaskos, Christos Moyzes, Christos Nomikos, Christos Rantsoudis
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 90:397-424
Publikováno v:
Logic Journal of the IGPL. 31:68-95
Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of
Publikováno v:
Information Systems. 115:102194
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 paper, we propose a family of algorithms for querying large amount of
Autor:
Costas D. Koutras, Christos Nomikos
Publikováno v:
Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing.
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initial semantics of LPODs, although simple and quite intuitive, is not pur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dafc500879661a45680d72ea3fde3d9
Publikováno v:
Theory and Practice of Logic Programming. 19:925-940
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 this result to the case of higher-order Datalog. In particular, we de
Publikováno v:
Annals of Pure and Applied Logic. 168:234-253
Intensional logic programming is an extension of logic programming based on intensional logic, which includes as special cases both temporal and modal logic programming. In [13] , M. Orgun and W.W. Wadge provided a general framework for capturing the
Publikováno v:
International E-Conference on Computer Science 2005
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89939889cfdb8bed5de7134957dbc2eb
https://doi.org/10.1201/9780429076893-22
https://doi.org/10.1201/9780429076893-22
Autor:
Martin Fürer, Panagiotis Cheilaris, Christos Nomikos, Euripides Markou, Nikolaos Papaspyrou, Eleni Bakali, Dimitris Fotakis, Katerina Potika, Costas D. Koutras, Christos H. Papadimitriou, Aris Pagourtzis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
This year we are celebrating the 70th birthday of Stathis! We take this chance to recall some of his remarkable contributions to Computer Science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1afd97f73302facf4c5e8084a468de72
https://doi.org/10.1007/978-3-319-57586-5_39
https://doi.org/10.1007/978-3-319-57586-5_39