Computer Science – Logic in Computer Science
Scientific paper
2001-05-10
Computer Science
Logic in Computer Science
17 pages. Welcome any comments to kexu@nlsde.buaa.edu.cn
Scientific paper
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is proposed by extending first order theories using Cauchy sequences, which has stronger expressive power than the first order logic. A class of fixed points characterizing the logical properties of the limits can be represented by means of infinite-length terms defined by Cauchy sequences. We will show that the limit of sequence of first order theories can be defined in terms of distance, similar to the $\epsilon-N$ style definition of limits in real analysis. On the basis of infinitary terms, a computation model for convergent infinite computations is proposed. Finally, the interpretations of logic programs are extended by introducing real Herbrand models of logic programs and a sufficient condition for computing a real Herbrand model of Horn logic programs using convergent infinite computation is given.
Li Wangrong
Ma Shilong
Sui Yuefei
Xu Ke
No associations
LandOfFree
A Logical Framework for Convergent Infinite Computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Logical Framework for Convergent Infinite Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Logical Framework for Convergent Infinite Computations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-244721