Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still...