Preferential Choice Representation Theorems for Branching Time Structures

DOI10.1093/logcom/5.6.783zbMath0839.03019OpenAlexW1989417167MaRDI QIDQ4868263

Karl 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 logicnonmonotonic reasoningupdatepreferential 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)

Related Items (4)

Maximality vs. optimality in dyadic deontic logic. Completeness results for systems in Hansson's tradition ⋮ Explaining updates by minimal sums ⋮ COMPLETENESS OF ÅQVIST’S SYSTEMS E AND F ⋮ New techniques and completeness results for preferential structures

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