MODULARITY AND CORRECTNESS FOR LOGIC PROGRAMS AND KNOWLEDGE BASES

Autor(en): ANTONIOU, G
Stichwörter: Computer Science; Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Engineering; Engineering, Electrical & Electronic; KNOWLEDGE BASES; LOGIC PROGRAMMING; MODULES; REUSE; VERIFICATION
Erscheinungsdatum: 1994
Herausgeber: WORLD SCIENTIFIC PUBL CO PTE LTD
Journal: INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING
Volumen: 4
Ausgabe: 2
Startseite: 257
Seitenende: 275
Zusammenfassung: 
A modularity concept for structuring and developing large logic programs and logical knowledge bases is presented. The concept is motivated from work in the field of algebraic specification, and enforces an extreme modularity discipline that goes beyond the one found in imperative or logic programming languages. As concrete programming languages (respectively knowledge representation formalisms), we consider Horn logic and equational logic programming. We give formal semantics for single modules and discuss correctness and verification issues. Large systems are constructed as interconnections of single modules. We introduce the so-called module operations of composition, actualization, and union, and give results concerning compositionality of semantics and correctness preservation.
ISSN: 02181940
DOI: 10.1142/S0218194094000131

Show full item record

Google ScholarTM

Check

Altmetric