BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20141026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20151025T030000
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20150329T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.7018.field_data.0@diag.uniroma1.it
DTSTAMP:20240613T001423Z
CREATED:20150320T164542Z
DESCRIPTION:With the development of declarative programming\, more and more
programsthat solve practical problems are available online. Ideally\, we
should be ableto reuse them by first finding suitable components on the we
b\, and then combiningthem\, in order to solve new more complex problems.T
he main challenge is that the programs may be written in different languag
es(even legacy languages)\, and rely on different solving technologies.Our
goal is to develop foundations for combining such programs (or agents)and
\, eventually\, provide practical algorithms for finding solutions.Towards
this goal\, we developed a framework of Modular Systems (MS)\,where indiv
idual modules can be specified in any language that admits model-theoretic
semantics. For example\, modules can be specified in first-order logic\,A
nswer Set Programming\, Integer Liner Programming\, sometimes even in C or
Java.In the MS framework\, such modules are combined using thealgebraic o
perations of sequence\, union\, loop\, projection\, etc.In this talk\, I w
ill introduce the algebra of MSs and present itsmodel-theoretic\, inferent
ial and structural operational semantics (SOS).I will define a multi-logic
logic of MSs\, which is a logic counterpartof the algebra. This logic can
be called the Logic of Information Flowbecause the direction of informati
on propagation from agent to agentis always clear. I will describe a high-
level algorithm for solving MSs.The algorithm was inspired by Satisfiabili
ty Modular Theory (SMT) solvers.Finally\, I will discuss the complexity of
the formalism andthe descriptive complexity of modular systems\, as a fun
ctionof expressiveness of individual modules. Such analysis is important b
ecausewe want our formalism to be expressive enough to represent all probl
emsin a class of interest\, but we don't want it be too expressiveto const
ruct practical solvers.If there is time\, I will explain an extension of M
Ss with preferences.Joint work with Shahab Tasharrofi.bio: Eugenia Ternovs
ka is an Associate Professor at SimonFraser University\, Vancouver\, Canad
a. She received her PhDin Computer Science at the University of Toronto\,
anddiploma at Moscow State University. Her research interestsare in Artifi
cial Intelligence and Computational Logic.
DTSTART;TZID=Europe/Paris:20150325T120000
DTEND;TZID=Europe/Paris:20150325T120000
LAST-MODIFIED:20150324T111601Z
LOCATION:B203 DIAG Via Ariosto 25
SUMMARY:Modular Systems: Semantics\, Logic\, Algorithms\, Complexity - Eug
enia Ternovska (Simon Fraser Univ) - Eugenia Ternovska (Simon Fraser Unive
rsity)
URL;TYPE=URI:http://diag.uniroma1.it/node/7018
END:VEVENT
END:VCALENDAR