WEAKEST PRECONDITIONS FOR PURE PROLOG PROGRAMS

Citation
D. Pedreschi et S. Ruggieri, WEAKEST PRECONDITIONS FOR PURE PROLOG PROGRAMS, Information processing letters, 67(3), 1998, pp. 145-150
Citations number
13
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
ISSN journal
00200190
Volume
67
Issue
3
Year of publication
1998
Pages
145 - 150
Database
ISI
SICI code
0020-0190(1998)67:3<145:WPFPPP>2.0.ZU;2-1
Abstract
We introduce a characterization of weakest preconditions and weakest l iberal preconditions of pure Prolog programs P and postconditions Post in terms of ordinal closures of a natural operator based on P and Pos t. (C) 1998 Elsevier Science B.V. All rights reserved.