BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Number of items: 4.

    Artale, A. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2013) The complexity of clausal fragments of LTL. In: McMillan, K. and Middeldorp, A. and Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 8312. Berlin, Germany: Springer, pp. 35-52. ISBN 9783642452215.

    Kontchakov, Roman and Pratt-Hartmann, I. and Wolter, F. and Zakharyaschev, Michael (2008) On the computational complexity of spatial logics with connectedness constraints. In: Cervesato, C. and Veith, V. and Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 5330. Berlin, Germany: Springer, pp. 574-589. ISBN 9783540894384.

    Sheremet, Mikhail and Tishkovsky, D. and Wolter, F. and Zakharyaschev, Michael (2005) Comparative similarity, tree automata, and diophantine equations. In: Sutcliffe, G. and Voronkov, A. (eds.) LPAR 2005: Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 3835. Springer, pp. 651-665. ISBN 9783540305538.

    Hodkinson, I.M. and Wolter, F. and Zakharyaschev, Michael (2001) Monodic fragments of first-order temporal logics: 2000-2001 A.D. In: Nieuwenhuis, R. and Voronkov, A. (eds.) LPAR 2001: Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 2250. Springer, pp. 1-23. ISBN 9783540429579.

    This list was generated on Tue May 21 05:11:34 2024 BST.