Foundations of logic programming
Foundations of logic programming
Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A framework for testing safety and effective computability of extended datalog
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Safety of datalog queries over infinite databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
A denotational semantics for the Starburst production rule language
ACM SIGMOD Record
Semantics and expressiveness issues in active databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
On logical foundations of active databases
Logics for databases and information systems
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An axiomatic approach to deciding query safety in deductive databases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Active Database Systems: Triggers and Rules for Advanced Database Processing
Active Database Systems: Triggers and Rules for Advanced Database Processing
"Possible is certain'' is desirable and can be expressive
Annals of Mathematics and Artificial Intelligence
Active Database Rules with Transaction-Conscious Stable-Model Semantics
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Deterministic Semantics for Datalog¬: Complexity and Expressive Power
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
DATALOG Queries with Stratified Negation and Choice: from P to DP
ICDT '95 Proceedings of the 5th International Conference on Database Theory
A Model Theoretic Approach to Update Rule Programs
ICDT '97 Proceedings of the 6th International Conference on Database Theory
An Algebraic Approach to Rule Analysis in Expert Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Generalized Implicit Definitions on Finite Structures
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Formal Characterization of Active Databases
LID '96 Proceedings of the International Workshop on Logic in Databases
Abstract Interpretation of Active Rules and its Use in Termination Analysis
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Static Analysis of Logical Languages with Deferred Update Semantics
IEEE Transactions on Knowledge and Data Engineering
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Logic programming languages for databases and the web
A 25-year perspective on logic programming
An agent language with destructive assignment and model-theoretic semantics
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Abductive logic programming agents with destructive databases
Annals of Mathematics and Artificial Intelligence
Declarative semantics of production rules for integrity maintenance
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
| Hi-index | 0.00 |
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 𝒜𝒫 is given by first rewriting it into a deductive program ℒ𝒫, then computing a model M defining the declarative semantics of ℒ𝒫 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.