Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues in representing knowledge with logic On the one hand, evolving knowledge in logic programming can be modelled through suitable operators for the dynamic composition of separate programs On the other hand, when dealing with dynamic compositions of logic programs, the open world assumption adequately models the aspects of incompleteness of knowledge We analyse the notion of open program along with suitable operators for composing and closing programs We present the semantics of open programs and of the associated operators in two different, equivalent styles We define a model-theoretic semantics in terms of Herbrand models, while an operational...
AbstractAbstract interpretation is a systematic methodology to design static program analysis which ...
The program composition approach can be fruitfully applied to combine general logic programs, i.e. l...
AbstractGiven a program P we specify an enlargement of its well-founded model which gives meaning to...
Compositionality of programs is an important concern in knowledge representation and software develo...
AbstractCompositionality of programs is an important concern in knowledge representation and softwar...
AbstractThis paper considers open logic programs originally as a tool to build an OR-compositional s...
In this paper we investigate updates of knowledge bases represented by logic programs. In order to r...
In this paper we investigate updates of knowledge bases represented by logic programs. In order to r...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
AbstractClark's program completion offers an intuitive first-order semantics for logic programs. Unf...
The program composition approach can be fruitfully applied to combine general logic programs, i.e. l...
AbstractIn this paper we investigate updates of knowledge bases represented by logic programs. In or...
In this paper we propose a semantics for first order modular (open) programs. Modular programs are b...
The open logic is defined by model theory which can be viewed as a process-based nonmonotonic logic....
AbstractWe first introduce a general semantic scheme for logic programs which provides a uniform fra...
AbstractAbstract interpretation is a systematic methodology to design static program analysis which ...
The program composition approach can be fruitfully applied to combine general logic programs, i.e. l...
AbstractGiven a program P we specify an enlargement of its well-founded model which gives meaning to...
Compositionality of programs is an important concern in knowledge representation and software develo...
AbstractCompositionality of programs is an important concern in knowledge representation and softwar...
AbstractThis paper considers open logic programs originally as a tool to build an OR-compositional s...
In this paper we investigate updates of knowledge bases represented by logic programs. In order to r...
In this paper we investigate updates of knowledge bases represented by logic programs. In order to r...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
AbstractClark's program completion offers an intuitive first-order semantics for logic programs. Unf...
The program composition approach can be fruitfully applied to combine general logic programs, i.e. l...
AbstractIn this paper we investigate updates of knowledge bases represented by logic programs. In or...
In this paper we propose a semantics for first order modular (open) programs. Modular programs are b...
The open logic is defined by model theory which can be viewed as a process-based nonmonotonic logic....
AbstractWe first introduce a general semantic scheme for logic programs which provides a uniform fra...
AbstractAbstract interpretation is a systematic methodology to design static program analysis which ...
The program composition approach can be fruitfully applied to combine general logic programs, i.e. l...
AbstractGiven a program P we specify an enlargement of its well-founded model which gives meaning to...