Dyadic TGDs - A new paradigm for ontological query answering
| dc.contributor.author | Marte, Cinzia | |
| dc.contributor.author | Greco, Gianluigi | |
| dc.contributor.author | Manna, Marco | |
| dc.contributor.author | Guerriero, Francesca | |
| dc.contributor.author | Leone, Nicola | |
| dc.date.accessioned | 2024-04-10T09:15:10Z | |
| dc.date.available | 2024-04-10T09:15:10Z | |
| dc.date.issued | 2022-03-11 | |
| dc.description | Dottorato di Ricerca in Matematica e Informatica . Ciclo XXXIII | en_US |
| dc.description.abstract | Ontology-BasedQueryAnswering(OBQA)consistsinqueryingdata– bases bytakingontologicalknowledgeintoaccount.Wefocusona logical frameworkbasedonexistentialrulesor tuple generatingdepen- dencies (TGDs), alsoknownasDatalog±, whichcollectsthebasicde- cidable classesofTGDs,andgeneralizesseveralontologyspecification languages. While thereexistlotsofdifferentclassesintheliterature,inmost cases eachofthemrequiresthedevelopmentofaspecificsolverand, only rarely,thedefinitionofanewclassallowstheuseofexisting systems. Thisgapbetweenthenumberofexistentparadigmsandthe numberofdevelopedtools,promptedustodefineacombinationof Shy and Ward (twowell-knownclassesthatenjoygoodcomputational properties)withtheaimofexploitingthetooldevelopedfor Shy. Nevertheless,studyinghowtomergethesetwoclasses,wehavereal- ized thatitwouldbepossibletodefine,inamoregeneralway,the combinationofexistingclasses,inordertomakethemostofexisting systems. Hence, inthiswork,startingfromtheanalysisofthetwoaforemen- tioned existingclasses,wedefineamoregeneralclass,named Dyadic TGDs, thatallowstoextendinauniformandelegantwayallthede- cidable classes,whileusingtheexistentrelatedsystems.Atthesame time, wedefinealsoacombinationof Shy and Ward, named Ward+, and weshowthatitcanbeseenasaDyadicsetofTGDs. Finally,tosupportthetheoreticalpartofthethesis,weimplementa BCQ evaluationalgorithmfortheclass Ward+, thattakesadvantage of anexistingsolverdevelopedfor Shy. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10955/5474 | |
| dc.identifier.uri | https://doi.org/10.13126/unical.it/dottorati/5474 | |
| dc.language.iso | en | en_US |
| dc.publisher | Università della Calabria | en_US |
| dc.relation.ispartofseries | INF/01; | |
| dc.subject | Ontological Query Answering | en_US |
| dc.subject | Database query languages | en_US |
| dc.subject | Datalog | en_US |
| dc.subject | Tuple Generating Dependencies | en_US |
| dc.subject | Complexity | en_US |
| dc.title | Dyadic TGDs - A new paradigm for ontological query answering | en_US |
| dc.type | Thesis | en_US |