Deciding confluence for a simple class of relational transducer networks
From MaRDI portal
(Redirected from Publication:269334)
Recommendations
- Relational transducers for declarative networking
- Publication:4936134
- On efficient recognition of transductions and relations
- Deciding the confluence of ordered term rewrite systems
- scientific article; zbMATH DE number 1303445
- scientific article; zbMATH DE number 3928342
- Single network relational transductive learning
- Confluence in probabilistic rewriting
- Deciding confluence of certain term rewriting systems in polynomial time
Cites work
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A variant of a recursively unsolvable problem
- Relational transducers for declarative networking
- Relational transducers for electronic commerce
- Specification and verification of data-driven Web applications
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Verification of relational transducers for electronic commerce
- Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
Cited in
(4)
This page was built for publication: Deciding confluence for a simple class of relational transducer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269334)