Michael I. Dekhtyar

J. Log. Lang. Inf., 2017

2015

Categorial dependency grammars.

[BibT_eX]

[DOI]

Boris Karlov

Theor. Comput. Sci., 2015

2013

Complexity of Verification of Fuzzy Multi-Agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence and Its Applications, 2013

2011

Complexity of verification of nondeterministic probabilistic multiagent systems.

[BibT_eX]

[DOI]

Autom. Control. Comput. Sci., 2011

2010

Iterated Dependencies and Kleene Iteration.

[BibT_eX]

[DOI]

Boris Karlov

Proceedings of the Formal Grammar, 2010

2009

Systems of agents controlled by logical programs: Complexity of verification.

[BibT_eX]

[DOI]

Program. Comput. Softw., 2009

The theory of interval probabilistic logic programs.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2009

2008

Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes.

[BibT_eX]

[DOI]

Amelie Morin

Vehary Sakanyan

BMC Bioinform., 2008

Temporal Verification of Probabilistic Multi-Agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

Generalized Categorial Dependency Grammars.

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

2006

On complexity of verification of interacting agents' behavior.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2006

On Potential Validity of Document-Centric XML Documents.

[BibT_eX]

[DOI]

Ionut Emil Iacob

Proceedings of the 22nd International Conference on Data Engineering Workshops, 2006

2005

Revisiting the Semantics of Interval Probabilistic Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

2004

Checking Potential Validity of XML Documents.

[BibT_eX]

[DOI]

Ionut Emil Iacob

Proceedings of the Seventh International Workshop on the Web and Databases, 2004

Possible Worlds Semantics for Probabilistic Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 20th International Conference, 2004

2003

On feasible cases of checking multi-agent systems behavior.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Complexity of Multi-agent Systems Behavior.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

2001

Maximal state independent approximations to minimal real change.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2001

2000

Maximal Expansions of Database Updates.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2000

On Complexity of Updates through Integrity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2000

1999

Book review: Computational geometry in C Second Edition by Joseph O'Rourke (Cambridge University Press 1988).

[BibT_eX]

[DOI]

SIGACT News, 1999

Hybrid Probabilistic Programs: Algorithms and Complexity.

[BibT_eX]

[DOI]

V. S. Subrahmanian

Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

Monotone Expansion of Updates in Logical Databases.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Incremental Expansion of Database Updates Through Integrity Constraints.

[BibT_eX]

Proceedings of the JFPLC'99, 1999

Temporal Probabilistic Logic Programs.

[BibT_eX]

V. S. Subrahmanian

Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 1999

1998

On Logically Justified Updates.

[BibT_eX]

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997

On Conservative Enforced Updates.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Recognition of Deductive Data Base Stability.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Total Homeostaticity and Integrity Constraints Restorability Recognition.

[BibT_eX]

Proceedings of the Logic Programming, 1997

1996

Linear Logic for Nets with Bounded Resources.

[BibT_eX]

[DOI]

Dmitry A. Archangelsky

Mikhail A. Taitslin

Ann. Pure Appl. Log., 1996

On Homeostatic Behavior of Dynamic Deductive Data Bases.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 1996

1995

Dynamic Deductive Data Bases With Steady Behaviour.

[BibT_eX]

Proceedings of the Logic Programming, 1995

1994

On Stable Behaviour of Dynamic Deductive Data Bases.

[BibT_eX]

Proceedings of the Logic Programming, 1994

Concurrency Problem for Horn Fragment of Girard's Linear Logic.

[BibT_eX]

[DOI]

Dmitry A. Archangelsky

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1979

Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1976

On the Relativization of Deterministic and Nondeterministic Complexity Classes.

[BibT_eX]

[DOI]