default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael I. Dekhtyar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j11]Denis Béchet
, Michael I. Dekhtyar:
Biography of Alexandre Dikovsky. J. Log. Lang. Inf. 26(4): 333-340 (2017)- 2015
- [j10]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Boris Karlov:
Categorial dependency grammars. Theor. Comput. Sci. 579: 33-63 (2015) - 2011
- [j9]Mars K. Valiev, Michael I. Dekhtyar:
Complexity of verification of nondeterministic probabilistic multiagent systems. Autom. Control. Comput. Sci. 45(7): 390-396 (2011) - 2009
- [j8]Alex Dekhtyar, Michael I. Dekhtyar:
The theory of interval probabilistic logic programs. Ann. Math. Artif. Intell. 55(3-4): 355-388 (2009) - [j7]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
- [j6]Michael I. Dekhtyar, Amelie Morin, Vehary Sakanyan:
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes. BMC Bioinform. 9 (2008) - 2006
- [j5]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) - 2003
- [j4]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) - 2001
- [j3]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) - 1999
- [j2]Michael I. Dekhtyar:
Book review: Computational geometry in C Second Edition by Joseph O'Rourke (Cambridge University Press 1988). SIGACT News 30(3): 8-13 (1999) - 1996
- [j1]Dmitry A. Archangelsky, Michael I. Dekhtyar, Mikhail A. Taitslin:
Linear Logic for Nets with Bounded Resources. Ann. Pure Appl. Log. 78(1-3): 3-28 (1996)
Conference and Workshop Papers
- 2013
- [c26]Michael I. Dekhtyar, Mars K. Valiev:
Complexity of Verification of Fuzzy Multi-Agent Systems. MICAI (1) 2013: 169-184 - 2010
- [c25]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Boris Karlov:
Iterated Dependencies and Kleene Iteration. FG 2010: 66-81 - 2008
- [c24]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Generalized Categorial Dependency Grammars. Pillars of Computer Science 2008: 230-255 - [c23]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
Temporal Verification of Probabilistic Multi-Agent Systems. Pillars of Computer Science 2008: 256-265 - 2006
- [c22]Ionut Emil Iacob, Alex Dekhtyar, Michael I. Dekhtyar:
On Potential Validity of Document-Centric XML Documents. ICDE Workshops 2006: 87 - 2005
- [c21]Alex Dekhtyar, Michael I. Dekhtyar:
Revisiting the Semantics of Interval Probabilistic Logic Programs. LPNMR 2005: 330-342 - 2004
- [c20]Alex Dekhtyar, Michael I. Dekhtyar:
Possible Worlds Semantics for Probabilistic Logic Programs. ICLP 2004: 137-148 - [c19]Ionut Emil Iacob, Alex Dekhtyar, Michael I. Dekhtyar:
Checking Potential Validity of XML Documents. WebDB 2004: 91-96 - 2002
- [c18]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
Complexity of Multi-agent Systems Behavior. JELIA 2002: 125-136 - 2000
- [c17]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov:
On Complexity of Updates through Integrity Constraints. Computational Logic 2000: 867-881 - [c16]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos:
Maximal Expansions of Database Updates. FoIKS 2000: 72-87 - 1999
- [c15]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 - [c14]Alex Dekhtyar, Michael I. Dekhtyar, V. S. Subrahmanian:
Temporal Probabilistic Logic Programs. ICLP 1999: 109-123 - [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 - [c11]Michael I. Dekhtyar, Alex Dekhtyar, V. S. Subrahmanian:
Hybrid Probabilistic Programs: Algorithms and Complexity. UAI 1999: 160-169 - 1998
- [c10]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos:
On Logically Justified Updates. IJCSLP 1998: 250-264 - 1997
- [c9]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Total Homeostaticity and Integrity Constraints Restorability Recognition. ICLP 1997: 241-255 - [c8]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability. LFCS 1997: 67-77 - [c7]Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos:
On Conservative Enforced Updates. LPNMR 1997: 244-257 - 1996
- [c6]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
On Homeostatic Behavior of Dynamic Deductive Data Bases. Ershov Memorial Conference 1996: 420-432 - 1995
- [c5]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Dynamic Deductive Data Bases With Steady Behaviour. ICLP 1995: 183-197 - 1994
- [c4]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 - [c3]Michael I. Dekhtyar, Alexander Ja. Dikovsky:
On Stable Behaviour of Dynamic Deductive Data Bases. ILPS 1994: 677 - 1979
- [c2]Michael I. Dekhtyar:
Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets. MFCS 1979: 277-283 - 1976
- [c1]Michael I. Dekhtyar:
On the Relativization of Deterministic and Nondeterministic Complexity Classes. MFCS 1976: 255-259
Informal and Other Publications
- 2013
- [i1]Michael I. Dekhtyar, Alex Dekhtyar, V. S. Subrahmanian:
Hybrid Probabilistic Programs: Algorithms and Complexity. CoRR abs/1301.6691 (2013)
Coauthor Index
aka: Alexander Ja. Dikovsky
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:06 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:
