#### Filter Results:

- Full text PDF available (62)

#### Publication Year

2000

2017

- This year (3)
- Last 5 years (40)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Yuliya Lierler, Marco Maratea
- LPNMR
- 2004

Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program’s completion [4]. The converse is true when the logic program is “tight” [6, 5]. Lin and Zhao [7] showed that for non-tight programs the… (More)

- Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
- Journal of Automated Reasoning
- 2006

Answer set programming (ASP) emerged in the late 1990s as a new logic programming paradigm that has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced. All these reductions, however, are limited… (More)

- Yuliya Lierler
- Answer Set Programming
- 2005

Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondisjunctive programs. This paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two… (More)

- Yuliya Lierler, Vladimir Lifschitz
- ICLP
- 2009

When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiation precise for the case of disjunctive programs with function symbols, and introduced the class of “finitely ground” programs that can be efficiently instantiated. Since that… (More)

- Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
- AAAI
- 2004

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical… (More)

- Yuliya Lierler
- ICLP
- 2008

Answer Set Solvers Yuliya Lierler University of Texas at Austin yuliya@cs.utexas.edu Abstract Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs:… (More)

- Yuliya Lierler
- LPNMR
- 2005

Disjunctive logic programming under the stable model semantics [GL91] is a new methodology called answer set programming (ASP) for solving combinatorial search problems. This programming method uses answer set solvers, such as DLV [Lea05], GNT [Jea05], SMODELS [SS05], ASSAT [LZ02], CMODELS [Lie05a]. Systems DLV and GNT are more general as they work with the… (More)

- Yuliya Lierler
- TPLP
- 2011

Answer Set Solvers with Backjumping and Learning

- Martin Gebser, Joohyung Lee, Yuliya Lierler
- TPLP
- 2011

Using the notion of an elementary loop, Gebser and Schaub refined the theorem on loop formulas due to Lin and Zhao by considering loop formulas of elementary loops only. In this article, we reformulate their definition of an elementary loop, extend it to disjunctive programs, and study several properties of elementary loops, including how maximal elementary… (More)

- Yuliya Lierler, Esra Erdem, Vladimir Lifschitz
- ArXiv
- 2000

We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by… (More)