David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, and Stefan Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Peter J. Stuckey, editor, Proceedings of the 18th International Conference on Logic Programming, pages 405--420, Copenhagen, Denmark, July--August 2002. Springer-Verlag. LNCS 2401. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Equivalence between Answer Sets and Models of.. - Logic Programs Jia-Huai (Correct)
....the idea of level mapping. Transformations of Nested Programs The transformation given in [Lifschitz et al. 1999] deals with arbitrary nested programs where rules may have arbitrary formulas in the heads. The transformation preserves strong equivalence but is not polynomial. Independently in [Pearce et al. 2002] , arbitrary nested programs are translated to disjunctive programs where extra variables are used to avoid an exponential blow up, an idea similar to the one adopted in this paper. Our transformation however departs from that of [Lifschitz et al. 1999] in a minimal way. By partitioning the ....
....from that of [Lifschitz et al. 1999] in a minimal way. By partitioning the transformation into three stages (cf. Theorem 4.8) we are able to identify exactly where extra variables are required. This is only when dealing with a disjunction or an expression like not not L where L is a literal. In [Pearce et al. 2002] , other forms of subformulas, such as the whole body of a rule and a conjunction, can also be labeled by extra variables. Our transformation is thus simpler and more compact. While our transformation takes linear time, the one in [Pearce et al. 2002] is only claimed to be polynomial time. ....
[Article contains additional citation context not shown here]
D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, and S. Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs (preliminary report). In Proc. 19th ICLP, 2002.
The DLV System for Knowledge Representation . . . - Leone, Pfeifer, al. (2002) (Correct)
....It is called nlp and transforms logic programs with nested expressions to Answer Set Programs. DLV is then used as the kernel to compute answer sets, which are post processed to yield the answer sets of the original program with nested expressions. A description of this front end can be found in [83] and on its web page http: www.cs.uni potsdam. de torsten nlp , from which it can be downloaded. 6 The Implementation of the DLV System: An Overview The high expressiveness of the DLV language together with the ambition to deal efficiently also with simpler problems on larger problem instances, ....
D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, and S. Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002.
nlp: A Compiler for Nested Logic Programming - Vladimir Sarsakov Torsten Self-citation (Sarsakov Schaub Tompits Woltran) (Correct)
No context found.
D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, S. Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs. In Proc. ICLP-02, pages 405--420. Springer, 2002.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
No context found.
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, and Stefan Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Peter J. Stuckey, editor, Proceedings of the 18th International Conference on Logic Programming, pages 405--420, Copenhagen, Denmark, July--August 2002. Springer-Verlag. LNCS 2401.
Verifying the Equivalence of Logic Programs in the.. - Oikarinen, Janhunen (2004) (Correct)
No context found.
D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, and S. Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Proc. of the 18th International Conference on Logic Programming, pages 405420, Copenhagen, Denmark, JulyAugust 2002. Springer.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
No context found.
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, and Stefan Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Peter J. Stuckey, editor, Proceedings of the 18th International Conference on Logic Programming, pages 405--420, Copenhagen, Denmark, July-- August 2002. Springer-Verlag. LNCS 2401.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
No context found.
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, and Stefan Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Peter J. Stuckey, editor, Proceedings of the 18th International Conference on Logic Programming, pages 405--420, Copenhagen, Denmark, July--August 2002. Springer-Verlag. LNCS 2401.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC