BEGIN:VCALENDAR VERSION:2.0 PRODID:ILLC Website X-WR-TIMEZONE:Europe/Amsterdam BEGIN:VTIMEZONE TZID:Europe/Amsterdam X-LIC-LOCATION:Europe/Amsterdam BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19700329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:19701025T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:/NewsandEvents/Archives/2017/newsitem/9404/6-- -8-December-2017-Workshop-on-Second-order-Quantifi er-Elimination-Related-Topics-SOQE-2017-Dresden-Ge rmany DTSTAMP:20171019T145741 SUMMARY:Workshop on Second-order Quantifier Elimin ation & Related Topics (SOQE 2017), Dresden, Germ any DTSTART;VALUE=DATE:20171206 DTEND;VALUE=DATE:20171208 LOCATION:Dresden, Germany DESCRIPTION:Second-order quantifier elimination (S OQE) means to compute from a given logic formula w ith quantifiers upon second-order objects such as predicates, an equivalent formula in which these q uantified second-order objects do no longer occur. It can be combined with various underlying logics , including classical propositional and first-orde r logic as well as modal and description logics. I n slight variations it is also known as forgetting , projection, predicate elimination and uniform in terpolation. It is particularly attractive as a lo gic-based approach to various computational tasks. The workshop aims at bringing together researche rs working on SOQE and related topics. The hope is that issues shared by problems emerging from diff erent special contexts will become apparent, inter esting open research problems will be identified, and potential new applications as well as demands on implementations will become visible. We invite submissions of works with original research, adap tions of relevant research published elsewhere, an d discussions of research in progress, as well as suggestions for tutorials on topics of interest. X-ALT-DESC;FMTTYPE=text/html:
Second-or der quantifier elimination (SOQE) means to compute from a given logic formula with quantifiers upon second-order objects such as predicates, an equiva lent formula in which these quantified second-orde r objects do no longer occur. It can be combined w ith various underlying logics, including classical propositional and first-order logic as well as mo dal and description logics. In slight variations i t is also known as forgetting, projection, predica te elimination and uniform interpolation. It is pa rticularly attractive as a logic-based approach to various computational tasks.
\n\nThe work shop aims at bringing together researchers working on SOQE and related topics. The hope is that issu es shared by problems emerging from different spec ial contexts will become apparent, interesting ope n research problems will be identified, and potent ial new applications as well as demands on impleme ntations will become visible.
We invite submissions of works with original rese arch, adaptions of relevant research published els ewhere, and discussions of research in progress, a s well as suggestions for tutorials on topics of i nterest.