#### Filter Results:

#### Publication Year

2004

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

To compute a function such as a mapping from vertices to colors in the graph coloring problem, current practice in Answer Set Programming is to represent the function as a relation. Among other things, this often makes the resulting program unnecessarily large when instantiated on a large domain. The extra constraints needed to enforce the relation as a… (More)

In this paper we extend Lin and Zhao's notions of loops and loop formulas to normal logic programs that may contain variables. Under our definition, a loop formula of such a logic program is a first-order sentence. We show that together with Clark's completion, our notion of first-order loop formulas captures the answer set semantics on the… (More)

In this paper, we propose a semantic forgetting for arbitrary logic programs (or propositional theories) under answer set semantics, called HT-forgetting. The HT-forgetting preserves strong equivalence in the sense that strongly equivalent logic programs will remain strongly equivalent after forgetting the same set of atoms. The result of an HT-forgetting… (More)

- Juan Wang, Yanlei Chen, Na Gao, Yisong Wang, Yanping Tian, Jiangman Wu +4 others
- PloS one
- 2013

The pathogenesis of dengue virus (DV) infection has not been completely defined and change of redox status mediated by depletion of glutathione (GSH) in host cell is a common result of viral infection. Our previous study has demonstrated that DV serotype 2 (DV2) infection alters host intracellular GSH levels, and exogenous GSH inhibits viral production by… (More)

Brewka and Eiter's nonmonotonic multi-context systems is an elegant knowledge representation framework to model heterogeneous and nonmonotonic multiple contexts. Belief change is a central problem in knowledge representation and reasoning. In the paper we follow the classical AGM approach to investigate belief change in multi-context systems. Specifically,… (More)

In this paper we consider a new class of logic programs, called weight constraint programs with functions, which are lparse programs incorporating functions over non-Herbrand domains. We define answer sets for these programs and develop a computational mechanism based on loop completion. We present our results in two stages. First, we formulate loop… (More)

Description logic programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a… (More)

Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a… (More)

A new semantic forgetting for answer set programs (ASP), called SM-forgetting, is proposed in the paper. It distinguishes itself from the others in that it preserves not only skeptical and credulous consequences on unforgotten variables, but also strong equivalence – forgetting same variables in strongly equivalent logic programs has strongly equivalent… (More)