Alexandre Ja. Dikovsky

Orcid: 0000-0003-0990-5095

Affiliations:
  • University of Nantes, France


According to our database1, Alexandre Ja. Dikovsky authored at least 40 papers between 1975 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Linguistic \(\leftrightarrow \) Rational Agents' Semantics.
J. Log. Lang. Inf., 2017

2015
Categorial dependency grammars.
Theor. Comput. Sci., 2015

2012
Categorial grammars with iterated types form a strict hierarchy of k-valued languages.
Theor. Comput. Sci., 2012

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].
Proceedings of the Joint Conference JEP-TALN-RECITAL 2012, 2012

2011
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

Structural Bootstrapping of Large Scale Categorial Dependency Grammars.
Proceedings of the Computational Dependency Theory [papers from the International Conference on Dependency Linguistics, 2011

"CDG Lab": An Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development.
Proceedings of the Computational Dependency Theory [papers from the International Conference on Dependency Linguistics, 2011

2010
Iterated Dependencies and Kleene Iteration.
Proceedings of the Formal Grammar, 2010

Two Models of Learning Iterated Dependencies.
Proceedings of the Formal Grammar, 2010

2009
Systems of agents controlled by logical programs: Complexity of verification.
Program. Comput. Softw., 2009

2008
Optional and Iterated Types for Pregroup Grammars.
Proceedings of the Language and Automata Theory and Applications, 2008

Temporal Verification of Probabilistic Multi-Agent Systems.
Proceedings of the Pillars of Computer Science, 2008

Generalized Categorial Dependency Grammars.
Proceedings of the Pillars of Computer Science, 2008

2007
A Finite-State Functional Grammar Architecture.
Proceedings of the Logic, 2007

Architecture compositionnelle pour les dépendances croisées.
Proceedings of the Actes de la 14ème conférence sur le Traitement Automatique des Langues Naturelles. Articles longs, 2007

2006
On complexity of verification of interacting agents' behavior.
Ann. Pure Appl. Log., 2006

2005
Underspecified Semantics for Dependency Grammars.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Dependency Structure Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2005

2003
On feasible cases of checking multi-agent systems behavior.
Theor. Comput. Sci., 2003

2002
Complexity of Multi-agent Systems Behavior.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

2001
Maximal state independent approximations to minimal real change.
Ann. Math. Artif. Intell., 2001

Polarized Non-projective Dependency Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2001

Grammars for Local and Long Dependencies.
Proceedings of the Association for Computational Linguistic, 2001

2000
Maximal Expansions of Database Updates.
Proceedings of the Foundations of Information and Knowledge Systems, 2000

On Complexity of Updates through Integrity Constraints.
Proceedings of the Computational Logic, 2000

1999
Monotone Expansion of Updates in Logical Databases.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Incremental Expansion of Database Updates Through Integrity Constraints.
Proceedings of the JFPLC'99, 1999

Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs.
Proceedings of the Perspectives of System Informatics, 1999

1998
On Logically Justified Updates.
Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997
On Conservative Enforced Updates.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Recognition of Deductive Data Base Stability.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Total Homeostaticity and Integrity Constraints Restorability Recognition.
Proceedings of the Logic Programming, 1997

1996
On Homeostatic Behavior of Dynamic Deductive Data Bases.
Proceedings of the Perspectives of System Informatics, 1996

1995
Dynamic Deductive Data Bases With Steady Behaviour.
Proceedings of the Logic Programming, 1995

1994
On Stable Behaviour of Dynamic Deductive Data Bases.
Proceedings of the Logic Programming, 1994

1993
On the Computational Complexity of Prolog Programs.
Theor. Comput. Sci., 1993

Abstract Complexity of Prolog Based on WAM.
Proceedings of the Programming Language Implementation and Logic Programming, 1993

1991
Prolog Semantics for Measuring Space Consumption.
Proceedings of the Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990, 1991

1977
On Three Types of Unambiguity of Context-Free Languages.
Proceedings of the Automata, 1977

1975
On Closure Properties of Context-Free Derivation Complexity Classes.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975


  Loading...