In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

Q: The Region Connection Calculus (RCC) [41] is a well-known calculus for representing part-whole and topological relations. It plays an important role in qualitative spatial reasoning, geographical information science, and ontology. The computational complexity of reasoning with RCC5 and RCC8 (two fragments of RCC) as well as other qualitative spatial/temporal calculi has been investigated in depth in the literature. Most of these works focus on the consistency of qualitative constraint networks. In this paper, we consider the important problem of redundant qualitative constraints. For a set Γ of qualitative constraints, we say a constraint (xRy) in Γ is redundant if it is entailed by the rest of Γ. A prime subnetwork of Γ is a subset of Γ which contains no redundant constraints and has the same solution set as Γ. It is natural to ask how to compute such a prime subnetwork, and when it is unique. In this paper, we show that this problem is in general intractable, but becomes tractable if Γ is over a tractable subalgebra S of a qualitative calculus. Furthermore, if S is a subalgebra of RCC5 or RCC8 in which weak composition distributes over nonempty intersections, then Γ has a unique prime subnetwork, which can be obtained in cubic time by removing all redundant constraints simultaneously from Γ. As a byproduct, we show that any path-consistent network over such a distributive subalgebra is weakly globally consistent and minimal. A thorough empirical analysis of the prime subnetwork upon real geographical data sets demonstrates the approach is able to identify significantly more redundant con∗Corresponding Author Email addresses: sanjiang.li@uts.edu.au (Sanjiang Li), zhiguo.long@student.uts.edu.au (Zhiguo Long), liuweiming@baidu.com (Weiming Liu), matt@duckham.org (Matt Duckham), aboth@student.unimelb.edu.au (Alan Both) Preprint submitted to Elsevier February 16, 2015 ar X iv :1 40 3. 06 13 v2 [ cs .A I] 1 3 Fe b 20 15 straints than previously proposed algorithms, especially in constraint networks with larger proportions of partial overlap relations.

A: On Redundant Topological Constraints
****
Q: A new approach called SKYSET (Synthetic Knowledge Yield Social Entities Translation) is proposed to validate completeness and to reduce ambiguity from written instructional documentation. SKYSET utilizes a quintuple set of standardized categories, which differs from traditional approaches that typically use triples. The SKYSET System defines the categories required to form a standard template for representing information that is portable across different domains. It provides a standardized framework that enables sentences from written instructions to be translated into sets of category typed entities on a table or database. The SKYSET entities contain conceptual units or phrases that represent information from the original source documentation. SKYSET enables information concatenation where multiple documents from different domains can be translated and combined into a single common filterable and searchable table of entities. Index Terms – Cognitive Linguistics, Dual Intentional Semantic Decomposition and Reconstruction (DISDR), Frame Semantics, Information Concatenation, Information Integration, Information Summarization, Knowledge Architecture, Knowledge Management Internal External (KMIE), Metalinguistic Awareness, Synthetic Knowledge Yield Social Entities Translation (SKYSET).

A: Introducing SKYSET - a Quintuple Approach for Improving Instructions
****
Q: We examine the meaning and the complexity of probabilistic logic programs that consist of a set of rules and a set of independent probabilistic facts (that is, programs based on Sato’s distribution semantics). We focus on two semantics, respectively based on stable and on well-founded models. We show that the semantics based on stable models (referred to as the “credal semantics”) produces sets of probability models that dominate infinitely monotone Choquet capacities; we describe several useful consequences of this result. We then examine the complexity of inference with probabilistic logic programs. We distinguish between the complexity of inference when a probabilistic program and a query are given (the inferential complexity), and the complexity of inference when the probabilistic program is fixed and the query is given (the query complexity, akin to data complexity as used in database theory). We obtain results on the inferential and query complexity for acyclic, stratified, and cyclic propositional and relational programs; complexity reaches various levels of the counting hierarchy and even exponential levels.

A:
On the Semantics and Complexity of Probabilistic Logic Programs
****