Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Calautti, Marco"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    Item
    On the decidability of logic programs and chase algorithms
    (2016-02-19) Calautti, Marco; Crupi, Felice; Greco, Sergio
    The problem of programs termination is a fundamental problem in Computer Science, and has always gained interest from research communities, due to the challenge of dealing with a problem that has been proved to be undecidable in general. Furthermore, there has been a great increase of interest from the logic programming and database communities in identifying meaningful and large fragments of the languages used, in order to guarantee termination of inference tasks. The goal of this thesis is to study the termination problem in the eld of logic programming with function symbols and in the eld of integrity database dependencies enforced via the Chase procedure. The state of the art for both elds is presented, identifying limitations of current works and new approaches to overcome such limitations are proposed.

Unical - Sistema Bibliotecario di Ateneo - Servizio Automazione Biblioteche @ 2025

  • Privacy policy
  • End User Agreement
  • Send Feedback