Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
We investigate a complete pipeline for measuring, modeling, and fabricating objects with specified subsurface scattering behaviors. The process starts with measuring the scatterin...
Milo Haan, Martin Fuchs, Wojciech Matusik, Han...
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...