Preference and non-deterministic choice

DOI10.1007/978-3-642-14808-8_10MaRDI QIDQ3585048zbMATH OpenOpenAlexFDO

Authors Bill Stoddart, Frank Zeyda, Steve Dunne

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://research.tees.ac.uk/ws/files/6480866/116087.pdf

zbMATH Keywords

backtrackingcontinuationsreversible computingsemantics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Recommendations

• A unification of probabilistic choice within a design-based model of reversible computation
• Probabilistic Choice, Reversibility, Loops, and Miracles
• Preferential Choice Representation Theorems for Branching Time Structures
• scientific article; zbMATH DE number 1678399
• scientific article; zbMATH DE number 1759622

Cited in

(4)

• Preference and the cost of preferential choice
• BGSL: an imperative language for specification and refinement of backtracking programs
• Diversity of preferences in an unpredictable environment
• Bunch theory: axioms, logic, applications and model

This page was built for publication: Preference and non-deterministic choice

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