RDFS
RDF Schema; a technology that extends basic graph structures with formal constraints and inference rules, including domain/range specifications that enable logical deduction from stated relationships
As defined in Why Agentic Systems Need Ontologies — Frank Coyle, UC Berkeley
Where it comes up · 1
Most important claims · 4 of 4Search all claims for “RDFS” →
- RDFS domain and range constraints enable inference: if 'teaches' has domain 'teacher', then observing 'Bob teaches Scooter' logically implies Bob is a teacher; combined with 'all teachers are persons', it also implies Bob is a person.Why Agentic Systems Need Ontologies — Frank Coyle, UC Berkeley
- Ontological reasoners built on RDFS and OWL can serve as guardrails to keep LLMs 'on track' and 'honest' by validating outputs against domain logic before accepting them.Why Agentic Systems Need Ontologies — Frank Coyle, UC Berkeley
- Derivations and constraints defined in RDFS and OWL sit alongside the core graph rather than within it, and can be applied to help agents operate reliably when dealing with probabilistic language model outputs.Why Agentic Systems Need Ontologies — Frank Coyle, UC Berkeley
- Auxiliary ontological technologies like RDFS and OWL sit alongside graph structures and enable inference and constraint checking by formalizing rules about domain relationships.Why Agentic Systems Need Ontologies — Frank Coyle, UC Berkeley