Spatial logics with connectedness predicates

Details Spatial logics with connectedness predicates Spatial logics with connectedness predicates

2010-03-28

arxiv.org/abs/1003.5399v3

LMCS 6 (3:7) 2010

Computer Science

Logic in Computer Science

Some results of the paper were presented at LPAR 2008 and ECAI 2000

Scientific paper

10.2168/LMCS-6(3:7)2010

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, ExpTime and, if component counting is allowed, to NExpTime.

Affiliated with

Also associated with

No associations

Rating

Spatial logics with connectedness predicates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spatial logics with connectedness predicates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spatial logics with connectedness predicates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498826