M. A. Orgun and W. W. Wadge. A formal treatment of non-deterministic dataflow streams in intensional logic programming. In Proceedings of the 1989 International Symposium on Lucid and Intensional Programming, Arizona State University, May 8 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Chronolog Admits a Complete Proof Procedure - Orgun, Wadge (1993) (6 citations) Self-citation (Orgun Wadge) (Correct)
....next moment in time. The program says that the traffic light starts with a green light, then on rotates from green to amber, amber to red, red to green and so on. Applications of Chronolog and temporal logic programming in general include: mitigating frame problem [32] modelling non determinism [28], simulation [26] and temporal deductive databases [29] In the following, we first outline the underlying temporal logic of Chronolog(Z) and its formal properties. Section 3 introduces the proof procedure of the language called TiSLDresolution, which is based on the axioms and rules of inference ....
M. A. Orgun and W. W. Wadge. A formal treatment of non-deterministic dataflow streams in intensional logic programming. In Proceedings of the 1989 International Symposium on Lucid and Intensional Programming, Arizona State University, May 8 1989.
Extending Temporal Logic Programming with Choice Predicates.. - Orgun, WADGE (1994) (3 citations) Self-citation (Orgun Wadge) (Correct)
....problem specification requires us to produce exactly one stream, chosen arbitrarily amongst all possible ones. We also believe that the way the language is implemented should be irrelevant in explaining the behavior of a given logic program. Therefore we propose choice predicates non determinism [30, 44] as a solution to the problem for TLP. 1.2 Choice Predicates Choice predicates are not defined by users in temporal logic programs, but they are supplied by implementations for each predicate used in a given program. The connection between choice predicates and the corresponding predicates is ....
....we do not develop the program any further. In summary, choice predicates allow for non deterministic dataflow computations within a logic programming formalism. When the connection between each predicate and the corresponding choice predicate is established by non Horn axioms (choice formulas [30]) we obtain non Horn temporal logic programs as a result. Moreover, a first order logic with equality is required to establish the connection. Therefore the meaning of a temporal logic program with choice predicates can not be characterized by the minimum (temporal) model semantics. As an ....
M. A. Orgun and W. W. Wadge. A formal treatment of non-deterministic dataflow streams in intensional logic programming. In Proceedings of the 1989 International Symposium on Lucid and Intensional Programming, Arizona State University, May 8 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC