The loop formula based semantics of description logic programs

Yi-song, Wang; You, Jia-Huai; Li, Yuan; Shen, Yi-Dong; Zhang, Mingyi

doi:10.1016/j.tcs.2011.10.026

Cited by 6 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The notions of unfounded sets and well-founded models of dl-programs are referred to (Eiter et al 2011). In terms of the translation τ in (Wang et al 2012), dl-programs can be modeled as basic logic programs.…”

Section: Description Logic Programsmentioning

confidence: 99%

“…In this paper we consider logic programs with abstract constraint atoms. These programs are general enough to account for the semantics of aggregate logic programs as well as description logic programs, as aggregate atoms in the former and dl-atoms in the latter can be modeled naturally in terms of abstract constraint atoms (Son, Pontelli, and Tu 2007;Wang et al 2012).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms

Wang

Lin

Zhang

et al. 2021

AAAI

Self Cite

View full text Add to dashboard Cite

Logic programs with abstract constraint atoms proposed by Marek and Truszczynski are very general logic programs.They are general enough to captureaggregate logic programs as well asrecently proposed description logic programs.In this paper, we propose a well-founded semantics for basic logic programs with arbitrary abstract constraint atoms, which are sets of rules whose heads have exactly one atom. Weshow that similar to the well-founded semanticsof normal logic programs, it has many desirable properties such as that it can becomputed in polynomial time, and is always correct with respect to theanswer set semantics. This paves the way for using our well-founded semanticsto simplify these logic programs. We also show how our semantics can be applied toaggregate logic programs and description logic programs, and compare itto the well-founded semantics already proposed for these logic programs.

show abstract

Section: Description Logic Programsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms

Wang

Lin

Zhang

et al. 2021

AAAI

Self Cite

View full text Add to dashboard Cite

show abstract

“…Quite in the spirit of our notion of computation is that of Liu et al [20] introduced for characterising the answer sets of logic programs with arbitrary abstract constraints as a sequence of evolving interpretations. As DL-programs can be seen as abstract constraint programs [21], the framework of Liu et al [20] is, in turn, relevant for our work. Besides differences in the semantics, our notion of computations explicitly takes the rules that are active in some state into account since our motivation is debugging and program analysis.…”

Section: Related Workmentioning

confidence: 99%

Stepwise Debugging of Description-Logic Programs

2012

View full text Add to dashboard Cite

Abstract. Description-logic programs (or DL-programs for short) combine logic programs under the answer-set semantics with description logics for semanticweb reasoning. In order for a wider acceptance of the formalism among semanticweb engineers, it is vital to have adequate tools supporting the program development process. In particular, methods for debugging DL-programs are needed. In this paper, we introduce a framework for interactive stepping through a DLprogram as a means for debugging which builds on recent results on stepping for standard answer-set programs. To this end, we provide a computation model for DL-programs using states based on the rules that a user considers as active in the program and the resulting intermediate interpretation. During the course of stepping, the interpretations of the subsequent states evolve towards an answer set of the overall program. Compared to the case of standard answer-set programs, we need more involved notions of states and computations in the presence of DL-atoms. In particular, if non-convex DL-atoms are involved, we have to allow for non-stable computations. Intuitively speaking, we realise this by allowing the user to assume the truth of propositional atoms which must be justified in subsequent states. To keep track of these additional atoms, we extend the well-known notion of an unfounded set for DL-programs.

show abstract