The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dimiter Vakarelov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Valentin Goranko, Ullrich Hustadt, Renate A. Schmidt, Dimiter Vakarelov
    SCAN Is Complete for All Sahlqvist Formulae. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:149-162 [Conf]
  2. Philippe Balbiani, Dimiter Vakarelov
    Extending arrow logic. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:13-17 [Conf]
  3. Ivo Düntsch, Wendy MacCaull, Dimiter Vakarelov, Michael Winter
    Topological Representation of Contact Lattices. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2006, pp:135-147 [Conf]
  4. Georgi Dimov, Dimiter Vakarelov
    Topological Representation of Precontact Algebras. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2005, pp:1-16 [Conf]
  5. Wendy MacCaull, Dimiter Vakarelov
    Lattice-Based Paraconsistent Logic. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2005, pp:173-187 [Conf]
  6. Willem Conradie, Valentin Goranko, Dimiter Vakarelov
    Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Model?theoretic Aspects. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2004, pp:17-51 [Conf]
  7. Dimiter Vakarelov
    Modal Definability in Languages with a Finite Number of Propositional Variables and a New Extension of the Sahlqvist's Class. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2002, pp:499-518 [Conf]
  8. Valentin Goranko, Dimiter Vakarelov
    Sahlqvist Formulas Unleashed in Polyadic Modal Languages. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2000, pp:221-240 [Conf]
  9. Valentin Goranko, Dimiter Vakarelov
    Modal Logic and Universal Algebra I: Modal Axiomatizations of Structures. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 1998, pp:247-274 [Conf]
  10. Dimiter Vakarelov
    Abstract Characterization of some Knowledge Representation Systems and the Logic NIL of Nondeterministic Information. [Citation Graph (0, 0)][DBLP]
    AIMSA, 1986, pp:255-260 [Conf]
  11. Philippe Balbiani, Dimiter Vakarelov
    First-Order Characterization and Modal Analysis of Indiscernibility and Complementarity in Information Systems. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2001, pp:772-781 [Conf]
  12. Dimiter Vakarelov
    Modal Logics for Knowledge Representation Systems. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:257-277 [Conf]
  13. Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov
    Geometrical Structures and Modal Logic. [Citation Graph (0, 0)][DBLP]
    FAPR, 1996, pp:43-57 [Conf]
  14. Dimiter Vakarelov, Ivo Düntsch, Brandon Bennett
    A note on proximity spaces and connection based mereology. [Citation Graph (0, 0)][DBLP]
    FOIS, 2001, pp:139-150 [Conf]
  15. Dimiter Vakarelov
    A Modal Theory of Arrows. Arrow Logics I. [Citation Graph (0, 0)][DBLP]
    JELIA, 1992, pp:1-24 [Conf]
  16. Dimiter Vakarelov
    Filtration theorem for dynamic algebras with tests and inverse operator. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1980, pp:314-324 [Conf]
  17. Dimiter Vakarelov
    A Modal Characterization of Indiscernibility and Similarity Relations in Pawlak's Information Systems. [Citation Graph (0, 0)][DBLP]
    RSFDGrC (1), 2005, pp:12-22 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    WOCFAI, 1995, pp:417-428 [Conf]
  19. Philippe Balbiani, Dimiter Vakarelov
    Dynamic extensions of arrow logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:127, n:1-3, pp:1-15 [Journal]
  20. Valentin Goranko, Dimiter Vakarelov
    Elementary canonical formulae: extending Sahlqvist's theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:1-2, pp:180-217 [Journal]
  21. Philippe Balbiani, Dimiter Vakarelov
    A Modal Logic for Indiscernibility and Complementarity in Information Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:50, n:3-4, pp:243-263 [Journal]
  22. Philippe Balbiani, Dimiter Vakarelov
    Iteration-free PDL with Intersection: a Complete Axiomatization. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:173-194 [Journal]
  23. Ana Deneva, Dimiter Vakarelov
    Modal Logics for Local and Global Similarity Relations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:3/4, pp:295-304 [Journal]
  24. Georgi Dimov, Dimiter Vakarelov
    On Scott Consequence Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:33, n:1, pp:43-70 [Journal]
  25. Dimiter Vakarelov
    A model logic for similarity relations in pawlak knowledge representation systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:15, n:1, pp:61-79 [Journal]
  26. Dimiter Vakarelov
    Inductive modal logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:16, n:3-4, pp:383-405 [Journal]
  27. Georgi Dimov, Dimiter Vakarelov
    Contact Algebras and Region-based Theory of Space: Proximity Approach - II. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:2-3, pp:251-282 [Journal]
  28. Georgi Dimov, Dimiter Vakarelov
    Contact Algebras and Region-based Theory of Space: A Proximity Approach - I. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:2-3, pp:209-249 [Journal]
  29. Philippe Balbiani, Dimiter Vakarelov
    Arrow Logic with Arbitrary Intersections: Applications to Pawlak's Information Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:75, n:1-4, pp:1-25 [Journal]
  30. Dimiter Vakarelov
    A Modal Logic for Cyclic Repeating [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:1, pp:103-122 [Journal]
  31. Valentin Goranko, Dimiter Vakarelov
    Hyperboolean Algebras and Hyperboolean Modal Logic. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1999, v:9, n:2-3, pp:- [Journal]
  32. Philippe Balbiani, Dimiter Vakarelov
    PDL with Intersection of Programs: A Complete Axiomatization. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2003, v:13, n:3-4, pp:231-276 [Journal]
  33. Dimiter Vakarelov
    Many-dimensional arrow logics. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1996, v:6, n:4, pp:- [Journal]
  34. Dimiter Vakarelov
    Rough Polyadic modal logics. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1999, v:1, n:1, pp:- [Journal]
  35. Dimiter Vakarelov, Georgi Dimov, Ivo Düntsch, Brandon Bennett
    A Proximity Approach to Some Region-Based Theories of Space. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2002, v:12, n:3-4, pp:527-0 [Journal]
  36. Willem Conradie, Valentin Goranko, Dimiter Vakarelov
    Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:1, pp:- [Journal]
  37. Philippe Balbiani, Luis Fariñas del Cerro, Tinko Tinchev, Dimiter Vakarelov
    Modal Logics for Incidence Geometries. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:1, pp:59-78 [Journal]
  38. Valentin Goranko, Dimiter Vakarelov
    Sahlqvist Formulas in Hybrid Polyadic Modal Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2001, v:11, n:5, pp:737-754 [Journal]
  39. Willem Conradie, Valentin Goranko, Dimiter Vakarelov
    Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:5, pp:579-612 [Journal]
  40. Dimiter Vakarelov
    Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2005, v:80, n:2-3, pp:393-430 [Journal]
  41. Dimiter Vakarelov
    A duality between Pawlak's knowledge representation systems and BI-consequence systems. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1995, v:55, n:1, pp:205-228 [Journal]
  42. Dimiter Vakarelov
    Modal Logics for Knowledge Representation Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:433-456 [Journal]
  43. Ivo Düntsch, Dimiter Vakarelov
    Region-based theory of discrete spaces: A proximity approach. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:49, n:1-4, pp:5-14 [Journal]
  44. Willem Conradie, Valentin Goranko, Dimiter Vakarelov
    Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  45. Modal logics for mereotopological relations. [Citation Graph (, )][DBLP]


  46. Algorithmic Definability and Completeness in Modal Logic. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002