#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2008

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michael Bartholomew, Joohyung Lee, Yunsong Meng
- IJCAI
- 2011

We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to firstorder formulas containing aggregate expressions. In the… (More)

- Joohyung Lee, Yunsong Meng
- LPNMR
- 2009

Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designing aggregates, we provide reformulations of some existing semantics in terms of propositional formulas, which help us compare the semantics and… (More)

- Joohyung Lee, Yunsong Meng
- J. Artif. Intell. Res.
- 2011

Lin and Zhao’s theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the first-order case. We investigate the precise relationship between the first-order stable model semantics and first-order… (More)

- Gail-Joon Ahn, Hongxin Hu, Joohyung Lee, Yunsong Meng
- 2010 IEEE 34th Annual Computer Software and…
- 2010

The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effectively. However, we still suffer from unintended security leakages by unauthorized services while providing more convenient services to Internet users through such a cutting-edge… (More)

- Joohyung Lee, Yunsong Meng
- KR
- 2008

Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary first-order sentences. We show its relation to the idea of loop formulas with variables by Chen, Lin, Wang and Zhang, and generalize their loop formulas to disjunctive programs and to arbitrary… (More)

- Joohyung Lee, Yunsong Meng
- IJCAI
- 2013

Answer Set Programming Modulo Theories is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a… (More)

- Joohyung Lee, Yunsong Meng, Yi Wang
- ICLP
- 2015

We introduce the language LP that extends logic programs under the stable model semantics to allow weighted rules similar to the way Markov Logic considers weighted formulas. LP is a proper extension of the stable model semantics to enable probabilistic reasoning, providing a way to handle inconsistency in answer set programming. We also show that the… (More)

- Michael Bartholomew, Joohyung Lee, Yunsong Meng
- AAAI Spring Symposium: Logical Formalizations of…
- 2011

We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar… (More)

- Joohyung Lee, Yunsong Meng
- 2012

Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to incorporate aggregates and abstract constraint atoms, to facilitate interface with external information sources, such as ontology descriptions, and to integrate with other computing paradigms, such as constraint solving. This paper provides a… (More)

- Joohyung Lee, Yunsong Meng
- ICLP
- 2012

Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to allow aggregates or to facilitate interface with external ontology descriptions. We present a uniform, reductive view on these extensions by viewing them as special cases of formulas with generalized quantifiers. This is done by extending the… (More)