Handling termination in a logical language for active rules

Bertram Ludäscher, Georg Lausen

Research output: Contribution to journalArticlepeer-review

Abstract

Statelog is a Datalog extension integrating the declarative semantics of deductive rules with the possiblity to define updates in the style of active and production rules. The language is surprisingly simple, yet captures many essential features of active rules. After reviewing the basics of active rules, production rules, and deductive rules, we elaborate on the problem of handling rule termination in the context of Statelog: It is undecidable whether a Statelog program terminates for all databases, and PSPACE-complete for a given database. The latter can be accomplished within the logical language: for every Statelog program P, there is a terminating program P which decides for any given database D, whether P ∪ D terminates.

Original languageEnglish (US)
Pages (from-to)65-84
Number of pages20
JournalInformatica
Volume9
Issue number1
StatePublished - Jan 1 1998
Externally publishedYes

Keywords

  • Active databases
  • Deductive databases
  • Production rules
  • Termination

ASJC Scopus subject areas

  • Information Systems
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Handling termination in a logical language for active rules'. Together they form a unique fingerprint.

Cite this