Skip Navigation

Journal of Logic and Computation 1994 4(6):877-903; doi:10.1093/logcom/4.6.877
© 1994 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by ORGUN, M. A.
Right arrow Articles by WADGE, W. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Extending Temporal Logic Programming with Choice Predicates Non-determinism

MEHMET A. ORGUN1 and WILLIAM W. WADGE2

1Department of Computing, Macquarie University Sydeny, N.S.W. 2109, Australia E-mail:mehmet{at}mpce.mq.edu.au
2Department of Computer Science, University of Victoria Victoria, B.C. V8W 3P6, Canada E-mail:wwadge{at}csr.uvic.ca

In temporal logic programming, a stream can be specified by a single-valued, time-varying predicate which, at any given moment in time, represents the corresponding element in the stream. However, due to inherent non-determinism in logic programming, time-varying predicates do not necessarily represent single-valued relations at any given moment in time. Choice predicates are also time-varying predicates, but, in principle, they act like a dataflow node with multiple input lines which non-deterministically selects one of its inputs as output. Thus they are guaranteed to be single-valued at all moments in time, and they can be regarded as representing ‘non-deterministic’ streams. Users do not define choice predicates, they are supplied automatically for all predicates defined in temporal logic programs. Inputs to choice predicates are supplied by the corresponding predicates. When the connection between choice predicates and the corresponding predicates is established, we obtain non-Horn temporal logic programs as a result. The model-theoretic semantics of such a program is developed in terms of ‘minimal models’. However, the logical structure of the program dictates which minimal models are constructible from the program. We in particular discuss a characterization of constructible minimal models as limits of alternating chains of models obtained by applications of two new mappings NTP and CP. The paper also outlines a proof procedure for the temporal language Chronolog extended with choice predicates.

Keywords: Logic programming; temporal logic; non-determinism; minimal models; alternating chains; proof procedures


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Neural Comput.Home page
A. S. d. Garcez and L. C. Lamb
A Connectionist Computational Model for Epistemic and Temporal Reasoning
Neural Comput., July 1, 2006; 18(7): 1711 - 1738.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.