default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Ja. Dikovsky
Person information
- affiliation: University of Nantes, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j8]Alexander Ja. Dikovsky
:
Linguistic \(\leftrightarrow \) Rational Agents' Semantics. J. Log. Lang. Inf. 26(4): 341-437 (2017)- 2015
- [j7]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Boris Karlov:
Categorial dependency grammars. Theor. Comput. Sci. 579: 33-63 (2015) - 2012
- [j6]Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret:
Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theor. Comput. Sci. 450: 22-30 (2012) - [c33]Ramadan Alfared, Denis Béchet, Alexandre Ja. Dikovsky:
Calcul des cadres de sous catégorisation des noms déverbaux français (le cas du génitif) (On Computing Subcategorization Frames of French Deverbal Nouns (Case of Genitive)) [in French]. JEP-TALN-RECITAL 2012: 71-84 - [e1]Denis Béchet, Alexander Ja. Dikovsky:
Logical Aspects of Computational Linguistics - 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012. Proceedings. Lecture Notes in Computer Science 7351, Springer 2012, ISBN 978-3-642-31261-8 [contents] - 2011
- [c32]Alexander Ja. Dikovsky:
Structural Bootstrapping of Large Scale Categorial Dependency Grammars. DepLing 2011: 136-152 - [c31]Denis Béchet, Alexander Ja. Dikovsky, Ophélie Lacroix:
"CDG Lab": An Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development. DepLing 2011: 153-169 - [c30]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95 - [c29]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. CIAA 2011: 42-52 - 2010
- [c28]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Two Models of Learning Iterated Dependencies. FG 2010: 17-32 - [c27]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Boris Karlov:
Iterated Dependencies and Kleene Iteration. FG 2010: 66-81
2000 – 2009
- 2009
- [j5]Mars K. Valiev, Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Systems of agents controlled by logical programs: Complexity of verification. Program. Comput. Softw. 35(5): 266-281 (2009) - 2008
- [c26]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Generalized Categorial Dependency Grammars. Pillars of Computer Science 2008: 230-255 - [c25]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
Temporal Verification of Probabilistic Multi-Agent Systems. Pillars of Computer Science 2008: 256-265 - [c24]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100 - 2007
- [c23]Alexandre Ja. Dikovsky:
Architecture compositionnelle pour les dépendances croisées. TALN (Articles longs) 2007: 155-164 - [c22]Alexander Ja. Dikovsky:
A Finite-State Functional Grammar Architecture. WoLLIC 2007: 131-146 - 2006
- [j4]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
On complexity of verification of interacting agents' behavior. Ann. Pure Appl. Log. 141(3): 336-362 (2006) - 2005
- [c21]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Dependency Structure Grammars. LACL 2005: 18-34 - [c20]Alexander Ja. Dikovsky:
Underspecified Semantics for Dependency Grammars. MICAI 2005: 741-751 - 2003
- [j3]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
On feasible cases of checking multi-agent systems behavior. Theor. Comput. Sci. 303(1): 63-81 (2003) - 2002
- [c19]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
Complexity of Multi-agent Systems Behavior. JELIA 2002: 125-136 - 2001
- [j2]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos:
Maximal state independent approximations to minimal real change. Ann. Math. Artif. Intell. 33(2-4): 157-204 (2001) - [c18]Alexander Ja. Dikovsky:
Grammars for Local and Long Dependencies. ACL 2001: 156-163 - [c17]Alexander Ja. Dikovsky:
Polarized Non-projective Dependency Grammars. LACL 2001: 139-157 - 2000
- [c16]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov:
On Complexity of Updates through Integrity Constraints. Computational Logic 2000: 867-881 - [c15]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos:
Maximal Expansions of Database Updates. FoIKS 2000: 72-87
1990 – 1999
- 1999
- [c14]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs. Ershov Memorial Conference 1999: 228-234 - [c13]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos:
Incremental Expansion of Database Updates Through Integrity Constraints. JFPLC 1999: 189-204 - [c12]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos:
Monotone Expansion of Updates in Logical Databases. LPNMR 1999: 132-146 - 1998
- [c11]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos:
On Logically Justified Updates. IJCSLP 1998: 250-264 - 1997
- [c10]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Total Homeostaticity and Integrity Constraints Restorability Recognition. ICLP 1997: 241-255 - [c9]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability. LFCS 1997: 67-77 - [c8]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos:
On Conservative Enforced Updates. LPNMR 1997: 244-257 - 1996
- [c7]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
On Homeostatic Behavior of Dynamic Deductive Data Bases. Ershov Memorial Conference 1996: 420-432 - 1995
- [c6]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Dynamic Deductive Data Bases With Steady Behaviour. ICLP 1995: 183-197 - 1994
- [c5]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
On Stable Behaviour of Dynamic Deductive Data Bases. ILPS 1994: 677 - 1993
- [j1]Alexander Ja. Dikovsky:
On the Computational Complexity of Prolog Programs. Theor. Comput. Sci. 119(1): 63-102 (1993) - [c4]Alexander Ja. Dikovsky:
Abstract Complexity of Prolog Based on WAM. PLILP 1993: 365-377 - 1991
- [c3]Alexander Ja. Dikovsky:
Prolog Semantics for Measuring Space Consumption. RCLP 1991: 177-192
1970 – 1979
- 1977
- [c2]Alexander Ja. Dikovsky, Larisa S. Modina:
On Three Types of Unambiguity of Context-Free Languages. ICALP 1977: 193-205 - 1975
- [c1]Alexander Ja. Dikovsky:
On Closure Properties of Context-Free Derivation Complexity Classes. MFCS 1975: 206-211
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-04-24 23:18 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:
