Skip to main content Accessibility help
×
×
Home

Declarative semantics for active rules

  • SERGIO FLESCA (a1) and SERGIO GRECO (a2)
    • Published online: 03 April 2001
Abstract

In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular, we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model and maximal stable model semantics. The semantics of an active program [Ascr ][Pscr ] is given by first rewriting it into a deductive program [Lscr ][Pscr ], then computing a model M defining the declarative semantics of [Lscr ][Pscr ] and, finally, applying ‘consistent’ updates contained in M to the source database. The framework we propose permits a natural integration of deductive and active rules and can also be applied to queries with function symbols or to queries over infinite databases.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed