A compositional semantics for logic programs

Bossi, Annalisa; Gabbrielli, Maurizio; Levi, Giorgio; Meo, Maria Chiara

doi:10.1016/0304-3975(94)90200-3

Cited by 49 publications

(43 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A possible improvement, as far as logic programs are concerned, is to consider open b-formulas, as e.g. in [1], to capture more general kinds of modes and compositions, including open answers.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Constructive Specifications for Compositional Units

Lau

Momigliano

Ornaghi

2005

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. In previous work, we have introduced a model-theoretic semantics for compositional units, i.e. reusable units that can be used for compositional program development. Such units contain open (logic) programs and our modeltheoretic semantics characterizes their correctness and the correctness of their composition. However, for real-world software development, compositional units should be inter-operable, i.e. they should accept programs in different languages. To cater for this, our model-theoretic semantics needs to be used in conjunction with suitable semantics for behaviours and interfaces. In this paper we describe one possible approach based on constructive specifications.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Thus we define observation sequences and their components as follows (components underline backtracking). If prod observes the call statement sum(P, X, Z) in the computation of prod(s(0), s(s(0)), 0), it obtains the following sequence S with components S [1], S [2]:…”

Section: Behaviours and Program Compositionmentioning

confidence: 99%

Constructive Specifications for Compositional Units

Lau

Momigliano

Ornaghi

2005

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…Because any class implementing a method m also contributes to the de nition of the predicate symbol m.ret, its de nition is kept open until all the program is analysed. 4]). An o p en datalog program P Ω is a (datalog) p r ogram P together with a subset Ω of its predicate symbols (Ω ⊆ P red(P )).…”

Section: Modular Resolutionmentioning

confidence: 99%

“…To cope with open datalog programs, following Bossi et al 4], we model incomplete knowledge by adjoining tautologic clauses.…”

Section: Unfolding and Minimizationmentioning

confidence: 99%

Modular Class Analysis with DATALOG

Besson¹,

Jensen²

2003

Static Analysis

View full text Add to dashboard Cite

datalog can be used to specify a variety of class analyses for object-oriented programs as variations of a common framework. In this framework, the result of analyzing a class is a set of datalog clauses whose least xpoint is the information analysed for. Modular class analysis of program fragments is then expressed as the resolution of open datalog programs. We provide a theory for the partial resolution of sets of open clauses and de ne a number of operators for reducing such open clauses.

show abstract

“…Each module is an interactive reasoning subsystem that is used for the (often partial) definition of its exported predicates. Each module contains a set of rules viewed as an open logic theory [1] with a set of input literals. A module represents an incomplete specification of some domain because its input literals are defined in other modules.…”

Section: Introductionmentioning

confidence: 99%

Declarative semantics for contradictory modular logic programs

Analyti

Pramanik

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order < def on the predicate definitions (M, p), where M is a module and p is a predicate exported by M. Because of the classical negation, conflicts may arise within and among modules. The partial order < def denotes the relative reliability of the predicate definitions contributing to the conflict. We present the reliable semantics for PMPs . The goal of the reliable semantics is to draw reliable conclusions from possibly contradictory PMPs.

show abstract

A compositional semantics for logic programs

Cited by 49 publications

References 11 publications

Constructive Specifications for Compositional Units

Constructive Specifications for Compositional Units

Modular Class Analysis with DATALOG

Declarative semantics for contradictory modular logic programs

Contact Info

Product

Resources

About