Preferential Choice Representation Theorems for Branching Time Structures

DOI10.1093/LOGCOM/5.6.783zbMATH Open0839.03019OpenAlexW1989417167MaRDI QIDQ4868263FDOQ4868263

Authors: K. Schlechta 

Publication date: 19 June 1996

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/5.6.783

Recommendations

• Unrestricted preferential structures
• scientific article; zbMATH DE number 1241669
• Publication:4507874
• Preferred history semantics for iterated updates

zbMATH Keywords

nonmonotonic reasoningdeontic logicupdatepreferential choicedynamic structuresdeontic choice functionreasoning about developments

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Other applications of logic (03B80)

Cited In (6)

• Completeness of Åqvist's systems \(\mathbf E\) and \(\mathbf F\)
• New techniques and completeness results for preferential structures
• Unrestricted preferential structures
• Maximality vs. optimality in dyadic deontic logic. Completeness results for systems in Hansson's tradition
• Preference and non-deterministic choice
• Explaining updates by minimal sums

This page was built for publication: Preferential Choice Representation Theorems for Branching Time Structures

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