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/2022/newsitem/13657/1-
 August-2022-ICLP-22-Workshop-on-goal-directed-exec
 ution-of-answer-set-programs-Haifa-Israel
DTSTAMP:20220515T222418
SUMMARY:ICLP'22 Workshop on goal-directed executio
 n of answer set programs, Haifa, Israel
DTSTART;VALUE=DATE:20220801
DTEND;VALUE=DATE:20220801
LOCATION:Haifa, Israel
DESCRIPTION:Answer set programming is a successful
  extension of logic programming for solving combin
 atorial problems as well as knowledge representati
 on and reasoning problems. Most current implementa
 tions of ASP work by grounding a program and using
  a SAT solver-like technology to find the answer s
 ets. While this approach is extremely efficient, r
 elying on grounding of the program leads to signif
 icant blow-up of the program size, and computing t
 he whole model makes finding justification of an a
 tom in the model hard. This limits the applicabili
 ty of ASP to problems dealing with large knowledge
  bases. Goal-directed or query-driven execution st
 rategies have been proposed that do not require gr
 ounding. The goal of this workshop is to foster di
 scussion around challenges and opportunities that 
 such approaches present.  Technical papers, positi
 on papers, as well as extended abstracts are welco
 me. Papers should be maximum 8 pages long and in L
 NCS Format. Submissions must be made via EasyChair
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>Answer se
 t programming is a successful extension of logic p
 rogramming for solving combinatorial problems as w
 ell as knowledge representation and reasoning prob
 lems. Most current implementations of ASP work by 
 grounding a program and using a SAT solver-like te
 chnology to find the answer sets. While this appro
 ach is extremely efficient, relying on grounding o
 f the program leads to significant blow-up of the 
 program size, and computing the whole model makes 
 finding justification of an atom in the model hard
 . This limits the applicability of ASP to problems
  dealing with large knowledge bases. Goal-directed
  or query-driven execution strategies have been pr
 oposed that do not require grounding. The goal of 
 this workshop is to foster discussion around chall
 enges and opportunities that such approaches prese
 nt.</p>\n</div><div>\n  <p>Technical papers, posit
 ion papers, as well as extended abstracts are welc
 ome. Papers should be maximum 8 pages long and in 
 LNCS Format. Submissions must be made via EasyChai
 r</p>\n</div>
URL:https://utdallas.edu/~gupta/gde22
CONTACT:joaquin.arias at urjc.es
END:VEVENT
END:VCALENDAR