BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://sal.cs.unibuc.ro
X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190516T100000
DTEND;TZID=UTC:20190516T120000
DTSTAMP:20260426T063504
CREATED:20190506T043334Z
LAST-MODIFIED:20190514T093157Z
UID:406-1558000800-1558008000@sal.cs.unibuc.ro
SUMMARY:An introduction to hybrid-dynamic first-order logic
DESCRIPTION:Speaker:  Ionuţ Ţuţu (Royal Holloway\, University of London) \n\nAbstract: We propose a hybrid-dynamic first-order logic as a formal\nfoundation for specifying and reasoning about reconfigurable\nsystems. As the name suggests\, the formalism we develop extends\n(many-sorted) first-order logic with features that are common to\nhybrid and to dynamic logics. This provides certain key advantages for\ndealing with reconfiguration\, such as: (a) a signature of nominals\,\nincluding operation and relation symbols\, that allows references to\nspecific possible worlds / system configurations – as in the case of\nhybrid logics; (b) distinguished signatures of rigid and flexible\nsymbols\, where the rigid symbols are interpreted uniformly across\npossible worlds – this supports a rigid form of quantification\, which\nensures that variables have the same interpretation regardless of the\npossible world where they are evaluated; (c) hybrid terms\, which\nincrease the expressive power of the logic in the context of rigid\nsymbols; and (d) modal operators over dynamic-logic actions\, which are\ndefined as regular expressions over binary nominal relations. In this\ncontext\, we advance a notion of hybrid-dynamic Horn clause and develop\na series of results that lead to an initial-semantics theorem for the\nHorn-clause fragment of hybrid-dynamic first-order logic.
URL:https://sal.cs.unibuc.ro/event/good-for-a-conclusion-not-good-enough-for-a-premise-natural-language-reasoning-and-the-logic-of-vagueness/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190530T100000
DTEND;TZID=UTC:20190530T120000
DTSTAMP:20260426T063504
CREATED:20190529T063857Z
LAST-MODIFIED:20190529T063857Z
UID:421-1559210400-1559217600@sal.cs.unibuc.ro
SUMMARY:Protocols in Dynamic Epistemic Logic
DESCRIPTION:Speaker:  Alexandru Dragomir (University of Bucharest) \n\nAbstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning (epistemic actions). However\, not all epistemic actions are allowed to be executed in an initial epistemic model\, and this is where the concept of a protocol comes in: a protocol stipulates what epistemic actions are allowed to be performed in a model. The aim of my presentation is to introduce the audience to two accounts of protocols in DEL: one based on [1]\, and the second on [2]. \nReferences:\n[1] T. Hoshi\, Epistemic dynamics and protocol information\, PhD thesis\, Stanford University\, 2009.\n[2] Y. Wang\, Y. Epistemic Modelling and Protocol Dynamics\, PhD thesis\, University of Amsterdam\, 2010.
URL:https://sal.cs.unibuc.ro/event/protocols-in-dynamic-epistemic-logic/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
END:VCALENDAR