Order:
Disambiguations
Boris Konev [5]B. Konev [4]
  1.  31
    On Dynamic Topological and Metric Logics.B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev - 2006 - Studia Logica 84 (1):129-160.
    We investigate computational properties of propositional logics for dynamical systems. First, we consider logics for dynamic topological systems (W.f), fi, where W is a topological space and f a homeomorphism on W. The logics come with ‘modal’ operators interpreted by the topological closure and interior, and temporal operators interpreted along the orbits {w, f(w), f2 (w), ˙˙˙} of points w ε W. We show that for various classes of topological spaces the resulting logics are not recursively enumerable (and so not (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  14
    Model-theoretic inseparability and modularity of description logic ontologies.Boris Konev, Carsten Lutz, Dirk Walther & Frank Wolter - 2013 - Artificial Intelligence 203 (C):66-103.
  3.  13
    (1 other version)Dynamic topological logics over spaces with continuous functions.B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 299-318.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  34
    Max sat approximation beyond the limits of polynomial-time approximation.Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch & Boris Konev - 2001 - Annals of Pure and Applied Logic 113 (1-3):81-94.
    We describe approximation algorithms for MAX SAT with performance ratios arbitrarily close to 1, in particular, when performance ratios exceed the limits of polynomial-time approximation. Namely, given a polynomial-time α-approximation algorithm , we construct an -approximation algorithm . The algorithm runs in time of the order ck, where k is the number of clauses in the input formula and c is a constant depending on α. Thus we estimate the cost of improving a performance ratio. Similar constructions for MAX 2SAT (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  22
    Deductive temporal reasoning with constraints.Clare Dixon, Boris Konev, Michael Fisher & Sherly Nietiadi - 2013 - Journal of Applied Logic 11 (1):30-51.
  6.  9
    Computer-aided proof of Erdős discrepancy properties.Boris Konev & Alexei Lisitsa - 2015 - Artificial Intelligence 224 (C):103-118.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  23
    Foreword.Boris Konev, Renate Schmidt & Stephan Schulz - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):7-8.
  8.  18
    Baaz, M., HaHjek, P., Montagna, F. and Veith, H., Complexity of t-tautologies (1} 3) 3} 11 Beauquier, D. and Slissenko, A., A" rst order logic for speci" cation of timed algorithms: basic properties and a decidable class (1} 3) 13} 52. [REVIEW]L. Boasson, P. Cegielski, I. Guessarian, Y. Matiyasevich, E. Dantsin, M. Gavrilovich, E. A. Hirsch & B. Konev - 2001 - Annals of Pure and Applied Logic 113 (399):400.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation