{"id":"https://openalex.org/W2148552911","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-165","title":"On the decidability of connectedness constraints in 2D and 3D euclidean spaces","display_name":"On the decidability of connectedness constraints in 2D and 3D euclidean spaces","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2148552911","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-165","mag":"2148552911"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ad00585e-237b-4f9f-882b-49817c5d6dd4","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/ad00585e-237b-4f9f-882b-49817c5d6dd4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kontchakov, R, Nenov, Y, Pratt-Hartmann, I & Zakharyaschev, M 2011, On the decidability of connectedness constraints in 2D and 3D euclidean spaces. in IJCAI International Joint Conference on Artificial Intelligence|IJCAI Int. Joint Conf. Artif. Intell.. AAAI Press, pp. 957-962, 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, 1/07/11. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-165","raw_type":"info:eu-repo/semantics/conferenceObject"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047265550","display_name":"Roman Kontchakov","orcid":"https://orcid.org/0000-0002-9349-9159"},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kontchakov, Roman","raw_affiliation_strings":["Dept. of Comput. Sci. & Inf. Syst, Birkbeck Coll., London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Syst, Birkbeck Coll., London, UK","institution_ids":["https://openalex.org/I98259816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082856719","display_name":"Yavor Nenov","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nenov, Yavor","raw_affiliation_strings":["[School of Computer Science, Univ. of Manchester, UK]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[School of Computer Science, Univ. of Manchester, UK]","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033570514","display_name":"Ian Pratt\u2010Hartmann","orcid":"https://orcid.org/0000-0003-0062-043X"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pratt-Hartmann, Ian; id_orcid 0000-0003-0062-043X","raw_affiliation_strings":["[School of Computer Science, Univ. of Manchester, UK]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[School of Computer Science, Univ. of Manchester, UK]","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001878365","display_name":"Michael Zakharyaschev","orcid":"https://orcid.org/0000-0002-2210-5183"},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Zakharyaschev, Michael","raw_affiliation_strings":["Dept. of Comput. Sci. & Inf. Syst, Birkbeck Coll., London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Syst, Birkbeck Coll., London, UK","institution_ids":["https://openalex.org/I98259816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0021,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87563122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7210239768028259},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.6788681745529175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6397547721862793},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.5409745573997498},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5249923467636108},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.49507418274879456},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4934629499912262},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.4813888370990753},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4464256465435028},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.43720555305480957},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.43672502040863037},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.42478781938552856},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.340314120054245},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2591005563735962},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.2454349398612976},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.21529355645179749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14970162510871887},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08142772316932678}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7210239768028259},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.6788681745529175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6397547721862793},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.5409745573997498},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5249923467636108},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.49507418274879456},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4934629499912262},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.4813888370990753},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4464256465435028},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.43720555305480957},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.43672502040863037},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.42478781938552856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.340314120054245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2591005563735962},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.2454349398612976},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.21529355645179749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14970162510871887},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08142772316932678},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ad00585e-237b-4f9f-882b-49817c5d6dd4","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/ad00585e-237b-4f9f-882b-49817c5d6dd4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kontchakov, R, Nenov, Y, Pratt-Hartmann, I & Zakharyaschev, M 2011, On the decidability of connectedness constraints in 2D and 3D euclidean spaces. in IJCAI International Joint Conference on Artificial Intelligence|IJCAI Int. Joint Conf. Artif. Intell.. AAAI Press, pp. 957-962, 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, 1/07/11. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-165","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W852874","https://openalex.org/W875060","https://openalex.org/W23279412","https://openalex.org/W145918469","https://openalex.org/W1503383798","https://openalex.org/W1518486998","https://openalex.org/W1557143830","https://openalex.org/W1800693550","https://openalex.org/W2111526090","https://openalex.org/W2114565854","https://openalex.org/W2133039566","https://openalex.org/W2137917830","https://openalex.org/W2240909318","https://openalex.org/W2569667514"],"related_works":["https://openalex.org/W852874","https://openalex.org/W2091637374","https://openalex.org/W1481654098","https://openalex.org/W3105043058","https://openalex.org/W567452227","https://openalex.org/W1599600353","https://openalex.org/W1486876676","https://openalex.org/W2144552594","https://openalex.org/W1552324588","https://openalex.org/W1600939987","https://openalex.org/W623577274","https://openalex.org/W573820141","https://openalex.org/W1550568949","https://openalex.org/W1498064541","https://openalex.org/W1522881798","https://openalex.org/W588285511","https://openalex.org/W140266893","https://openalex.org/W1484350719","https://openalex.org/W604668415","https://openalex.org/W420489366"],"abstract_inverted_index":{"We":[0,24],"investigate":[1],"(quantifier-free)":[2],"spatial":[3],"constraint":[4],"languages":[5],"with":[6,51],"equality,":[7],"contact":[8],"and":[9,40,73],"connectedness":[10],"predicates,":[11],"as":[12,14],"well":[13],"Boolean":[15],"operations":[16],"on":[17,34,41],"regions,":[18],"interpreted":[19],"over":[20,60,69,75],"low-dimensional":[21],"Euclidean":[22],"spaces.":[23],"show":[25],"that":[26],"the":[27,35,38,42,49,52],"complexity":[28],"of":[29,37,44],"reasoning":[30],"varies":[31],"dramatically":[32],"depending":[33],"dimension":[36],"space":[39],"type":[43],"regions":[45],"considered.":[46],"For":[47],"example,":[48],"logic":[50],"interior-connectedness":[53],"predicate":[54],"(and":[55],"without":[56],"contact)":[57],"is":[58],"undecidable":[59],"polygons":[61],"or":[62],"regular":[63,76],"closed":[64,77],"sets":[65,78],"in":[66,71,79],"\u211d2,":[67],"EXPTIME-complete":[68],"polyhedra":[70],"\u211d3,":[72],"NP-complete":[74],"\u211d3.":[80]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-27T00:00:00"}