On the relative expressiveness of description logics and predicate logics

DOI10.1016/0004-3702(96)00004-5zbMath1506.68132OpenAlexW1998044200MaRDI QIDQ2674209

A. Borgida

Publication date: 22 September 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(96)00004-5

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (18)

The guarded fragment with transitive guards ⋮ Semantic forgetting in expressive description logics ⋮ Representing ontologies using description logics, description graphs, and rules ⋮ Making fuzzy description logic more general ⋮ Open answer set programming for the semantic web ⋮ An epistemic operator for description logics ⋮ Integrity constraints for XML ⋮ Foundations of instance level updates in expressive description logics ⋮ Cheap Boolean Role Constructors for Description Logics ⋮ Unnamed Item ⋮ On finitely-valued fuzzy description logics ⋮ On the relationship between fuzzy description logics and many-valued modal logics ⋮ DL-FOIL Concept Learning in Description Logics ⋮ Foundations of Onto-Relational Learning ⋮ On bisimulations for description logics ⋮ Goals and benchmarks for automated map reasoning ⋮ Information integration using logical views ⋮ Expressiveness of concept expressions in first-order description logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper and lower bounds for first order expressibility
• Relational queries computable in polynomial time
• On languages with two variables

This page was built for publication: On the relative expressiveness of description logics and predicate logics