#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (15)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Fangzhen Lin, Yisong Wang
- KR
- 2008

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)

- Yin Chen, Fangzhen Lin, Yisong Wang, Mingyi Zhang
- KR
- 2006

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)

- Yisong Wang, Yan Zhang, Yi Zhou, Mingyi Zhang
- KR
- 2012

In this paper, we propose a semantic forgetting for arbitrary logic programs (or propositional theories) under answer set semantics, called HT-forgetting. The HTforgetting 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 is… (More)

- Yisong Wang, Kewen Wang, Mingyi Zhang
- IJCAI
- 2013

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)

- Yisong Wang, Yan Zhang, Yi Zhou, Mingyi Zhang
- J. Artif. Intell. Res.
- 2014

The ability of discarding or hiding irrelevant information has been recognized as an important feature for knowledge based systems, including answer set programming. The notion of strong equivalence in answer set programming plays an important role for different problems as it gives rise to a substitution principle and amounts to knowledge equivalence of… (More)

- Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen
- TPLP
- 2010

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)

- Yisong Wang, Zhiqiang Zhuang, Kewen Wang
- LPNMR
- 2013

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)

- Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen, Mingyi Zhang
- Theor. Comput. Sci.
- 2012

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)

- Yisong Wang, Jia-Huai You, Li-Yan Yuan, Mingyi Zhang
- LPNMR
- 2009

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)

- Yisong Wang, Jia-Huai You, Fangzhen Lin, Li-Yan Yuan, Mingyi Zhang
- Annals of Mathematics and Artificial Intelligence
- 2010

In the current practice of Answer Set Programming (ASP), evaluable functions are represented as special kinds of relations. This often makes the resulting program unnecessarily large when instantiated over a large domain. The extra constraints needed to enforce the relation as a function also make the logic program less transparent. In this paper, we… (More)