default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimiter Vakarelov
Person information
- affiliation: St. Clement of Ohrid University of Sofia, Bulgaria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j41]Dimiter Vakarelov:
Point-free Theories of Space and Time. FLAP 7(6): 1421-1320 (2020)
2010 – 2019
- 2017
- [j40]Dimiter Vakarelov:
Mereotopologies with Predicates of Actual Existence and Actual Contact. Fundam. Informaticae 156(3-4): 413-432 (2017) - [j39]Dimiter Vakarelov:
A mereotopology based on sequent algebras. J. Appl. Non Class. Logics 27(3-4): 342-364 (2017) - [c25]Dimiter Vakarelov:
Actual Existence Predicate in Mereology and Mereotopology (Extended Abstract). IJCRS (2) 2017: 138-157 - 2016
- [j38]Tatyana Ivanova
, Dimiter Vakarelov:
Distributive mereotopology: extended distributive contact lattices. Ann. Math. Artif. Intell. 77(1-2): 3-41 (2016) - 2012
- [j37]Nikolay Ivanov, Dimiter Vakarelov:
A System of Relational Syllogistic Incorporating Full Boolean Reasoning. J. Log. Lang. Inf. 21(4): 433-459 (2012) - [j36]Dimiter Vakarelov:
Dynamic Modalities. Stud Logica 100(1-2): 385-397 (2012) - [c24]Dimiter Vakarelov:
Dynamic Mereotopology II: Axiomatizing some Whiteheadean Type Space-time Logics. Advances in Modal Logic 2012: 538-558 - 2011
- [i2]Nikolay Ivanov, Dimiter Vakarelov:
Relational Syllogistics. CoRR abs/1102.4496 (2011) - 2010
- [j35]Dimiter Vakarelov:
Dynamic Mereotopology: A Point-free Theory of Changing Regions. I. Stable and unstable mereotopological relations. Fundam. Informaticae 100(1-4): 159-180 (2010) - [j34]Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA. J. Appl. Log. 8(4): 319-333 (2010) - [c23]Tinko Tinchev, Dimiter Vakarelov:
Logics of Space with Connectedness Predicates: Complete Axiomatizations. Advances in Modal Logic 2010: 434-453 - [c22]Dimiter Vakarelov:
Algorithmic Definability and Completeness in Modal Logic. FoIKS 2010: 6-8
2000 – 2009
- 2009
- [j33]Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions. Fundam. Informaticae 92(4): 307-343 (2009) - 2008
- [j32]Philippe Balbiani, Petar Iliev, Dimiter Vakarelov:
A Modal Logic for Pawlak's Approximation Spaces with Rough Cardinality n. Fundam. Informaticae 83(4): 451-464 (2008) - [j31]Ivo Düntsch, Wendy MacCaull, Dimiter Vakarelov, Michael Winter:
Distributive contact lattices: Topological representations. J. Log. Algebraic Methods Program. 76(1): 18-34 (2008) - [c21]Yavor Nenov, Dimiter Vakarelov:
Modal logics for mereotopological relations. Advances in Modal Logic 2008: 249-272 - 2007
- [j30]Ivo Düntsch, Dimiter Vakarelov:
Region-based theory of discrete spaces: A proximity approach. Ann. Math. Artif. Intell. 49(1-4): 5-14 (2007) - [j29]Philippe Balbiani, Dimiter Vakarelov:
Arrow Logic with Arbitrary Intersections: Applications to Pawlak's Information Systems. Fundam. Informaticae 75(1-4): 1-25 (2007) - [j28]Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov:
Modal Logics for Region-based Theories of Space. Fundam. Informaticae 81(1-3): 29-82 (2007) - [j27]Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelov:
Dynamic logics of the region-based theory of discrete spaces. J. Appl. Non Class. Logics 17(1): 39-61 (2007) - [p2]Philippe Balbiani, Valentin Goranko, Ruaan Kellerman, Dimiter Vakarelov:
Logical Theories for Fragments of Elementary Geometry. Handbook of Spatial Logics 2007: 343-428 - 2006
- [j26]Valentin Goranko, Dimiter Vakarelov:
Elementary canonical formulae: extending Sahlqvist's theorem. Ann. Pure Appl. Log. 141(1-2): 180-217 (2006) - [j25]Georgi D. Dimov, Dimiter Vakarelov:
Contact Algebras and Region-based Theory of Space: A Proximity Approach - I. Fundam. Informaticae 74(2-3): 209-249 (2006) - [j24]Georgi D. Dimov, Dimiter Vakarelov:
Contact Algebras and Region-based Theory of Space: Proximity Approach - II. Fundam. Informaticae 74(2-3): 251-282 (2006) - [j23]Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Log. Methods Comput. Sci. 2(1) (2006) - [j22]Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA. J. Log. Comput. 16(5): 579-612 (2006) - [j21]Dimiter Vakarelov:
Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation. Stud Logica 84(1): 105-127 (2006) - [c20]Ivo Düntsch, Wendy MacCaull, Dimiter Vakarelov, Michael Winter:
Topological Representation of Contact Lattices. RelMiCS 2006: 135-147 - [i1]Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. CoRR abs/cs/0602024 (2006) - 2005
- [j20]Dimiter Vakarelov:
Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation. Stud Logica 80(2-3): 393-430 (2005) - [c19]Georgi D. Dimov, Dimiter Vakarelov:
Topological Representation of Precontact Algebras. RelMiCS 2005: 1-16 - [c18]Wendy MacCaull, Dimiter Vakarelov:
Lattice-Based Paraconsistent Logic. RelMiCS 2005: 173-187 - [c17]Dimiter Vakarelov:
A Modal Characterization of Indiscernibility and Similarity Relations in Pawlak's Information Systems. RSFDGrC (1) 2005: 12-22 - 2004
- [j19]Philippe Balbiani, Dimiter Vakarelov:
Dynamic extensions of arrow logic. Ann. Pure Appl. Log. 127(1-3): 1-15 (2004) - [c16]Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Model?theoretic Aspects. Advances in Modal Logic 2004: 17-51 - 2003
- [j18]Philippe Balbiani, Dimiter Vakarelov:
PDL with Intersection of Programs: A Complete Axiomatization. J. Appl. Non Class. Logics 13(3-4): 231-276 (2003) - [c15]Valentin Goranko, Ullrich Hustadt, Renate A. Schmidt, Dimiter Vakarelov:
SCAN Is Complete for All Sahlqvist Formulae. RelMiCS 2003: 149-162 - 2002
- [j17]Philippe Balbiani, Dimiter Vakarelov:
A Modal Logic for Indiscernibility and Complementarity in Information Systems. Fundam. Informaticae 50(3-4): 243-263 (2002) - [j16]Dimiter Vakarelov, Georgi D. Dimov, Ivo Düntsch, Brandon Bennett:
A Proximity Approach to Some Region-Based Theories of Space. J. Appl. Non Class. Logics 12(3-4): 527-559 (2002) - [c14]Dimiter Vakarelov:
Modal Definability in Languages with a Finite Number of Propositional Variables and a New Extension of the Sahlqvist's Class. Advances in Modal Logic 2002: 499-518 - 2001
- [j15]Philippe Balbiani, Dimiter Vakarelov:
Iteration-free PDL with Intersection: a Complete Axiomatization. Fundam. Informaticae 45(3): 173-194 (2001) - [j14]Valentin Goranko, Dimiter Vakarelov:
Sahlqvist Formulas in Hybrid Polyadic Modal Logics. J. Log. Comput. 11(5): 737-754 (2001) - [c13]Philippe Balbiani, Dimiter Vakarelov:
First-Order Characterization and Modal Analysis of Indiscernibility and Complementarity in Information Systems. ECSQARU 2001: 772-781 - [c12]Dimiter Vakarelov, Ivo Düntsch, Brandon Bennett:
A note on proximity spaces and connection based mereology. FOIS 2001: 139-150 - 2000
- [c11]Valentin Goranko, Dimiter Vakarelov:
Sahlqvist Formulas Unleashed in Polyadic Modal Languages. Advances in Modal Logic 2000: 221-240
1990 – 1999
- 1999
- [j13]Dimiter Vakarelov:
Rough Polyadic modal logics. J. Appl. Non Class. Logics 1(1): 9-35 (1999) - [j12]Valentin Goranko, Dimiter Vakarelov:
Hyperboolean Algebras and Hyperboolean Modal Logic. J. Appl. Non Class. Logics 9(2-3): 345-368 (1999) - 1998
- [j11]Georgi D. Dimov, Dimiter Vakarelov:
On Scott Consequence Systems. Fundam. Informaticae 33(1): 43-70 (1998) - [c10]Philippe Balbiani, Dimiter Vakarelov:
Extending arrow logic. RelMiCS 1998: 13-17 - [c9]Valentin Goranko, Dimiter Vakarelov:
Modal Logic and Universal Algebra I: Modal Axiomatizations of Structures. Advances in Modal Logic 1998: 247-274 - 1997
- [j10]Ana Deneva, Dimiter Vakarelov:
Modal Logics for Local and Global Similarity Relations. Fundam. Informaticae 31(3/4): 295-304 (1997) - [j9]Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov:
Modal Logics for Incidence Geometries. J. Log. Comput. 7(1): 59-78 (1997) - 1996
- [j8]Dimiter Vakarelov:
Many-dimensional arrow logics. J. Appl. Non Class. Logics 6(4): 303-345 (1996) - [c8]Dimiter Vakarelov:
Hyper Arrow Structures. Arrow Logics~III. Advances in Modal Logic 1996: 269-290 - [c7]Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov:
Geometrical Structures and Modal Logic. FAPR 1996: 43-57 - 1995
- [j7]Dimiter Vakarelov:
A duality between Pawlak's knowledge representation systems and BI-consequence systems. Stud Logica 55(1): 205-228 (1995) - [c6]Dimiter Vakarelov:
A Duality Between Pawlak's Information Systems and Bi-Consequence Systems with Applications to First-Order and Modal Characterizations of some Informational Relations. WOCFAI 1995: 417-428 - 1992
- [j6]Dimiter Vakarelov:
Inductive modal logics. Fundam. Informaticae 16(3-4): 383-405 (1992) - [j5]Dimiter Vakarelov:
A Modal Logic for Cyclic Repeating. Inf. Comput. 101(1): 103-122 (1992) - [c5]Dimiter Vakarelov:
A Modal Theory of Arrows. Arrow Logics I. JELIA 1992: 1-24 - [p1]Dimiter Vakarelov:
Consequence Relations and Information Systems. Intelligent Decision Support 1992: 391-399 - 1991
- [j4]Dimiter Vakarelov:
A model logic for similarity relations in pawlak knowledge representation systems. Fundam. Informaticae 15(1): 61-79 (1991) - [j3]Dimiter Vakarelov:
Modal Logics for Knowledge Representation Systems. Theor. Comput. Sci. 90(2): 433-456 (1991)
1980 – 1989
- 1989
- [j2]Dimiter Vakarelov:
Intuitive semantics for some three-valued logics connected with information, contrariety and subcontrariety. Stud Logica 48(4): 565-575 (1989) - [c4]Dimiter Vakarelov:
Modal Logics for Knowledge Representation Systems. Logic at Botik 1989: 257-277 - 1986
- [c3]Dimiter Vakarelov:
Abstract Characterization of some Knowledge Representation Systems and the Logic NIL of Nondeterministic Information. AIMSA 1986: 255-260 - 1985
- [j1]Dimiter Vakarelov:
An application of Rieger-Nishimura formulas to the intuitionistic modal logics. Stud Logica 44(1): 79-85 (1985) - 1984
- [c2]Tinko Tinchev, Dimiter Vakarelov:
Propositional dynamic logics with counters and stacks. Symposium on Computation Theory 1984: 364-374 - 1980
- [c1]Dimiter Vakarelov:
Filtration theorem for dynamic algebras with tests and inverse operator. Logic of Programs 1980: 314-324
Coauthor Index
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-09-06 00:40 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:
