Compositionality of Normal Open Logic Programs

@article{Verbaeten1997CompositionalityON,
  title={Compositionality of Normal Open Logic Programs},
  author={Sofie Verbaeten and Marc Denecker and Danny De Schreye},
  journal={J. Log. Program.},
  year={1997},
  volume={42},
  pages={151-183}
}
  • Sofie Verbaeten, Marc Denecker, Danny De Schreye
  • Published in J. Log. Program. 1997
  • Mathematics, Computer Science
  • Compositionality of programs is an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly been studied for definite programs only. Here, we study compositionality in the context of normal open logic programming. This is a logic for knowledge representation in the context of uncertainty and incomplete knowledge on concepts and on problem domain, in which the compositionality issue turns up very naturally. The… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 13 CITATIONS

    Composing Complete and Partial Knowledge

    VIEW 9 EXCERPTS
    CITES BACKGROUND

    A Logic for Non-Monotone Inductive Definitions

    VIEW 1 EXCERPT
    CITES RESULTS

    On the Semantics of Logic Program Composition

    • Antonio Brogi
    • Computer Science
    • Program Development in Computational Logic
    • 2004
    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Modularity in answer set programs

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Combining Answer Sets of Nonmonotonic Logic Programs

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES