Christos Nomikos

According to our database1, Christos Nomikos authored at least 30 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Efficient query evaluation techniques over large amount of distributed linked data.
Inf. Syst., May, 2023

On weak filters and ultrafilters: Set theory from (and for) knowledge representation.
Log. J. IGPL, January, 2023

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

Default consequence relations from topology and measure theory.
Ann. Math. Artif. Intell., 2022

Topological semantics for default conditional logic: preliminary report.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

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

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


2014
On the '<i>in many cases</i>' Modality: Tableaux, Decidability, Complexity, Variants.
Proceedings of the Artificial Intelligence: Methods and Applications, 2014

A Map-Reduce algorithm for querying linked data based on query decomposition into stars.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013
An Algorithm for Querying Linked Data Using Map-Reduce.
Proceedings of the Data Management in Cloud, Grid and P2P Systems, 2013

2012
Notions of Bisimulation for Heyting-Valued Modal Languages.
J. Log. Comput., 2012

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

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
On a Simple 3-valued Modal Language and a 3-valued Logic of '<i>not-fully-justified</i>' Belief.
Log. J. IGPL, 2008

Locally stratified Boolean grammars.
Inf. Comput., 2008

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

2007
Randomized and Approximation Algorithms for Blue-Red Matching.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.
Comput. Networks, 2006

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

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.
Proceedings of the Advances in Informatics, 2005

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

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

A Proof Procedure For Temporal Logic Programming.
Int. J. Found. Comput. Sci., 2004

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.
Proceedings of the NETWORKING 2004, 2004

2003
Satisfying a maximum number of pre-routed requests in all-optical rings.
Comput. Networks, 2003

Minimizing Request Blocking in All-Optical Rings.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002
Canonicity and Completeness Results for Many-Valued Modal Logics.
J. Appl. Non Class. Logics, 2002

2001
Routing and path multicoloring.
Inf. Process. Lett., 2001


  Loading...