Anahit A. Chubaryan
Biography
Education
Yerevan State University, Department of mechanic and mathematic: 1964 - 1969,
PhD - education: 1969 - 1972

Academic degree
Candidate thesis “On proof complexity characteristics in some logical calculus”, 1978, NC, SA of USSR, Moscow
Doctoral thesis “Investigation of proof complexity characteristics in logical
and logic-mathematical systems”, 2007, IPIA of NAS RA, Yerevan

Professional experience
YSU, chair of “Mathematical cybernetic” lecture: 1972-1976
senior lecture: 1976 - 1982
associate professor: 1982 - 2009
chair of “Theory of systems” holder of the chair: 1986 - 1991
chair of “Discrete mathematic and informatic” full professor: 2009 - at present

Academic courses
Theory of algorithm, mathematical logic, discrete mathematic,
Common complexity theory, proof complexity

Scale of professional interests
Mathematical logic, proof theory, proof complexity

Participation in grant projects
Grant of SCS of RA (code 11-1b023)

Languages
Armenian, Russian, English, Germany

Professional membership
Member of 1) specialized council 044 “Mathematical cybernetic and mathematical logic” of SCC of RA by YSU 2) Armenian mathematical society 3) of Association of Symbolic Logic

achubaryan@ysu.am

Anahit A. Chubaryan

Professor | Faculty of Informatics and Applied Mathematics - Chair of Discrete Mathematics and Theoretical Informatics
 
 

Book

Ա. Ա. Չուբարյան, Հ. Գ. Մովսեսյան, Ս. Մ. Սայադյան

Հաշվարկելիության բարդության տեսության հիմնադրույթները | Ուս. ձեռնարկ: ԵՊՀ հրատ.: 2017թ․, 62 էջ

Anahit Chubaryan, Artur Khamisyan, Garik Petrosyan

On some systems for two versions of many-valued logics | LAP (Lambert Academic Publishing). 2017, 73 p.

A. A. Chubaryan

Rabin style speed-up of proofs | Monograph, LAP (Lambert Academic Publishing), Germany, 2010

, Anahit A. Chubaryan

Proof Complexity of Hard-determinable Formula in R(lin) | ASL ESM, LC-2009, Abstracts, Sofia, 27

A. A. Chubaryan, H. R. Bolibekyan, H. Movsisyan

Ալգորիթմների տեսության խնդիրների ժողովածու | Ուսումնական ձեոնարկ, ԵՊՀ հրատարակչություն, Երևան-2008 և http:users.freenet.am/~bolibek
1   2  |  See all
 

Article

Anahit Chubaryan, Artur Khamisyan, Garik Petrosyan

Investigation of the Proof Complexity Measures of Strongly Equal K-Tautologies in Some Proof Systems | Transactions on Machine Learning and Artificial Intelligence, 2019, Volume 7, No 1, pp. 56-63 |

Чубарян А. А., Саядян С. М., Зограбян Г. М.

О свойствах монотонности и строгой монотонности пропозициональных систем резолюций классической и неклассических логик | Sciences of Europe, 2019, 35, 2, pp. 74-77

Anahit Chubaryan, Artur Khamisyan

Relations between the Proof Complexity Characteristics in Two Universal Proof Systems for All Variants of Many-Valued Logics | East African Scholars Journal of Engineering and Computer Sciences, 2019, 2(2), pp. 69-74 |

Chubaryan A. A., Tamazyan H. A., Tshitoyan A. S.

Some improvement of lower bounds for steps and sizes of proofs in Frege systems | Sciences of Europe, 2019, Vol 1, # 37, pp. 39-44 |

Г. М. Зограбян, С. М. Саядян, А. А. Чубарян

Исследование свойства монотонности некоторых пропозициональных систем выводов классической и неклассических логик | ՀՀ ԳԱԱ զեկույցներ, 2019, 119, 1, էջ 33-39 |
1   2   3   4   5   6   7   8   13  |  See all
 

Thesis

Anahit Chubaryan, Hakob Nalbandyan, Arman Karabakhtsyan , Garik Petrosyan

Propositional sequent systems of two valued classical logic and many valued logics are no monotonous17-08-14.html | ASL, ESM, Logic Colloquium – 2017. p. 98 |

Anahit Chubaryan, Garik Petrosyan

The proof complexities relations for strongly equal classical tautologies in Frege systems | ASL, ESM, Logic Colloquium – 2016, p. 69-70 |

Anahit Chubaryan, Artur Khamisyan, Arman Tshitoyan

Some new proof systems for a version of many-valued logics and proof complexities in it | ASL, ESM, Logic Colloquium – 2016, p. 70 |

Anahit A. Chubaryan,

Resolution systems with restricted substitution rule | CiE-2012, Cambridge, Abstracts,25

Anahit A. Chubaryan

On the hierarchies of some propositional systems for classical and non-classical logics | Mathematical Problems of Computer Science, 38, Yerevan, 2012, pp. 95-96
1   2   3   4   5   6   7   8   9  |  See all