Finite Unification Set

Finite unification sets (FUS) are a class of rule sets used in knowledge representation and reasoning, primarily focusing on the decidability of querying—determining whether a given query is entailed by a set of rules. Current research investigates the boundaries of decidability within FUS, exploring subclasses like "sticky rulesets" where decidability holds for certain query types, and contrasting FUS with other rule set classes based on model properties like cliquewidth or treewidth. This research is crucial for advancing the efficiency and reliability of ontology-based query answering, impacting areas like knowledge graph management and automated reasoning systems.