BEGIN:VCALENDAR
VERSION:2.0
PRODID:https://github.com/derhansen/sf_event_mgt
METHOD:PUBLISH
BEGIN:VEVENT
UID:2610-409@gi.de
CLASS: PUBLIC
SUMMARY:Special Track: Formal Reasoning with Artificial Intelligence at ISD
 A`2019
DESCRIPTION:In this ISDA`2019-affiliated track, which combines formal metho
 ds and artificial intelligence, we are looking forward to presentations whi
 ch either use rigorous formal techniques (model checking or theorem proving
 ) in support of deductive artificial reasoning (for example: reasoning abou
 t artificial agents and their possible actions, about time, about knowledge
  representation and belief systems, and the like), or which use various heu
 ristic techniques from artificial intelligence in order to accelerate the r
 un-time performance of the various model checking or theorem proving tools 
 that are used as correctness deciders in the field of formal methods. Thoug
 h many formal verification problems (e.g., the SAT problem) are NP-complete
  (if decidable at all) in their worst cases, their average cases might stil
 l get improved by means of "intelligent" choices of the clauses or proof-su
 b-paths that a verification tool can attempt in its next steps. Moreover, t
 his track shall also be open for "intelligent" solutions of problems of sof
 tware testing and abstract program interpretation: for example the rapid se
 arch for a minimal input value set that yields maximal path coverage, and t
 he like. As far as the old "symbols versus neurons" dispute in the field of
  artificial intelligence is concerned we would like to emphasise that this 
 track supports a very broad understanding of the term "artificial intellige
 nce" itself, which shall not only include the latest number-based search he
 uristics and techniques (like particle swarm optimisation, neural networks,
  and the like), but also the older or more classical concepts of artificial
  reasoning (i.e.: rule-based symbol manipulation). All papers submitted to 
 this track must be novel and original, and may not have already been submit
 ted for publication elsewhere. Related work must be sufficiently captured i
 n a section of its own under the section heading "Related Work". Practical 
 software tool demonstrations are highly welcome, too, even if they are not 
 accompanied by the presentation of a publishable theoretical paper. For a s
 ubmission's page-layout and page-limit please see the instructions provided
  on the web-site of the main conference.\n\nTOPICS INCLUDE:\n\n* AI-support
 ed generation of test case inputs for automated software engineering,\n\n* 
 AI-supported optimisation/acceleration of model checking algorithms,\n\n* A
 I-supported optimisation/acceleration of theorem proving tools,\n\n* AI-sup
 ported optimisation/acceleration of SAT solving tools,\n\n* AI-supported de
 tection of potential program invariants (e.g. loop invariants),\n\n* AI-sup
 ported detection of promising abstraction-choices for state-space-reduction
 ,\n\n* AI-supported program transformation (software refactoring) technique
 s,\n\n* and similar areas of research.\n\nTRACK CO-CHAIRS:\n\nStefan Gruner
  (Dept. of Comp.Sc., Univ. of Pretoria, RSA)\n\nNils Timm (Dept. of Comp.Sc
 ., Univ. of Pretoria, RSA)
LOCATION:The Future Africa Campus of the University of Pretoria, https://ww
 w.futureafrica.science
DTSTAMP:20191204T135106Z
DTSTART:20191203T070000Z
DTEND:20191205T160000Z
END:VEVENT
END:VCALENDAR