A unifying view for logic programming with non-monotonic reasoning

Brogi, Antonio; Lamma, Evelina; Mancarella, Paolo; Mello, Paola

doi:10.1016/s0304-3975(97)80755-4

Cited by 15 publications

(24 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As pointed out in [9], the above notion of supportedness properly extends the notion of admissibility introduced in Section 3.4. Namely the admissible models of a program are in general a subset of its supported interpretations, that is, AM (P ) ⊆ SI(P, B).…”

Section: Supported Interpretationsmentioning

confidence: 74%

“…In terms of program equivalence, this means that the supported interpretations semantics preserves all the semantics which have been considered in [9]. Indeed for any such semantics S:…”

Section: Supported Interpretations For Normal Programsmentioning

confidence: 99%

“…We finally introduce an alternative characterization of logical equivalence, which is defined by means of the notion of supported interpretation originally introduced in [9]. Besides providing another equivalent formulation of logical equivalence, the notion of supported interpretation will be exploited in the following sections to define a compositional semantics for extended logic programs, such as programs containing negation.…”

Section: Supported Interpretationsmentioning

confidence: 99%

“…Therefore it is not possible, in general, to determine the stable models of a program from the stable models of its clauses. ♦ A unifying view of different extensions of logic programming was presented in [9], where it is shown how the meaning of various extensions of logic programming can be expressed by means of the supported interpretations of a program. Many extensions are considered in [9], including negation-by-default, other forms of negation and abduction.…”

Section: Composition Of Normal Programsmentioning

confidence: 99%

“…As shown in [9], the set of supported interpretations can be suitably restricted in a step-wise way so as to identify the set of complete models of a program. Such a step-wise process can be summarised as follows: not a ∈ H ⇐⇒ (a ∈ J for each conservative extension J(K) of I(H)) .…”

Section: Supported Interpretations For Normal Programsmentioning

confidence: 99%

See 4 more Smart Citations

On the Semantics of Logic Program Composition

Brogi

2004

Program Development in Computational Logic

Self Cite

View full text Add to dashboard Cite

Abstract. This paper aims at offering an insightful synthesis of different compositional semantics for logic program composition which have been developed in the literature. In particular, we will analyse the notions of program equivalence, compositionality, and full abstraction for logic programs. We will show how the notion of supported interpretation provides a unifying compositional model-theoretic characterisation both of positive programs and of programs containing negation.

show abstract

Section: Supported Interpretationsmentioning

confidence: 74%

“…In terms of program equivalence, this means that the supported interpretations semantics preserves all the semantics which have been considered in [9]. Indeed for any such semantics S:…”

Section: Supported Interpretations For Normal Programsmentioning

confidence: 99%

Section: Supported Interpretationsmentioning

confidence: 99%

Section: Composition Of Normal Programsmentioning

confidence: 99%

Section: Supported Interpretations For Normal Programsmentioning

confidence: 99%

See 3 more Smart Citations

On the Semantics of Logic Program Composition

Brogi

2004

Program Development in Computational Logic

Self Cite

View full text Add to dashboard Cite

show abstract

Combining Answer Sets of Nonmonotonic Logic Programs

Sakama

Inoue

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. Given two programs P1 and P2, which have the sets of answer sets AS(P1) and AS(P2), respectively; find a program Q which has answer sets as minimal sets S ∪ T for S from AS(P1) and T from AS(P2). The program Q combines answer sets of P1 and P2, and provides a compositional semantics of two programs. Such program composition has application to coordinating knowledge bases in multi-agent environments. We provide methods for computing program composition and discuss their properties.

show abstract

An Implementation for Abductive Logic Agents

Ciampolini

Lamma

Mello

et al. 2000

AI*IA 99: Advances in Artificial Intelligence

View full text Add to dashboard Cite

Abstract. This paper presents the distributed implementation of ALIAS, an architecture composed of several cooperating intelligent agents. This system is particularly suited to solve problems in cases where knowledge about the problem domain is incomplete and agents may need to form reasonable hypotheses. In ALIAS agents are equipped with hypothetical reasoning capabilities, performed by means of abduction: if the knowledge available to a logic agent is insu cient to solve a query, the agent could abduce new hypotheses. Each agent is characterized by a local knowledge base represented by an abductive logic program. Agents might di er in their knowledge bases, but must agree on assumed hypotheses. That global knowledge base is dynamically created and managed by means of a shared tuple space. The prototype, developed using Java and Prolog, can run on a TCP IP network of computers. In the paper, we also discuss some experimental results to evaluate prototype e ciency.

show abstract

A unifying view for logic programming with non-monotonic reasoning

Cited by 15 publications

References 34 publications

On the Semantics of Logic Program Composition

On the Semantics of Logic Program Composition

Combining Answer Sets of Nonmonotonic Logic Programs

An Implementation for Abductive Logic Agents

Contact Info

Product

Resources

About