A Complete Classification of Tractability in RCC-5

06/01/1997
by   P. Jonsson, et al.
0

We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satisfiability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classification of satisfiability for all these subclasses into polynomial and NP-complete respectively. In the process, we identify all maximal tractable subalgebras which are four in total.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2011

The Complexity of Reasoning about Spatial Congruence

In the recent literature of Artificial Intelligence, an intensive resear...
research
10/07/2021

On the Complexity of Inductively Learning Guarded Rules

We investigate the computational complexity of mining guarded clauses fr...
research
03/15/2021

On a Communication Complexity problem in Combinatorial Number Theory

The original knapsack problem is well known to be NP-complete. In a mult...
research
08/04/2022

NP Decision Procedure for Monomial and Linear Integer Constraints

Motivated by satisfiability of constraints with function symbols, we con...
research
09/07/2017

The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence

Given a set U of alternatives, a choice (correspondence) on U is a contr...
research
02/02/2019

Computational Complexity of Queries Based on Itemsets

We investigate determining the exact bounds of the frequencies of conjun...
research
07/24/2013

A novel approach of solving the CNF-SAT problem

In this paper, we discussed CNF-SAT problem (NP-Complete problem) and an...

Please sign up or login with your details

Forgot password? Click here to reset