Emilia Oikarinen  Home/Search
Context Related
| tcs.hut.fi/~eoikarin/thesis03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.hut.fi/~eoikarin/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: To solve a problem in answer set programming (ASP), one constructs a logic program so that its answer sets correspond to the solutions of the problem and computes the answer sets of the program using a special purpose search engine. The encodings are not unique, i.e. several versions of a program can be used e.g. in optimizing the execution time or space. Since the solutions to the problem correspond to answer sets of the program, it is necessary to ensure that the different encodings yield the ... (Update)
Cited by: More
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
Active bibliography (related documents): More All
1.1: Verifying the Equivalence of Logic Programs in the.. - Oikarinen, Janhunen (2004) (Correct)
0.7: LPEQ and DLPEQ - Translators for Automated Equivalence.. - Janhunen, Oikarinen (2004) (Correct)
0.5: Translatability And Intranslatability Results For Certain.. - Janhunen (2003) (Correct)
Similar documents based on text: More All
0.5: On the Equivalence of Logic Programs - Oikarinen (2002) (Correct)
0.5: Capturing Parallel Circumscription with Disjunctive Logic.. - Janhunen, Oikarinen (2004) (Correct)
0.4: Testing the Equivalence of Logic Programs under Stable.. - Janhunen, Oikarinen (2002) (Correct)
BibTeX entry: (Update)
Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2003. http://citeseer.ist.psu.edu/article/oikarinen03testing.html More
@mastersthesis{ oikarinenmsc,
address = {Espoo, Finland},
author = {Emilia Oikarinen},
month = {September},
school = {Helsinki University of Technology, Department of Engineering Physics and Mathematics},
title = {Testing the Equivalence of Disjunctive Logic Programs},
year = {2003},
url = {citeseer.ist.psu.edu/article/oikarinen03testing.html} }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
759 Negation as failure (context) - Clark - 1978
374 Classical negation in logic programs and disjunctive databas.. - Gelfond, Lifschitz - 1991
270 Logic programs with classical negation (context) - Gelfond, Lifschitz - 1990
150 Computational Complexity (context) - Papadimitriou - 1994
133 Foundations of Logic Programming (context) - Lloyd - 1987
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1976
98 Extended stable semantics for normal and disjunctive logic p.. (context) - Przymusinski - 1990
90 Stable models and an alternative logic programming paradigm - Marek, nski - 1999
84 The KR system DLV: Progress report (context) - Eiter, Leone et al. - 1998
84 The complexity of logic-based abduction - Eiter, Gottlob - 1995
69 the computational cost of disjunctive logic programming: Pro.. - Eiter, Gottlob - 1995
68 Extending and implementing the stable model semantics - Simons, Niemel et al. - 2002
65 Answer set planning - Lifschitz - 1999
47 Using logic programs with stable model semantics to solve de.. - Heljanko - 1999
46 Logic programs with stable model semantics as a constraint p.. (context) - Niemel - 1999
33 Developing a declarative rule language for applications in p.. - Soininen, Niemel - 1999
31 Beyond NP: The QSAT phase transition - Gent, Walsh - 1999
27 Negation as failure in the head - Inoue, Sakama - 1998
26 ACM Transactions on Computational Logic (context) - Lifschitz, Pearce et al. - 2001
26 Unfolding partiality and disjunctions in stable model semant.. - Janhunen, Niemel et al. - 2003
19 Encodings for equilibrium logic and logic programs with nest.. (context) - Pearce, Tompits et al. - 2001
18 A characterization of the stable semantics by partial evalua.. - Brass, Dix - 1995
16 Reducing strong equivalence of logic programs to entailment .. (context) - Lin - 2002
15 Weight constraints as nested expressions - Ferraris, Lifschitz - 2003
14 Analysis of notions of diagnosis - Lucas - 1998
12 Strong equivalence made easy: Nested expressions and weight .. - Turner - 2003
9 the effect of default negation on the expressiveness of disj.. - Janhunen - 2001
8 DES: a challenge problem for non-monotonic reasoning systems (context) - Hietalahti, Massacci et al. - 2000
7 Characterizing diagnosis and systems (context) - de Kleer, Mackworth et al. - 1992
7 A polynomial translation of logic programs with nested expre.. - Pearce, Sarsakov et al. - 2002
6 Testing the equivalence of logic programs under stable model.. - Janhunen, Oikarinen - 2002
5 a tool for testing the equivalence of disjunctive logic prog.. (context) - Oikarinen, --- - 2003
5 a tool for testing the equivalence of logic programs (context) - Janhunen, --- - 2002
4 Annals of Mathematics in Artificial Intelligence (context) - Lifschitz, Tang et al. - 1999
3 Marek and Miroslaw Truszczy nski (context) - Viktor - 1991
3 Stable semantics for disjunctive logic programs (context) - Przymusinski - 1991
3 GnT 2 --- a tool for computing disjunctive stable models (context) - Janhunen - 2003
Documents on the same site (http://www.tcs.hut.fi/~eoikarin/):
On the Equivalence of Logic Programs - Oikarinen (2002) (Correct)
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