Skip to main content
SpringerLink
Log in

Biography of Alexandre Dikovsky

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

Alexandre Dikovsky is born in Leningrad (St. Petersburg), Russia on August 9, 1945. He died in Nantes, France in the beginning of 2014. He is well known for his significant contributions to the fields of Mathematics, Linguistics, and Informatics. In the course of his career, he published over 100 research papers, 12 book chapters, and participated in numerous national and international projects.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Bibliography

  • Dikovsky, A. Ja, & Modina, L. S. (1968). Minimization of a pd-automaton complexity measure and categorial grammars of the depth 3. Algebra and Logics, 7(3).

  • Dikovsky, A. Ja. (1968). On proper inclusion of deterministic cf-languages into all cf-languages. Algebra and Logics, 8(1).

  • Dikovsky, A. Ja. (1970a). On deterministic linear languages. Problems of Cybernetics, 23.

  • Dikovsky, A. Ja. (1970b). Languages of bounded active capacity. Soviet Mathematics Doklady, 11(3).

  • Gladkij, A. V., & Dikovsky, A. Ja. (1972). Theory of formal grammars. In Scientific surveys (Vol. 10). VINITI.

  • Dikovsky, A. Ja. (1972a). Density—A derivation complexity measure in cf-grammars. Problems of Information Transmission, 8(2).

  • Dikovsky, A. Ja. (1972b). Density of derivation trees and index of grammars. Problems of Information Transmission, 8(4).

  • Dikovsky, A. Ja. (1972c). On domination density. Soviet Mathematics Doklady, 13(3).

  • Dikovsky, A. Ja. (1974). On the general notion of complexity of derivation in a context-free grammar. Soviet Mathematics Doklady, 15(1).

  • Dikovsky, A. Ja., & Valiev, M. K. (1975). On a hierarchy of cf-languages on their acceptance time. Cybernetics, 3.

  • Dikovsky, A. Ja. (1975). On closure properties of context-free derivation complexity classes. In Lecture notes in computer science (Vol. 32).

  • Dikovsky, A. Ja., & Modina, L. S. (1977). On three types of unambiguity of context-free languages. In Proceedings of the 4th Colloquium on automata, languages and programming, lecture notes in computer science (Vol. 52). Turku.

  • Dikovsky, A. Ja. (1977). Towards a general notion of complexity of derivation and syntactic description in cf-grammars. Semiotics and Informatics, 9 (russ.).

  • Dikovsky, A. Ja. (1981a). Derivation complexity of unambiguous cf-languages. In Transactions of the Tver State University (Vol. 4). Tver State University Press (russ.).

  • Dikovsky, A. Ja. (1981b). Classification of context-free languages by their derivation complexity. Semiotics and Informatics, 17 (russ.).

  • Dikovsky, A. Ja. (1981c). A theory of complexity of monadic recursion schemes. Theoretical Informatics, 15(1).

  • Dikovsky, A. Ja. (1982a). Nets of covers and linear-time analysis of functional dependencies. In Transactions of the Tver State University (Vol. 5). Tver State University Press (russ.).

  • Dikovsky, A. Ja. (1982b). Complexity of the equivalence problem of recursive program schemes. In Proceedings of the 6 allunion conference on mathematical logic. Tbilisi (russ.).

  • Dikovsky, A. Ja. (1982c). Recursion schemes of strongly bounded density are translatable into while-program schemes. In Transactions of the Tver State University (Vol. 6). Tver State University Press (russ.).

  • Dikovsky, A. Ja., & Kanovich, M. I. (1982). Mathematical methods of analysis of programs. Tver State University Press (Russ.).

  • Dikovsky, A. Ja. (1983a). A critical overview of montague semiotics (invited talk). In Proceedings of the allunion workshop “semiotic aspects of intelligence activity”. Telavi (russ.).

  • Dikovsky, A. Ja. (1983b). Optimal algorithm of automatic synthesis of the optimal algorithms over the computational models. In Proceedings of the Allunion workshop on program transformation and optimization. Novossibirsk (russ.)

  • Dikovsky, A. Ja. (1983c). Complexity bounds of algorithms on computational models (invited talk). In Proceedings of the 3d allunion conference on application of mathematical logic. Tallin (russ.).

  • Dikovsky, A. Ja. (1984a). Linear time algorithm of automatic synthesis of loop-free programs (invited talk). In Proceedings of the allunion workshop on effective algorithms. Cecis (russ.).

  • Dikovsky, A. Ja. (1984b). Computational models for fast synthesis of recursive programs (invited talk). In Proceedings of the international conference on AI and pattern recognition. Kiev (russ.).

  • Dikovsky, A. Ja. (1984c). Deterministic computational models. Izvestija of Soviet Academy of Science Technical Cybernetics, 5.

  • Dikovsky, A. Ja. (1985a). Linear time solution of problems related to synthesis of loop-free programs. Programming and Computer Software, 3.

  • Dikovsky, A. Ja, & Kanovich, M. I. (1985). Computational models with shared subgoals. Izvestija of Soviet Academy of Science Technical Cybernetics, 5.

  • Dikovsky, A. Ja. (1985b). Relations between partial and general solutions of problems in recursive computational models. In Transactions of the Tver State University (Vol. 8). Tver State University Press (russ.).

  • Dikovsky, A. Ja. (1987). Models, methods and regimes of synthesis of program schemes. Problems of Cybernetics. “Problems of reduction of brute force choice”, 131 (russ.).

  • Dikovsky, A. Ja. (1989). Space considerations in prolog. In Lecture notes in computer science (Vol. 363).

  • Dikovsky, A. Ja. (1991a). Construction of programs—An alternative to automatic synthesis. In Proceedings of the Russian-French symposium on theoretical foundations of programs design and compiling. Grenoble.

  • Dikovsky, A. Ja. (1991b). A survey of ideas and methods in software design. Part 1: Early phases of developing large programs. In System informatics. Problems of modern programming (Vol. 1). Novossibirsk (russ.).

  • Dikovsky, A. Ja. (1991c). Prolog semantics for measuring space consumption. In Lecture notes in artificial intelligence (Vol. 592).

  • Dikovsky, A. Ja. (1993a). Abstract complexity of prolog based on WAM (invited talk). In Proceedings of the 5th international symposium on programming language implementation and logic programming (PLILP). LNCS 714. Tallin.

  • Dikovsky, A. Ja. (1993b) On computational complexity of prolog programs. Theoretical Computer Science, 119.

  • Dekhtyar, M. I., & Dikovsky, A. Ja. (1994). Dynamic deductive databases. Izvestija of Soviet Academy of Science Technical Cybernetics, 5.

  • Dekhtyar, M. I., & Dikovsky, A. Ja. (1995). Dynamic deductive data bases with steady behavior. In L. Sterling (Ed.), Proceedings of the 12th international conference on logic programming (ICLP). The MIT Press.

  • Dikovsky, A. Ja. (1996). Models, methods, and modes for the synthesis of program schemes. American Mathematical Society Translations, 178(2).

  • Dekhtyar, M. I., & Dikovsky, A. Ja. (1996a). The analysis of behavior of discrete dynamic systems by means of logic programming. Programming and Computer Software, 3 (russ.).

  • Dekhtyar, M. I., & Dikovsky, A. Ja. (1996b). On homeostatic behavior of dynamic deductive data bases. In D. Bjorner, M. Broy, & I. Pottosin (Eds.), Proceedings 2nd international A. P. Ershov Memorial Conference “Perspectives of System Informatics”, LNCS 1181.

  • Dekhtyar, M. I., & Dikovsky, A. Ja. (1997). Total homeostaticity and integrity constraints. In L. Naish (Ed.), Proceedings of the 14th international conference on logic programming (ICLP). The MIT Press.

  • Dekhtyar, M. I., & Dikovsky, A. Ja. (1996c). Recognition of deductive data base stability. In S. Adian & A. Nerode (Eds.) Proceedings of the 4th symposium on logical foundations of computer science (LFCS’97), LNCS 1234.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. K. (1997a). On stable behavior of cooperating logic programs. In N. Callaos (Ed.), Proceedings of the World multiconference on systemics, cybernetics and informatics (SCI’97/ISAS’97).

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Spyratos, N. (1997b). On conservative enforced updates. In J. Dix, U. Furbach, & A. Nerode (Eds.), Proceedings of the 4th international conference on logic programming and non-monotonic reasoning (LPNMR’97), LNCS 1265.

  • Dekhtyar, M. I., Dikovsky, A. Ja, & Spyratos, N. (1998a). Enforcement of integrity constraints by means of minimal sufficient changes. Programming and Computer Software, 24(2).

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Spyratos, N. (1998b). On logically justified updates. In J. Jaffar (Ed.), Proceedings of the 1998 joint international conference and symposium on logic programming. The MIT Press.

  • Dekhtyar, M. I., Dikovsky, A. Ja, & Spyratos, N. (1999a). Incremental expansion of database updates through integrity constraints. In F. Fages (Ed.), Actes des 8-émes Journées Francophones de Programmation Logique et Programmation par Contraintes (JFPLC’99). Hermes Science Publications.

  • Dekhtyar, M. I., Dikovsky, A. Ja., Dudakov, S., & Spyratos, N. (1999b). Monotone expansion of updates in logical databases. In M. Gelfond, N. Leone, & G. Pfeifer (Eds.), Proceedings of the 5th international conference on logic programming and non-monotonic reasoning (LPNMR’99), LNCS 1730.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. K. (2000a). Applying temporal logic to analysis of behavior of cooperating logic programs. In D. Bjorner, M. Broy, & A. V. Zamulin (Eds.), Proceedings of the 3D International A. P. Ershov Memorial Conference “Perspectives of System Informatics”, LNCS 1755.

  • Dekhtyar, M. I., Dikovsky, A. Ja., Dudakov, S., & Spyratos, N. (2000b). Maximal expansions of database updates. In K. D. Schewe & B. Thalheim (Eds.), Proceedings of the first international symposium on foundations of information and knowledge systems (FoIKS 2000), LNCS 1762.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Dudakov, S. (2000c). On complexity of updates through integrity constraints. In Proceedings of the first international conference on computational logic (CL 2000), LNCS 1861.

  • Dikovskij, A. Ja, & Modina, L. S. (2000). Dependencies on the other side of the curtain. Traitement Automatique des Langues (TAL), 41(1).

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. (2001a). On behavior complexity of interacting intelligent agents. In Proceedings of the conference Dedicated to the 90th Anniversary of A. A. Lyapunov. Novossibirsk (russ.).

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. (2001b). On complexity of behavior properties of interacting agents (extended abstract). In Proceedings of the international workshop on logic and complexity in computer science (LCCS’2001), Crteil.

  • Dekhtyar, M. I., Dikovsky, A. Ja, Dudakov, S., & Spyratos, N. (2001c). Maximal state independent approximations to minimal real change. Annals of Mathematics and Artificial Intelligence, 33(2–4).

  • Dikovsky, A. (2001a). Polarized non-projective dependency grammars. In Ph. de Groote, G. Morill, & Ch. Retoré (Eds.), Proceedings of the fourth international conference on logical aspects of computational linguistics, LNCS 2099.

  • Dikovsky, A. (2001b). Grammars for local and long dependencies. In Proceedings of the international conference ACL’2001. Toulouse.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. (2002a). Complexity of multi-agent systems behavior. In G. Ianni & S. Flesca (Eds.), Proceedings of the 8th European conference on logic in artificial intelligence (JELIA’2002), Cozenca, LNCS 2424.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. (2002b). Checking multi-agent systems behavior properties. In V. Kurelchik (Ed.), Proceedings of the IEEE international conference on artificial intelligence systems (ICAIS2002). Divnomorskoe.

  • Dekhtyar, M. I., Dikovsky, A. Ja, & Valiev, M. (2003). On feasible cases of checking multi-agent systems behavior. Theoretical Computer Science, 303(1).

  • Dikovsky, A. (2003a). Linguistic meaning from the language acquisition perspective. In Proceedings of the 8th international conference “formal grammar 2003” (FG 2003). Vienna.

  • Dikovsky, A. (2003b). Discourse plan \(\rightarrow \) meaning. In Proceedings of the 1st international conference “meaning-text theory” (MTT 2003). Paris: ENS de Paris.

  • Dikovsky, A. (2004). Dependencies as categories. In Recent advances in dependency grammars. COLING’04 Workshop.

  • Dekhtyar, M., & Dikovsky, A. (2004). Categorial dependency grammars. In Proceedings of international conference on categorial grammars. Montpellier.

  • Béchet, D., Dikovsky, A., Foret, A., & Moreau, E. (2004). On learning discontinuous dependencies from positive data. In Proceedings of the 9th international conference “formal grammar 2004” (FG 2004). Nancy.

  • Béchet, D., Dikovsky, A., & Foret, A. (2005). Dependency structure grammars. In Proceedings of the 5th international conference “logical aspects of computational linguistics” (LACL’2005), LNCS 3492.

  • Dikovsky, A., & Smilga, B. (2005). Semantic roles and diatheses for functional discourse plans. In Proceedings of the 2nd international conference “meaning-text theory” (MTT 2005).

  • Dikovsky, A. (2005). Underspecified semantics for dependency grammars. In A. Gelbukh, A. de Albornoz, & H. Terashima (Eds.), Proceedings of the 4th Mexican international conference on artificial intelligence (MICAI 2005), LNAI 3789.

  • Dekhtyar, M. I., Dikovsky, A. Ja, & Valiev, M. (2006). On complexity of verification of interacting agents’ behavior. Annals of Pure and Applied Logics, 141(1).

  • Dikovsky, A., & Retoré, C. (2006). From syntactic structures to logical semantics. notes of advanced course. In Proceedings of the 18th European Summer school in logic, language and information (ESSLLI 2006). Malaga.

  • Dikovsky, A. (2007a). Architecture compositionnelle pour les dpendances croises. In Proceedings of the TALN 2007. Toulouse

  • Dikovsky, A. (2007b). A finite-state functional grammar architecture. In D. Leivant & R. de Queiroz (Eds.), “Logic, language, information and computation”. Proceedings of the 14th international workshop WoLLIC 2007. Rio de Janeiro, Brazil, LNCS 4576.

  • Dikovsky, A. (2007c). Multimodal categorial dependency grammars. In Proceedings of the 12th conference on formal grammar. Dublin.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. (2008). Temporal verification of probabilistic multi-agent systems. In A. Aviron et al. (Eds.), Pillars of computer science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, LNCS 4800.

  • Dekhtyar, M., & Dikovsky, A. (2008). Generalized categorial dependency grammars. In Trakhtenbrot/Festschrift, LNCS 4800. Springer.

  • Béchet, D., Dikovsky, A., Foret, A., & Garel, E. (2008). Optional and iterated types for pregroup grammars. In Proceedings of LATA 2008: 2nd international conference on language and automata theory and applications, LNCS 5196.

  • Dekhtyar, M. I., Dikovsky, A. Ja., & Valiev, M. (2009). Systems of agents controlled by logical programs: Verification complexity. Programmirovanie, 5 (russ.).

  • Dikovsky, A. (2009a). On speaker’s stance meaning of discourse. In Proceedings of the 4th international conference “meaning-text theory” (MTT 2009). Montreal.

  • Dikovsky, A. (2009b). Towards wide coverage categorial dependency grammars. In Proceedings of the ESSLLI’2009 workshop on parsing with categorial grammars. Book of Abstracts. Bordeaux.

  • Dikovsky, A. (2010). On constructive semantics of natural language. In S. Feferman & W. Sieg (Eds.), Proofs, categories and computations: Essays in honor of Grigori Mints. London: College Publications. With the collaboration of Vladik Kreinovich, Vladimir Lifschitz, and Ruy de Queiroz.

  • Béchet, D., Dikovsky, A., & A. Foret (2011a). Sur les itérations dispersées et les choix itérés pour l’apprentissage incrémental des types dans les grammaires de dépendances. In Actes de la Conférence francophone sur l’apprentissage automatique (CAp 2011). Chambéry.

  • Béchet, D., Dikovsky, A., & Foret, A. (2011b). Categorial grammars with iterated types form a strict hierarchy of k-valued languages. In Proceedings of the 16th international conference “implementation and application of automata” (CIAA 2011), LNCS 6807.

  • Béchet, D., Dikovsky, A., & Foret, A. (2011c). On dispersed and choice iteration in incrementally learnable dependency types. In Proceedings of the 6th international conference “logical aspects of computational linguistics” (LACL’2011), LNAI 6736.

  • Dikovsky, A. (2011). Categorial dependency grammars: From theory to large scale grammars. In K. Gerdes, E. Hajicova, & L. Wanner (Eds.), Proceedings of the 1st international conference on dependency linguistics (Depling 2011). Barcelona.

  • Alfared, R., Béchet, D., & Dikovsky, A. (2011). Cdg lab: A toolbox for dependency grammars and dependency treebanks development. In K. Gerdes, E. Hajicova, & L. Wanner (Eds.), Proceedings of the 1st international conference on dependency linguistics (Depling 2011). Barcelona.

  • Béchet, D., Dikovsky, A., & Foret, A. (2012a). Two models of learning iterated dependencies. In Proceedings of the 15th conference on formal grammar (FG 2010), LNCS 7395. Copenhagen.

  • Dekhtyar, M., Dikovsky, A., & Karlov, B. (2012). Iterated dependencies and Kleene iteration. In Proceedings of the 15th conference on formal grammar (FG 2010), LNCS 7395. Copenhagen.

  • Alfared, R., Béchet, D., & Dikovsky, A. (2012). Calcul des cadres de sous-catgorisation des noms déverbaux franais (le cas du génitif). In Proceedings of the “TALN” 2012, Grenoble, 2012.

  • Béchet, D., Dikovsky, A., & Foret, A. (2012b). Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theoretical Computer Science, 450(7).

  • Dikovsky, A. (2012). What should be a proper semantics for dependency structures. In Meanings, texts and other exciting things. A Festschrift to Commemorate the 80th Anniversary of Professor Igor Alexandrovich Mel’chuk. Languages of Slavic Culture, Moscow 2012.

  • Dikovsky, A. (2013). Structural bootstrapping of large scale categorial dependency grammars. In Computational dependency theory. IOS Press.

  • Dekhtyar, M., Dikovsky, A., & Karlov, B. (2015). Categorial dependency grammars. Theoretical Computer Science, 579(7).

Download references

Author information

Authors and Affiliations

  1. LS2N UMR6004, University of Nantes, 2 Chemin de la Houssinière, 44300, Nantes, France

    Denis Béchet

  2. Department of Computer Sciences, Tver State University, Tver, Russia, 170000

    Michael Dekhtyar

Authors
  1. Denis Béchet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Dekhtyar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Denis Béchet.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Béchet, D., Dekhtyar, M. Biography of Alexandre Dikovsky. J of Log Lang and Inf 26, 333–340 (2017). https://doi.org/10.1007/s10849-017-9257-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-017-9257-z

Keywords

Search

Navigation