| 2008 |
| 28 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Generalized Categorial Dependency Grammars.
Pillars of Computer Science 2008: 230-255 |
| 27 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Temporal Verification of Probabilistic Multi-Agent Systems.
Pillars of Computer Science 2008: 256-265 |
| 2006 |
| 26 | EE | Ionut Emil Iacob,
Alex Dekhtyar,
Michael I. Dekhtyar:
On Potential Validity of Document-Centric XML Documents.
ICDE Workshops 2006: 87 |
| 25 | EE | 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 | EE | Alex Dekhtyar,
Michael I. Dekhtyar:
Revisiting the Semantics of Interval Probabilistic Logic Programs.
LPNMR 2005: 330-342 |
| 2004 |
| 23 | EE | Alex Dekhtyar,
Michael I. Dekhtyar:
Possible Worlds Semantics for Probabilistic Logic Programs.
ICLP 2004: 137-148 |
| 22 | EE | Ionut Emil Iacob,
Alex Dekhtyar,
Michael I. Dekhtyar:
Checking Potential Validity of XML Documents.
WebDB 2004: 91-96 |
| 2003 |
| 21 | EE | 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 |
| 20 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Mars K. Valiev:
Complexity of Multi-agent Systems Behavior.
JELIA 2002: 125-136 |
| 2001 |
| 19 | | 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 |
| 18 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov:
On Complexity of Updates through Integrity Constraints.
Computational Logic 2000: 867-881 |
| 17 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov,
Nicolas Spyratos:
Maximal Expansions of Database Updates.
FoIKS 2000: 72-87 |
| 1999 |
| 16 | EE | 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 |
| 15 | | Alex Dekhtyar,
Michael I. Dekhtyar,
V. S. Subrahmanian:
Temporal Probabilistic Logic Programs.
ICLP 1999: 109-123 |
| 14 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Nicolas Spyratos:
Incremental Expansion of Database Updates Through Integrity Constraints.
JFPLC 1999: 189-204 |
| 13 | EE | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Sergey Dudakov,
Nicolas Spyratos:
Monotone Expansion of Updates in Logical Databases.
LPNMR 1999: 132-146 |
| 12 | EE | Michael I. Dekhtyar,
Alex Dekhtyar,
V. S. Subrahmanian:
Hybrid Probabilistic Programs: Algorithms and Complexity.
UAI 1999: 160-169 |
| 1998 |
| 11 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Nicolas Spyratos:
On Logically Justified Updates.
IJCSLP 1998: 250-264 |
| 1997 |
| 10 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Total Homeostaticity and Integrity Constraints Restorability Recognition.
ICLP 1997: 241-255 |
| 9 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability.
LFCS 1997: 67-77 |
| 8 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky,
Nicolas Spyratos:
On Conservative Enforced Updates.
LPNMR 1997: 244-257 |
| 1996 |
| 7 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
On Homeostatic Behavior of Dynamic Deductive Data Bases.
Ershov Memorial Conference 1996: 420-432 |
| 6 | | Dmitry A. Archangelsky,
Michael I. Dekhtyar,
Mikhail A. Taitslin:
Linear Logic for Nets with Bounded Resources.
Ann. Pure Appl. Logic 78(1-3): 3-28 (1996) |
| 1995 |
| 5 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
Dynamic Deductive Data Bases With Steady Behaviour.
ICLP 1995: 183-197 |
| 1994 |
| 4 | | Dmitry A. Archangelsky,
Michael I. Dekhtyar,
Evgeny Kruglov,
Ilmir Kh. Musikaev,
Mikhail A. Taitslin:
Concurrency Problem for Horn Fragment of Girard's Linear Logic.
LFCS 1994: 18-22 |
| 3 | | Michael I. Dekhtyar,
Alexander Ja. Dikovsky:
On Stable Behaviour of Dynamic Deductive Data Bases.
SLP 1994: 677 |
| 1979 |
| 2 | | Michael I. Dekhtyar:
Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets.
MFCS 1979: 277-283 |
| 1976 |
| 1 | | Michael I. Dekhtyar:
On the Relativization of Deterministic and Nondeterministic Complexity Classes.
MFCS 1976: 255-259 |