SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

The Journal of Logic Programming

Volumn 15, Issue 1-2, 1993, Pages 79-97

Strong termination of logic programs

(1) Bezem, Marc a

a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002882910 PISSN: 07431066 EISSN: None Source Type: Journal
DOI: 10.1016/0743-1066(93)90014-8 Document Type: Article

Times cited : (49)

References (22)

1
- 0001975827
- Logic Programming
- J. van Leeuwen, North-Holland, Amsterdam
- (1990) Handbook of theoretical computer science , pp. 493-574
- Apt¹

2
- 0040717657
- Studies in pure Prolog: termination
- J.W. Lloyd, Springer-Verlag, Berlin
- (1990) Symposium on computational logic , pp. 150-176
- Apt¹ Pedreschi²

3
- 0013165294
- Acyclic programs
- (1991) New Generation Comput. , vol.9 , pp. 335-363
- Apt¹ Bezem²

4
- 85027663554
- Proving termination of general Prolog programs
- T. Ito, A. Meyer, Springer-Verlag, Berlin
- (1991) Proceedings of the international conference on theoretical aspects of computer software , pp. 265-289
- Apt¹ Pedreschi²

5
- 0040123795
- Characterizing termination of logic programs with level mappings
- E.L. Lusk, R.A. Overbeek, MIT Press
- (1989) Proceedings of the North American conference on logic programming , pp. 69-80
- Bezem¹

6
- 0004704991
- Proving termination of logic programs by exploiting term properties
- S. Abramsky, T.S.E. Maibaum, Springer-Verlag, Berlin
- (1991) Proceedings of CCPSD-TAPSOFT 91 , pp. 153-180
- Bossi¹ Cocco² Fabris³

7
- 84909738188
- Decidability in the Herbrand base
- Washington, D.C.
- (1986) Manuscript presented at the Workshop on foundations of deductive databases and logic programming
- Blair¹

8
- 0026204235
- Acyclic logic programs and the completeness of SLDNF-resolution
- (1991) Theoretical Comput. Sci. , vol.86 , pp. 81-92
- Cavedon¹

9
- 0000826543
- Negation as failure
- H. Gallaire, J. Minker, Plenum Press, New York
- (1978) Logic and data bases , pp. 293-322
- Clark¹

10
- 0010143929
- A note on universal Turing machines
- J. McCarthy, C.J. Shannon, Princeton University Press, Princeton
- (1956) Automata studies , pp. 167-175
- Davis¹

11
- 84910829499
- Termination of rewriting
- (1987) Journal of Symbolic Computation , vol.3 , pp. 69-116
- Dershowitz¹

12
- 0001653160
- A framework for analysing the termination of definite logic programs with respect to call patterns
- to appear, Tokyo, Japan
- (1992) Proceedings of the international conference on fifth generation computer systems
- de Schreye¹ Verschaetse² Bruynooghe³

13
- 0003453263
- 2nd Ed., Springer-Verlag, Berlin
- (1987) Foundations of Logic Programming
- Lloyd¹

14
- 0001659384
- Partial evaluation in logic programming
- (1991) J. Logic Programming , vol.11 , pp. 217-242
- Lloyd¹ Shepherdson²

15
- 84911267349
- Automatic generation of control for logic programs
- Department of Computer Science, University of Melbourne, Australia
- (1983) Technical Report TR83/6
- Naish¹

16
- 0040029222
- Springer-Verlag, Berlin
- (1990) Termination proofs for logic programs
- Plümer¹

17
- 0001637995
- Computability of recursive functions
- (1963) Journal of the ACM , vol.10 , pp. 217-255
- Shepherdson¹ Sturgis²

18
- 0001248502
- Machine configuration and word problems of given degree of unsolvability
- (1965) Zeitschrift für Mathematische Logik und Grundlagen der Mathematik , vol.11 , pp. 149-175
- Shepherdson¹

19
- 3042914983
- unpublished manuscript
- (1985) Undecidability of Horn clause logic and pure Prolog
- Shepherdson¹

20
- 0004031733
- Addison-Wesley, Reading, Mass
- (1967) Mathematical Logic
- Shoenfield¹

21
- 0023994541
- Efficient tests for top-down termination of logical rules
- (1988) J. ACM , vol.35 , pp. 345-373
- Ullman¹ van Gelder²

22
- 0026263363
- Deriving termination proofs for logic programs using abstract procedures
- K. Furukawa, MIT Press, Paris, France
- (1991) Proceedings of the international conference on logic programming , pp. 301-315
- Verschaetse¹ de Schreye²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.