Computer Science
Satisfiability Problem
100%
Complexity
40%
Transitive Relation
27%
Computational Complexity
19%
Artificial Intelligence
18%
Semantics
17%
Spatial Reasoning
15%
Closure
14%
Topological Relationship
12%
Domains
12%
Finite Model Property
11%
Reasoning
10%
Arithmetic Circuit
10%
Functions
10%
Constraint Language
9%
Temporal Logic
9%
Boolean Operation
9%
Survey
9%
Guarded Fragment
9%
Formal Language
9%
Transitive Verb
8%
Connected Component
8%
Modal Operator
8%
Quantification
7%
Nonnegative Integer
7%
Function Symbol
7%
Answering Query
7%
Ontology
6%
Data Complexity
6%
Complexity Theory
6%
Axiomatic System
6%
Functional Dependency
6%
Spatial Representation
6%
Contexts
6%
Integer Programming
6%
Renewed Interest
6%
Spatial Entity
6%
Complexity of Reasoning
6%
Natural Languages
6%
Equivalence Relation
5%
Mathematics
Variables
45%
Complete
31%
Order
28%
Dimensional Euclidean Space
21%
Euclidean Space
15%
Quantifier
13%
Constraints
11%
Number
10%
Finite Set
9%
Functions
9%
Computational
9%
Closure
7%
Sentence
7%
Equality
7%
Nonnegative Integer
7%
Algebra over a Field
6%
Natural Number
6%
Closed Set
6%
Topological Space
6%
Calculus
6%
Connected Component
6%
Numerical Set
6%
Polygon
6%
Topology
6%
Constant
6%
Bounds
5%
Arithmetic
5%
Arts and Humanities
Agent
10%
Fragment
9%
Syllogistic
9%
Semantics
6%
Temporal
6%
Logic
6%
Prepositions
6%
System
5%
