Communications of the ACM
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A self-controlling interpreter for the relational production language
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Implementing large production systems in a DBMS environment: concepts and algorithms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Exploiting concurrency in a DBMS implementation for production systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
A Production Rule-Based Approach to Deductive Databases
Proceedings of the Fourth International Conference on Data Engineering
Deciding Whether a Production Rule is Relational Computable
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
| Hi-index | 0.00 |
We present our research on defining a correct semantics for forward chaining production systems (PS) programs A correct semantics ensures that the execution of the program will not produce incorrect answers and execution will terminate; it also ensures that the answers are consistent. We define a class of stratified PS programs, and propose an operational semantics for these programs. We define an operator Tps, which computes the operational fixpoint for the productions of the stratified PS program; the fixpoint captures the meaning of the PS program. The theory that can be derived from the productions of the PS program may be inconsistent with the constraints that are also derived from the PS program. We can then view the constraints as modifying the theory so that the modified theory PS is consistent with the constraints. However, the same answers are obtained in the operational semantics of the stratified PS program or from the modified theory PS.