 | 2008 |
|---|
| 29 |       | Denis Béchet,
Alexander Ja. Dikovsky,
Annie Foret,
Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars.
LATA 2008: 88-100 |
| 28 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Generalized Categorial Dependency Grammars.
Pillars of Computer Science 2008: 230-255 |
| 27 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Temporal Verification of Probabilistic Multi-Agent Systems.
Pillars of Computer Science 2008: 256-265 |
| 2007 |
|---|
| 26 | | Alexander Ja. Dikovsky:
A Finite-State Functional Grammar Architecture.
WoLLIC 2007: 131-146 |
| 2006 |
|---|
| 25 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
On complexity of verification of interacting agents' behavior.
Ann. Pure Appl. Logic 141(3): 336-362 (2006) |
| 2005 |
|---|
| 24 | | Denis Béchet,
Alexander Ja. Dikovsky,
Annie Foret:
Dependency Structure Grammars.
LACL 2005: 18-34 |
| 23 | | Alexander Ja. Dikovsky:
Underspecified Semantics for Dependency Grammars.
MICAI 2005: 741-751 |
| 2003 |
|---|
| 22 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
On feasible cases of checking multi-agent systems behavior.
Theor. Comput. Sci. 1(303): 63-81 (2003) |
| 2002 |
|---|
| 21 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Complexity of Multi-agent Systems Behavior.
JELIA 2002: 125-136 |
| 2001 |
|---|
| 20 | | Alexander Ja. Dikovsky:
Grammars for Local and Long Dependencies.
ACL 2001: 156-163 |
| 19 | | Alexander Ja. Dikovsky:
Polarized Non-projective Dependency Grammars.
LACL 2001: 139-157 |
| 18 |  | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov,
Nicolas Spyratos:
Maximal state independent approximations to minimal real change.
Ann. Math. Artif. Intell. 33(2-4): 157-204 (2001) |
| 2000 |
|---|
| 17 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov:
On Complexity of Updates through Integrity Constraints.
Computational Logic 2000: 867-881 |
| 16 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov,
Nicolas Spyratos:
Maximal Expansions of Database Updates.
FoIKS 2000: 72-87 |
| 1999 |
|---|
| 15 | | 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 |
| 14 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Nicolas Spyratos:
Incremental Expansion of Database Updates Through Integrity Constraints.
JFPLC 1999: 189-204 |
| 13 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov,
Nicolas Spyratos:
Monotone Expansion of Updates in Logical Databases.
LPNMR 1999: 132-146 |
| 1998 |
|---|
| 12 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Nicolas Spyratos:
On Logically Justified Updates.
IJCSLP 1998: 250-264 |
| 1997 |
|---|
| 11 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Total Homeostaticity and Integrity Constraints Restorability Recognition.
ICLP 1997: 241-255 |
| 10 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability.
LFCS 1997: 67-77 |
| 9 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Nicolas Spyratos:
On Conservative Enforced Updates.
LPNMR 1997: 244-257 |
| 1996 |
|---|
| 8 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
On Homeostatic Behavior of Dynamic Deductive Data Bases.
Ershov Memorial Conference 1996: 420-432 |
| 1995 |
|---|
| 7 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Dynamic Deductive Data Bases With Steady Behaviour.
ICLP 1995: 183-197 |
| 1994 |
|---|
| 6 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
On Stable Behaviour of Dynamic Deductive Data Bases.
SLP 1994: 677 |
| 1993 |
|---|
| 5 | | Alexander Ja. Dikovsky:
Abstract Complexity of Prolog Based on WAM.
PLILP 1993: 365-377 |
| 4 | | Alexander Ja. Dikovsky:
On the Computational Complexity of Prolog Programs.
Theor. Comput. Sci. 119(1): 63-102 (1993) |
| 1991 |
|---|
| 3 | | Alexander Ja. Dikovsky:
Prolog Semantics for Measuring Space Consumption.
RCLP 1991: 177-192 |
| 1977 |
|---|
| 2 | | Alexander Ja. Dikovsky,
Larisa S. Modina:
On Three Types of Unambiguity of Context-Free Languages.
ICALP 1977: 193-205 |
| 1975 |
|---|
| 1 | | Alexander Ja. Dikovsky:
On Closure Properties of Context-Free Derivation Complexity Classes.
MFCS 1975: 206-211 |
