Reusing and modifying rulebases by predicate substitution

DOI10.1006/JCSS.1997.1456zbMATH Open0869.68044OpenAlexW1979650864MaRDI QIDQ676430FDOQ676430

Authors: Anthony J. Bonner, Tomasz Imielinski 

Publication date: 18 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/44c1bfd3073a673c516e5e7604681e0e78da53f6

Recommendations

• Substitution-based compilation of extended rules in deductive databases
• Publication:4888331
• A rewriting framework for rule-based programming dynamic applications
• A class of rewriting rules and reverse transformation for rule-based equivalent transformation
• An algebraic approach to revising propositional rule-based knowledge bases
• Rewriting semantics of production rule sets
• scientific article; zbMATH DE number 2043394

zbMATH Keywords

deductive databasepredicate substitutionreusing

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• A theory of type polymorphism in programming
• Title not available (Why is that?)
• A lattice-theoretical fixpoint theorem and its applications
• Alternation
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Contributions to the Theory of Logic Programming
• Title not available (Why is that?)
• Structure and complexity of relational queries
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polymorphic type system for Prolog

Cited In (2)

• Substitution-based compilation of extended rules in deductive databases
• Title not available (Why is that?)

Uses Software

• ML

This page was built for publication: Reusing and modifying rulebases by predicate substitution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676430)