Analyzing Declarative Semantics of Logic Programs.
Dmitri Boulanger · 1997
Deductive databases and constraint systems have a transparent declarative semantics, which enables to read and to understand such programs ignoring their execution algorithms. An interactive toolkit, which is aimed at such "understanding", is presented. It enables generation of precise descriptions of the goal-relevant correct answers. Its ultimate goal is a problem-specific optimization, which can be derived from such descriptions. A flexible interface is used to specify required details of descriptions. The toolkit is reasonably efficient even if a fine-grained description is required. Key Words: logic programming, declarative semantics, static analysis 1 Introduction An approach to analyze logic-based software systems has been suggested in [1, 2, 3, 4]. It exploits the clean transparent declarative semantics of logic programming languages to provide a basis for verification and optimization of complex applications, such as constraint systems and deductive database queries. Recent...