In this paper we introduce the logic programming language Disjunctive Chronology which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of ex pressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.
In this paper we introduce the logic programming language Disjunctive Chronology which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of ex pressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.
In this paper we introduce the logic programming language Disjunctive Chronology which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of ex pressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.