A distribution semantics for probabilistic term rewriting

DOI10.1016/J.JLAMP.2025.101070MaRDI QIDQ6945553zbMATH OpenFDO

Authors Germán Vidal

Publication date 8 August 2025

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2025.101070

zbMATH Keywords

semanticsterm rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cites work

• Abducing through negation as failure: stable models within the independent choice logic
• Completeness results for basic narrowing
• Confluence and convergence in probabilistically terminating reduction systems
• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
• Confluence in probabilistic rewriting
• From innermost to full almost-sure termination of probabilistic term rewriting
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1722716 (Why is no real title available?)
• scientific article; zbMATH DE number 3921956 (Why is no real title available?)
• scientific article; zbMATH DE number 4043235 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 3615887 (Why is no real title available?)
• scientific article; zbMATH DE number 512906 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 2043521 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 2090077 (Why is no real title available?)
• Logic Programming
• Maude: specification and programming in rewriting logic
• On probabilistic inference by weighted model counting
• On the Efficient Execution of ProbLog Programs
• On the semantics and complexity of probabilistic logic programs
• PMaude: rewrite-based specification language for probabilistic object systems
• Probabilistic Horn abduction and Bayesian networks
• Probabilistic operational semantics for the lambda calculus
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• Proving Positive Almost Sure Termination Under Strategies
• Reachability Analysis for Termination and Confluence of Rewriting
• Reachability analysis over term rewriting systems
• Term Rewriting and Applications
• Termination by absence of infinite chains of dependency pairs
• Termination of term rewriting using dependency pairs
• The book of why. The new science of cause and effect
• The independent choice logic for modelling multiple agents under uncertainty

This page was built for publication: A distribution semantics for probabilistic term rewriting

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