Switch to: References

Add citations

You must login to add citations.
  1. Deontic Logic and Ethics.Shyam Nair - forthcoming - In Gabbay, John Horty, Xavier Parent, Ron van der Meyden & Leon van der Torre (eds.), Handbook of Deontic Logic and Normative System, Volume 2. College Publications.
    Though there have been productive interactions between moral philosophers and deontic logicians, there has also been a tradition of neglecting the insights that the fields can offer one another. The most sustained interactions between moral philosophers and deontic logicians have notbeen systematic but instead have been scattered across a number of distinct and often unrelated topics. This chapter primarily focuses on three topics. First, we discuss the “actualism/possibilism” debate which, very roughly, concerns the relevance of what one will do at (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An improved factor based approach to precedential constraint.Adam Rigoni - 2015 - Artificial Intelligence and Law 23 (2):133-160.
    In this article I argue for rule-based, non-monotonic theories of common law judicial reasoning and improve upon one such theory offered by Horty and Bench-Capon. The improvements reveal some of the interconnections between formal theories of judicial reasoning and traditional issues within jurisprudence regarding the notions of the ratio decidendi and obiter dicta. Though I do not purport to resolve the long-standing jurisprudential issues here, it is beneficial for theorists both of legal philosophy and formalizing legal reasoning to see where (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Defaults with Priorities.John Horty - 2007 - Journal of Philosophical Logic 36 (4):367-413.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Defeasible inheritance systems and reactive diagrams.Dov Gabbay - 2008 - Logic Journal of the IGPL 17 (1):1-54.
    Inheritance diagrams are directed acyclic graphs with two types of connections between nodes: x → y and x ↛ y . Given a diagram D, one can ask the formal question of “is there a valid path between node x and node y?” Depending on the existence of a valid path we can answer the question “x is a y” or “x is not a y”. The answer to the above question is determined through a complex inductive algorithm on paths (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations