Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
Authors:
- Maja H. KirkebyMKMaja H. Kirkeby
- Henning ChristiansenHCHenning Christiansen
- 1 February 2019
- journal article
- research article
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 105, 217-228
Abstract
No abstract availableKeywords
Funding Information
- The Danish Council for Independent Research, Natural Sciences (DFF 4181-00442)
This publication has 6 references indexed in Scilit:
- On proving confluence modulo equivalence for Constraint Handling RulesFormal Aspects of Computing, 2016
- Probabilistic Constraint Handling RulesElectronic Notes in Theoretical Computer Science, 2002
- Termination of Probabilistic Concurrent ProgramACM Transactions on Programming Languages and Systems, 1983
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942
- Some properties of conversionTransactions of the American Mathematical Society, 1936