Towards Metric Temporal Answer Set Programming

We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.

Monotonicity, Convexity, Continuity, and Isomorphism: The Psychological Scaffolding of Arithmetic

With the natural numbers as our starting point, we obtain the arithmetic structure of real (as in R) addition and multiplication without relying on any algebraic tools; in particular, we leverage monotonicity, convexity, continuity, and isomorphism. Natural addition arises by minimizing against monotonicity. Rational addition arises from natural addition by minimizing against convexity. Real addition arises from rational addition via any one of three methods; unique convex extension, unique continuous extension, and unique monotonic extension. Real multiplication arises from real addition via isomorphism. Following these mathematical developments, we argue that each of the leveraged mathematical concepts ---monotonicity, convexity, continuity, and isomorphism --- enjoys, prior to its formal mathematical existence, an intuitive psychological existence. Taken together, these lines of argument suggest a way for psychological representation of algebraic structure to emerge from non-algebraic --- and psychologically plausible --- ingredients.

Shock Capturing in Large Eddy Simulations by Adaptive Filtering

A method for shock capturing by adaptive filtering for use with high-resolution, high-order schemes for Large Eddy Simulations (LES) is presented. The LES method used in all the examples here employs the Explicit Filtering approach and the spatial derivatives are obtained with sixth-order, compact, finite differences. The adaptation is to drop the order of the explicit filter to two at gridpoints where a shock is detected, and to then increase the order from 2 to 10 in steps at successive gridpoints away from the shock. The method is found to be effective in a series of tests of common inviscid 1D and 2D problems of shock propagation and propagation of waves through shocks. As a prelude to LES, the 3D Taylor–Green problem for the inviscid and a finite viscosity case were simulated. An assessment of the overall performance of the method for LES was carried out by simulating an underexpanded round jet at a Reynolds number of 6.09 million, based in centerline velocity and diameter at nozzle exit plane. Very close quantitative agreement was found for the development of centerline mean pressure when compared to experiment. Simulations on several increasingly finer grids showed a monotonic extension of the computed part of the inertial range, with little change to low frequency content. Amplitudes and locations of large changes in pressure through several cells were captured accurately. A similar performance was observed for LES of an impinging jet containing normal and curved shocks.

A declarative extension of horn clauses, and its significance for datalog and its applications

FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates in recursion by reasoning on the multiplicity of occurrences satisfying existential goals. The least fixpoint semantics, and its equivalent least model semantics, hold for logic programs with FS-rules; moreover, generalized notions of stratification and stable models are easily derived when negated goals are allowed. Finally, the generalization of techniques such as seminaive fixpoint and magic sets, make possible the efficient implementation of DatalogFS, i.e., Datalog with rules with Frequency Support (FS-rules) and stratified negation. A large number of applications that could not be supported efficiently, or could not be expressed at all in stratified Datalog can now be easily expressed and efficiently supported in DatalogFS and a powerful DatalogFS system is now being developed at UCLA.

SEARCHING A POLYGONAL REGION FROM THE BOUNDARY

Polygon search is the problem of finding mobile intruders who move unpredictably in a polygonal region, using one or more mobile searchers. Different levels of vision are assumed to model the ability of the searchers. In this paper we mainly consider a special case of this problem, termed boundary search, in which a single searcher has to find the intruders from the boundary of the region. Our main result is that a single searcher whose vision is limited to the ray of a single flashlight is just as capable as a single searcher having a light bulb that gives 360° vision, that is, any polygon that can be searched by the latter from the boundary can also be searched by the former from the boundary. The proof of the equivalence uses another new result, termed Monotonic Extension Theorem, together with a two-dimensional diagram called the planar boundary visibility map that represents the status of the search as a function of time. We partially settle a long-standing conjecture on the equivalence of the abilities of two types of searchers, one having two flashlights and the other having full 360° vision, for the general (non-boundary) polygon search problem.