On the Computational Complexity of Spatial Logics with Connectedness Constraints

نویسندگان

  • Roman Kontchakov
  • Ian Pratt-Hartmann
  • Frank Wolter
  • Michael Zakharyaschev
چکیده

We investigate the computational complexity of spatial logics extended with the means to represent topological connectedness and restrict the number of connected components. In particular, we show that the connectedness constraints can increase complexity from NP to PSpace, ExpTime and, if component counting is allowed, to NExpTime.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial logics with connectedness predicates

We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of these logics and show that the connectedness constraints can increase complexity from NP to PSpace, E...

متن کامل

Topology, connectedness, and modal logic

This paper presents a survey of topological spatial logics, taking as its point of departure the interpretation of the modal logic S4 due to McKinsey and Tarski. We consider the effect of extending this logic with the means to represent topological connectedness, focusing principally on the issue of computational complexity. In particular, we draw attention to the special problems which arise w...

متن کامل

Reasoning about Topological and Cardinal Direction Relations Between 2-Dimensional Spatial Objects

Increasing the expressiveness of qualitative spatial calculi is an essential step towards meeting the requirements of applications. This can be achieved by combining existing calculi in a way that we can express spatial information using relations from multiple calculi. The great challenge is to develop reasoning algorithms that are correct and complete when reasoning over the combined informat...

متن کامل

It Takes Two to Tango: Customization and Standardization as Colluding Logics in Healthcare; Comment on “(Re) Making the Procrustean Bed Standardization and Customization as Competing Logics in Healthcare”

The healthcare context is characterized with new developments, technologies, ideas and expectations that are continually reshaping the frontline of care delivery. Mannion and Exworthy identify two key factors driving this complexity, ‘standardization’ and ‘customization,’ and their apparent resulting paradox to be negotiated by healthcare professionals, managers and policy makers. However, whil...

متن کامل

Topological Logics over Euclidean Spaces

In this paper we prove some results on the computational complexity of standard quantifierfree spatial logics with the connectedness predicate interpreted over the Euclidean spaces R and R. Topological logics with connectedness. A topological logic is a formal language whose variables range over subsets of topological spaces, and whose non-logical primitives denote fixed topological properties ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008