1 / 11

Storage and retrieval of first order logic terms in a database

Storage and retrieval of first order logic terms in a database. Peter Gurský UI PF UPJŠ Košice Dateso 2004. f (g(“a”,x),”c”) f(g(x,“b“),y) f (g(“a”,”b”),”a”) f(g(x,”c”),”b”) f(x,y). unifikovate ľné generalizácie inštancie variácie identity. ?. Query term:. f(g (“a”,”c”),”b”).

drake-banks
Download Presentation

Storage and retrieval of first order logic terms in a database

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Storage and retrieval of first order logic terms in a database Peter Gurský UI PF UPJŠ Košice Dateso 2004

  2. f(g(“a”,x),”c”) f(g(x,“b“),y) f(g(“a”,”b”),”a”) f(g(x,”c”),”b”) f(x,y) unifikovateľné generalizácie inštancie variácie identity ? Query term: f(g(“a”,”c”),”b”) f(x,g(“a”)) f(g(y),g(y))

  3. Indexovanie • Symbol-based indexing • Attribute-based indexing

  4. Návratová podm. f(g(“a”,x),”c”) f(g(x,“b“),y) f(g(“a”,”b”),”a”) f(g(x,”c”),”b”) f(x,y) generalizácia Query term: f(g(“a”,”c”),”b”) p-stringy: f(g(a,*),c) f(g(*,b),*) f(g(a,b),a) f(g(*,c),b) f(*,*) Discrimination trees

  5. Jump list f(a,g(1,h(b),a),h(4,h(b))) f(a,*,h(4,*))

  6. ? f(x,g(”a”)) f(g(y),g(y)) Unifikácia na grafoch termov (dagoch) x => g(”a”), y=>”a”

  7. Reprezentácia termov f(a,g(1,h(b),a),h(4,h(b)))

  8. Reprezentácia indexovacej štruktúry

  9. Tabuľky

  10. Hľadanie termov • Vyhľadanie id subtermov query termu v tabuľke SYMBOL • Ak sme nenašli niektoré id a návratová podmienka je inštancia alebo variácia tak STOP, inak pridelíme nové id • Nájdenie kandidátov v indexe príslušných množín • Získanie kandidátov z databázy • Výpočet substitúcií a odstránenie nevyhovujúcich kandidátov

  11. Ďakujem za pozornosť Peter Gurský gursky@science.upjs.sk UI PF UPJŠ Košice Dateso 2004

More Related