Reusing and modifying rulebases by predicate substitution
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3874579 (Why is no real title available?)
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 4064536 (Why is no real title available?)
- scientific article; zbMATH DE number 3670430 (Why is no real title available?)
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A polymorphic type system for Prolog
- A theory of type polymorphism in programming
- Alternation
- Contributions to the Theory of Logic Programming
- Structure and complexity of relational queries
- The Semantics of Predicate Logic as a Programming Language
Cited in
(2)
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)