When dealing with narrative texts, a system must possess a strong domain theory, and especially knowledge about situations occurring in the world. Otherwise the system must envisa...
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
Procedural encoding of scattered and unstructured scalar datasets using Radial Basis Functions (RBF) is an active area of research with great potential for compactly representing ...
Manfred Weiler, Ralf P. Botchen, Simon Stegmaier, ...