| A |
| Abduction | |
| ABox | |
| Absorption | |
| Abstraction refinement | |
| action languages | |
| Acyclic queries | |
| ALC | |
| ALCQIO | |
| algorithm | |
| algorithms | |
| alternating Turing machine | |
| annotations | |
| answer set programming | |
| Approximations | |
| Atomic Decomposition | |
| attribute transition | |
| Automata-Based Reasoning | |
| B |
| Bayesian networks | |
| belief change | |
| belief probability | |
| BioPortal | |
| bisimulation | |
| Boolean circuit complexity | |
| bounded treewidth | |
| C |
| Combined Approach | |
| Comparative user evaluation | |
| competency question | |
| complexity | |
| complexity analysis | |
| complexity of query answering | |
| complexity theory | |
| Computational Complexity | |
| Concept Similarity | |
| Conceptual Similarity | |
| conjunctive queries | |
| Conjunctive query answering | |
| consequence-based reasoning | |
| consistency | |
| Consistency Checking | |
| Content representation | |
| context-based reasoning | |
| Contexts | |
| Contextual Reasoning | |
| contextualized description logics | |
| contraction | |
| D |
| Datalog | |
| Datalog rewritability | |
| datalog rewriting | |
| Datatypes | |
| defeasible inheritance | |
| defeasible knowledge | |
| Defeasible reasoning | |
| dependencies | |
| Description logic | |
| Description Logic Ontologies | |
| Description Logics | |
| Disjunctive Datalog | |
| Disjunctive existential rules | |
| DL Lite | |
| DL-Lite | |
| DL-programs | |
| DL-safe rules | |
| DRed | |
| E |
| EL | |
| EL TBoxes | |
| Error-tolerant reasoning | |
| evaluation | |
| Explanations | |
| Expressive Ontologies | |
| expressive TBoxes | |
| expressiveness | |
| F |
| Faceted search | |
| Finite Lattices | |
| Finite satisfiability and implication algorithm | |
| Finite-valued Logic | |
| fix-sized subontologies | |
| FL_0 | |
| Forgetting | |
| functional dependencies | |
| functional roles | |
| Fuzzy Description Logic | |
| Fuzzy Description Logics | |
| Fuzzy Ontologies | |
| G |
| General Models | |
| Goedel T-norm | |
| Graph structured data | |
| Guardedness | |
| Gödel t-norm | |
| H |
| hard subsets | |
| Higher-order description logics | |
| hypergraph | |
| Hypergraphs | |
| I |
| identification constraints | |
| inconsistency handling | |
| inconsistency-tolerant query answering | |
| Information Hiding | |
| information retrieval | |
| Instance Queries | |
| intervals | |
| inverse rewriting | |
| J |
| justification | |
| Justifications | |
| K |
| knowledge base revision | |
| knowledge obfuscation | |
| KR 2014 paper | |
| L |
| large-scale ontologies | |
| lock-free data structures | |
| logical difference | |
| M |
| machine learning | |
| main-memory RDF store | |
| Mapping Analysis | |
| Mapping Visualization | |
| Matching | |
| Materialisation | |
| Materialization | |
| meta modelling | |
| MinAs | |
| minimal model semantics | |
| Minimal modules | |
| modular reasoning | |
| Modularisation | |
| Modularity | |
| modules | |
| monitoring | |
| multi-context systems | |
| N |
| nominal schemas | |
| Nominals | |
| Non monotonic reasoning | |
| non-determinism | |
| non-standard reasoning | |
| Nonmonotonic Reasoning | |
| normal forms | |
| O |
| OBDA | |
| OBDA design tools | |
| Ontologies | |
| ontology | |
| Ontology Based Data Access | |
| Ontology Change | |
| Ontology Decomposition | |
| ontology engineering | |
| Ontology modularisation | |
| ontology modularity | |
| Ontology Repair | |
| Ontology-based data access | |
| optimisation | |
| OWL | |
| OWL 2 profiles | |
| OWL 2 QL | |
| OWL 2 RL | |
| P |
| parallel materialisation | |
| PCA | |
| performance prediction | |
| planning | |
| Preferential | |
| Privacy | |
| Probabilistic Description Logic | |
| probabilistic reasoning | |
| Protege | |
| PTIME dialects | |
| Q |
| QBF | |
| query answering | |
| query languages | |
| query rewriting | |
| R |
| rational closure | |
| RDF | |
| RDFS | |
| Reachability assertions | |
| reasoner | |
| Reasoning | |
| regular expressions | |
| Relaxed Queries | |
| Repair Decomposition | |
| Repairing | |
| requirement traceability | |
| resolution | |
| RL systems | |
| Rough DL | |
| S |
| Safety | |
| semantic knowledge | |
| Semantic tableaux | |
| separation logic | |
| shape analysis | |
| SHOIQ | |
| SHOQ | |
| Similarity Measures | |
| simulation | |
| SNOMED-CT | |
| SPARQL | |
| SPARQL Update | |
| SROIQ | |
| Static Analysis | |
| strategic interaction | |
| streams | |
| Succinctness | |
| System description | |
| T |
| Tableau Algorithm | |
| tableau reasoning | |
| TBox Revision | |
| temporal attributes | |
| Temporal Description Logics | |
| temporal logic | |
| temporal querying | |
| terminologies | |
| time | |
| tracing | |
| tractability boundaries | |
| Transitive closure | |
| tree automaton | |
| U |
| uncertainty | |
| unfolding | |
| Unification | |
| Uniform Interpolation | |
| V |
| Visual Languages | |
| Visual query formulation | |
| Visual query formulation interface | |
| X |
| xpath | |