Остановите войну!
for scientists:
default search action
Panos Rondogiannis
- > Home > Persons > Panos Rondogiannis
Publications
- 2022
- [j35]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) - [i13]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective. CoRR abs/2205.04882 (2022) - 2019
- [j33]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
The Expressive Power of Higher-Order Datalog. Theory Pract. Log. Program. 19(5-6): 925-940 (2019) - [i10]Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis:
The Expressive Power of Higher-Order Datalog. CoRR abs/1907.09820 (2019) - 2017
- [j28]Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game semantics for non-monotonic intensional logic programming. Ann. Pure Appl. Log. 168(2): 234-253 (2017) - 2013
- [c18]Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game Semantics for Non-monotonic Intensional Logic Programming. LPNMR 2013: 329-341 - 2011
- [j19]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A game-theoretic characterization of Boolean grammars. Theor. Comput. Sci. 412(12-14): 1169-1183 (2011) - 2009
- [j18]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-founded semantics for Boolean grammars. Inf. Comput. 207(9): 945-967 (2009) - [j17]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) - [c14]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A Game-Theoretic Characterization of Boolean Grammars. Developments in Language Theory 2009: 334-347 - 2008
- [j15]Christos Nomikos, Panos Rondogiannis:
Locally stratified Boolean grammars. Inf. Comput. 206(9-10): 1219-1233 (2008) - [i2]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
On the Semantic Approaches to Boolean Grammars. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - 2007
- [c11]Christos Nomikos, Panos Rondogiannis:
Locally Stratified Boolean Grammars. LATA 2007: 437-448 - 2006
- [c9]Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-Founded Semantics for Boolean Grammars. Developments in Language Theory 2006: 203-214 - 2005
- [j12]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) - [c7]Christos Nomikos, Panos Rondogiannis, William W. Wadge:
A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics. ICLP 2005: 414-415 - 2004
- [j10]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)
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 2023-11-14 01:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint