Preferential Choice Representation Theorems for Branching Time Structures

DOI10.1093/LOGCOM/5.6.783MaRDI QIDQ4868263zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

deontic choice functiondeontic logicdynamic structuresnonmonotonic reasoningpreferential choicereasoning about developmentsupdate

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(6)

• Preference and non-deterministic choice
• Unrestricted preferential structures
• New techniques and completeness results for preferential structures
• Maximality vs. optimality in dyadic deontic logic. Completeness results for systems in Hansson's tradition
• Completeness of Åqvist's systems E and F
• 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)