Declarative semantics for active rules

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.

• Publication year

  1998

• Venue

  Theory and Practice of Logic Programming

• Publication date

  1998-08-24

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1017/S1471068400001009arXiv cs/0312042
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Integration of Active and Deductive Database Rules

  1998cited by this paper
• On Logical Foundations of Active Databases

  1998cited by this paper
• The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries

  1997cited by this paper
• Deterministic Semantics for Datalog¬: Complexity and Expressive Power

  1997cited by this paper
• Abstract Interpretation of Active Rules and its Use in Termination Analysis

  1997cited by this paper
• The Story of the IDEA Methodology

  1997cited by this paper
• Deterministic and Non-Deterministic Stable Models

  1997influential reference
• The Expressive Power of Unique Total Stable Model Semantics

  1997cited by this paper
• A Model Theoretic Approach to Update Rule Programs

  1997influential reference
• Formal Characterization of Active Databases

  1996cited by this paper
• Improving Rule Analysis by Means of Triggering and Activation Graphs

  1995cited by this paper
• DATALOG Queries with Stratified Negation and Choice: from P to DP

  1995influential reference
• Semantics and expressiveness issues in active databases (extended abstract)

  1995cited by this paper
• Active Database Rules with Transaction-Conscious Stable-Model Semantics

  1995influential reference
• Active Database Systems: Triggers and Rules for Advanced Database Processing

  1994cited by this paper
• Foundations of Databases

  1994influential reference
• An Algebraic Approach to Rule Analysis in Expert Database Systems

  1994cited by this paper
• Termination of Logic Programs: The Never-Ending Story

  1994cited by this paper
• Deductive and Active Databases: Two Paradigms or Ends of a Spectrum?

  1993cited by this paper
• A denotational semantics for the Starburst production rule language

  1992cited by this paper
• Behavior of database production rules: termination, confluence, and observable determinism

  1992influential reference
• A Catalog of Complexity Classes

  1991cited by this paper
• Autoepistemic logic

  1991influential reference
• Datalog Extensions for Database Queries and Updates

  1991cited by this paper
• The well-founded semantics for general logic programs

  1991cited by this paper
• Stable models and non-determinism in logic programs with negation

  1990cited by this paper
• Well-Founded Semantics Coincides with Three-Valued Stable Semantics

  1990cited by this paper
• Implicit definability on finite structures and unambiguous computations

  1990cited by this paper
• Non-deterministic languages to express deterministic transformations

  1990cited by this paper
• Safety of datalog queries over infinite databases

  1989cited by this paper
• Principles of database and knowledge- base systems

  1989cited by this paper
• The Stable Model Semantics for Logic Programming

  1988influential reference
• An axiomatic approach to deciding query safety in deductive databases

  1988influential reference
• Principles of database and knowledge-base systems, Vol. I

  1988cited by this paper
• A framework for testing safety and effective computability of extended datalog

  1988cited by this paper
• Why not negation by fixpoint?

  1988cited by this paper
• Safety of recursive Horn clauses with infinite relations

  1987cited by this paper
• Foundations of Logic Programming

  1984cited by this paper
• The complexity of relational query languages (Extended Abstract)

  1982cited by this paper
• On the Unique Satisfiability Problem

  1982cited by this paper
• Principles Of Database And Knowledge-Base Systems

  1979cited by this paper

• Database Repair via Event-Condition-Action Rules in Dynamic Logic

  2022cites this paper
• Consistent query answering with prioritized active integrity constraints

  2020cites this paper
• Abductive logic programming agents with destructive databases

  2011cites this paper
• An Agent Language with Destructive Assignment and Model-Theoretic Semantics

  2010cites this paper
• Logic Programming Languages for Databases and the Web

  2010cites this paper
• Rule-Based Event Processing and Reaction Rules

  2009cites this paper
• RBSLA: Rule based service level agreements: RBSLA; knowledge representation for automated e-contract, SLA and policy management

  2007cites this paper
• Approach to deductive database

  2007cites this paper
• The Reaction RuleML Classification of the Event / Action / State Processing and Reasoning Space

  2006cites this paper
• Declarative Semantics of Production Rules for Integrity Maintenance

  2006cites this paper
• Verification, Validation and Integrity of Distributed and Interchanged Rule Based Policies and Contracts in the Semantic Web

  2006cites this paper
• ECA-RuleML: An Approach combining ECA Rules with temporal interval-based KR Event/Action Logics and Transactional Update Logics

  2006cites this paper
• Verification and Validation of R2ML Rule Bases

  2006cites this paper
• The ContractLog Approach Towards Test-driven Verification and Validation of Rule Bases-A Homogeneous Integration of Test Cases and Integrity Constraints into Evolving Logic Programs and Rule Markup Languages (RuleML)

  2005cites this paper
• Active integrity constraints

  2004cites this paper
• Termination Analysis of Active Rules with Priorities

  2003cites this paper
• Improving the Refined Triggering Graph Method for Active Rules Termination Analysis

  2002cites this paper
• Facilitating Hard Active Database Applications

  2001cites this paper
• Termination analysis of active rules modular sets

  2001cites this paper
• Terminaison des règles actives dans les bases de données orientées objet

  2000cites this paper