default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos Nomikos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Costas D. Koutras, Christos Moyzes
, Christos Nomikos, Konstantinos Tsaprounis, Yorgos Zikos:
On weak filters and ultrafilters: Set theory from (and for) knowledge representation. Log. J. IGPL 31(1): 68-95 (2023)- [j18]Eleftherios Kalogeros, Manolis Gergatsoulis, Matthew Damigos, Christos Nomikos:
Efficient query evaluation techniques over large amount of distributed linked data. Inf. Syst. 115: 102194 (2023) - 2022
- [j17]Costas D. Koutras, Konstantinos Liaskos, Christos Moyzes, Christos Nomikos, Christos Rantsoudis:
Default consequence relations from topology and measure theory. Ann. Math. Artif. Intell. 90(4): 397-424 (2022) - [j16]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective. Theory Pract. Log. Program. 22(5): 708-722 (2022) - [c14]Costas D. Koutras, Christos Nomikos:
Topological semantics for default conditional logic: preliminary report. SAC 2022: 897-902 - [i4]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective. CoRR abs/2205.04882 (2022) - [i3]Eleftherios Kalogeros, Manolis Gergatsoulis, Matthew Damigos, Christos Nomikos:
Efficient query evaluation techniques over large amount of distributed linked data. CoRR abs/2209.05359 (2022)
2010 – 2019
- 2019
- [j15]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
The Expressive Power of Higher-Order Datalog. Theory Pract. Log. Program. 19(5-6): 925-940 (2019) - [i2]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
The Expressive Power of Higher-Order Datalog. CoRR abs/1907.09820 (2019) - 2017
- [j14]Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game semantics for non-monotonic intensional logic programming. Ann. Pure Appl. Log. 168(2): 234-253 (2017) - [c13]Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
Stathis Zachos at 70! CIAC 2017: 469-484 - 2014
- [c12]Christos Nomikos, Manolis Gergatsoulis, Eleftherios Kalogeros, Matthew Damigos:
A Map-Reduce algorithm for querying linked data based on query decomposition into stars. EDBT/ICDT Workshops 2014: 224-231 - [c11]Costas D. Koutras, Christos Moyzes, Christos Nomikos, Yorgos Zikos:
On the 'in many cases' Modality: Tableaux, Decidability, Complexity, Variants. SETN 2014: 207-220 - 2013
- [c10]Manolis Gergatsoulis, Christos Nomikos, Eleftherios Kalogeros, Matthew Damigos:
An Algorithm for Querying Linked Data Using Map-Reduce. Globe 2013: 51-62 - [c9]Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game Semantics for Non-monotonic Intensional Logic Programming. LPNMR 2013: 329-341 - 2012
- [j13]Pantelis E. Eleftheriou, Costas D. Koutras, Christos Nomikos:
Notions of Bisimulation for Heyting-Valued Modal Languages. J. Log. Comput. 22(2): 213-235 (2012) - 2011
- [j12]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A game-theoretic characterization of Boolean grammars. Theor. Comput. Sci. 412(12-14): 1169-1183 (2011)
2000 – 2009
- 2009
- [j11]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-founded semantics for Boolean grammars. Inf. Comput. 207(9): 945-967 (2009) - [j10]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) - [c8]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A Game-Theoretic Characterization of Boolean Grammars. Developments in Language Theory 2009: 334-347 - 2008
- [j9]Christos Nomikos, Panos Rondogiannis:
Locally stratified Boolean grammars. Inf. Comput. 206(9-10): 1219-1233 (2008) - [j8]Costas D. Koutras, Christos Nomikos, Pavlos Peppas:
On a Simple 3-valued Modal Language and a 3-valued Logic of 'not-fully-justified' Belief. Log. J. IGPL 16(6): 591-604 (2008) - [i1]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
On the Semantic Approaches to Boolean Grammars. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - 2007
- [c7]Christos Nomikos, Panos Rondogiannis:
Locally Stratified Boolean Grammars. LATA 2007: 437-448 - [c6]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Randomized and Approximation Algorithms for Blue-Red Matching. MFCS 2007: 715-725 - 2006
- [j7]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Networks 50(1): 1-14 (2006) - [c5]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-Founded Semantics for Boolean Grammars. Developments in Language Theory 2006: 203-214 - 2005
- [j6]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) - [c4]Christos Nomikos, Panos Rondogiannis, William W. Wadge:
A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics. ICLP 2005: 414-415 - [c3]Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. Panhellenic Conference on Informatics 2005: 57-67 - 2004
- [j5]Manolis Gergatsoulis, Christos Nomikos:
A Proof Procedure For Temporal Logic Programming. Int. J. Found. Comput. Sci. 15(2): 417-443 (2004) - [j4]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) - [c2]Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. NETWORKING 2004: 150-161 - 2003
- [j3]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Satisfying a maximum number of pre-routed requests in all-optical rings. Comput. Networks 42(1): 55-63 (2003) - [c1]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Minimizing Request Blocking in All-Optical Rings. INFOCOM 2003: 1355-1361 - 2002
- [j2]Costas D. Koutras, Christos Nomikos, Pavlos Peppas:
Canonicity and Completeness Results for Many-Valued Modal Logics. J. Appl. Non Class. Logics 12(1): 7-42 (2002) - 2001
- [j1]Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Routing and path multicoloring. Inf. Process. Lett. 80(5): 249-256 (2001)
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 22:14 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:
