Set based logic programming

13 years 4 months ago

Download www.cs.uky.edu

In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets of a given space X. The view of a logic program as a one-step consequence operator along with the concepts of supported and stable model can be transferred to such situations. In this paper, we show that we can further extend this paradigm by creating a new one-step consequence operator by composing the old one step consequence operator with a monotonic idempotent operator (miop) in the space of all subsets of X, 2X . We call this extension set based logic programming. We show that such a set based formalism for logic programming naturally supports a variety of options. For example, if the underlying space has a topology, one can insist that the new one-step consequence operator always produces a closed set or always produces an open set. The flexibility inherent in the semantics of set based logic programs is...

Howard A. Blair, Victor W. Marek, Jeffrey B. Remme

Real-time Traffic