Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...