Demo Data from EDBT 2026 / reviewers in the wild / expert
Tinko Tinchev
dblp:97/6191 · also Tinko Velichkov Tinchev
· DBLP profile ↗
15ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0002-0545-0364ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 13 · 1 first-authorArtificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › modal logic
dynamic logic |
0.0 | 1 | 1991 | An Essay in Combinatory Dynamic Logic · Inf. Comput. 1991 |
Methods — techniques the papers use, named apart from their topics
modal logic · 0.0combinatory logic · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Bulgarian Massive Multitask Language Understanding Benchmark
Svetla Koeva, Ivelina Stoyanova, Dimiter Georgiev, Svetlozara Leseva, Valentina Stefanova, Maria Todorova, Tsvetana Dimitrova, Hristina Kukova, Mihaela Moskova, Tinko Tinchev |
LREC | 10 |
| 2018 | Modal correspondence theory in the class of all Euclidean framesabstractThe core of this article is the modal correspondence theory in the class of all Euclidean frames. It shows that with respect to the class of all Euclidean frames, every modal formula is first-order definable and the problem of deciding the modal definability of sentences is undecidable. Philippe Balbiani, Dimiter Georgiev, Tinko Tinchev |
J. Log. Comput. | 3 |
| 2017 | Undecidable problems for modal definabilityabstractThe core of our article is the computability of the problem of deciding the modal definability of first-order sentences with respect to classes of frames. It gives a new proof of Chagrova's Theorem telling that, with respect to the class of all frames, the problem of deciding the modal definability of first-order sentences is undecidable. It also gives the proofs of new variants of Chagrova's Theorem. Philippe Balbiani, Tinko Tinchev |
J. Log. Comput. | 2 |
| 2016 | Unification in modal logic Alt1
Philippe Balbiani, Tinko Tinchev |
Advances in Modal Logic | 2 |
| 2014 | Definability and Computability for PRSPDL
Philippe Balbiani, Tinko Tinchev |
Advances in Modal Logic | 2 |
| 2014 | Flexible Noisy Text CorrectionabstractWe present a new general and language independent approach to the noisy text correction problem developed and implemented in the framework of the CULTURA project. We briefly describe the core candidate generator, REBELS, the complete system concept, its efficient implementation based on functional automata and its immediate applications. The quality of the whole system is empirically established in different experimental settings where language and noise sources are varied. Andrey Sariev, Vladislav Nenchev, Stefan Gerdjikov, Petar Mitankin, Hristo Ganchev, Stoyan Mihov, Tinko Tinchev |
Document Analysis Systems | 7 |
| 2014 | Definability and Canonicity for Boolean Logic with a Binary RelationabstractThis paper studies the concepts of definability and canonicity in Boolean logic with a binary relation. Firstly, it provides formulas defining first-order or second-order conditions on frames. Secondly, it proves that all formulas corresponding to compatible first-order conditions on frames are canonical. Philippe Balbiani, Tinko Tinchev |
Fundam. Informaticae | 2 |
| 2010 | Logics of Space with Connectedness Predicates: Complete Axiomatizations
Tinko Tinchev, Dimiter Vakarelov |
Advances in Modal Logic | 1 |
| 2007 | Modal Logics for Region-based Theories of Space
Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov |
Fundam. Informaticae | 2 |
| 2006 | Definability Over the Class of all PartitionsabstractInternational audience Philippe Balbiani, Tinko Tinchev |
J. Log. Comput. | 2 |
| 2004 | Line-Based Affine Reasoning in Euclidean Plane
Philippe Balbiani, Tinko Tinchev |
JELIA | 2 |
| 1997 | Modal Logics for Incidence GeometriesabstractIncidence geometry is based on two-sorted structures consisting of ‘points’ and ‘lines’ together with an intersort binary relation called incidence. We introduce an equivalent one-sorted geometrical structure, called incidence frame, which is suitable for modal considerations. Incidence frames constitute the semantical basis of MIG, the modal logic of incidence geometry. A completeness theorem for MIG is proved: a modal formula is a theorem of MIG if and only if it is valid in all incidence frames. Extensions to projective and affine geometries are also considered. Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov |
J. Log. Comput. | 3 |
| 1991 | An Essay in Combinatory Dynamic Logic
Solomon Passay, Tinko Tinchev |
Inf. Comput. | 2 |
| 1985 | Quantifiers in combinatory PDL: completeness, definability, incompleteness
Solomon Passy, Tinko Tinchev |
FCT | 2 |
| 1985 | PDL with Data Constants
Solomon Passy, Tinko Tinchev |
Inf. Process. Lett. | 2 |