2010/01/05 by Lutz Schroeder, Schroeder, Lutz, Dirk Pattinson +1
Computer Science · #Artificial Intelligence (cs.AI) #F.4.1 #FOS: Computer and information sciences #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.1001.0735
openalex publication_date 2010/01/05 · arxiv created 2010/02/03 · arxiv updated 2010/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for a given functor, thus covering a wide range of reasoning principles including, e.g., probabilistic, graded, default, or coalitional operators. Specifically, we establish generic criteria for a given coalgebraic hybrid logic to admit named canonical models, with ensuing completeness proofs for pure extensions on the one hand, and for an extended hybrid language with local binding on the other. We instantiate our framework with a number of examples. Notably, we prove completeness of graded hybrid logic with local binding.