BIROn - Birkbeck Institutional Research Online

    On the computational complexity of spatial logics with connectedness constraints

    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.

    Full text not available from this repository.

    Metadata

    Item Type: Book Section
    Additional Information: 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 13 May 2013 12:56
    Last Modified: 11 Oct 2016 12:01
    URI: http://eprints.bbk.ac.uk/id/eprint/6710

    Statistics

    Downloads
    Activity Overview
    0Downloads
    141Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item