BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Jump to: Book Section
    Number of items: 6.

    Book Section

    Kontchakov, Roman and Nenov, Y. and Pratt-Hartmann, I. and Zakharyaschev, Michael (2011) On the decidability of connectedness constraints in 2D and 3D Euclidean spaces. In: Walsh, T. (ed.) Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. California, U.S.: AAAI Press, pp. 957-962. ISBN 9781577355120.

    Kontchakov, Roman and Lutz, C. and Toman, D. and Wolter, F. and Zakharyaschev, Michael (2011) The combined approach to ontology-based data access. In: Walsh, T. (ed.) Twenty-Second International Joint Conference on Artificial Intelligence. California, U.S.: AAAI Press, pp. 2656-2661. ISBN 9781577355120.

    Chen, Hubie (2003) Inverse circumscription. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 449-454.

    Calì, Andrea and Lembo, D. and Rosati, R. (2003) Query rewriting and answering under constraints in data integration systems. In: Gottlob, G. and Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 16-21.

    Chen, Hubie (2003) A theory of average-case compilability in knowledge representation. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 455-460.

    Chen, Hubie and Gomes, C.P. and Selman, B. (2001) Formal models of heavy-tailed behavior in combinatorial search. In: Walsh, T. (ed.) 7th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 2239. Springer, pp. 408-421. ISBN 9783540428633.

    This list was generated on Wed Apr 14 04:55:13 2021 BST.