Thomas Eiter, Michael Fink, Hans Tompits, et al.  Home/Search
Context Related
| kr.tuwien.ac.at/staff/...lpnmr7b.ps.gz 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: kr.tuwien.ac.at/staff/eiter/et... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Both notions have recently been considered for nonmonotonic logic programs (the latter dates back to the 1980s, though) and provide semantic foundations for optimizing programs with input. Extending previous work, we investigate syntactic and semantic rules for program transformation, based on proper notions... (Update)
Cited by: More
Eliminating Disjunction from Propositional Logic.. - Eiter, Fink, Tompits, .. (2003) (Correct)
On Eliminating Disjunctions in Stable Logic Programming - Eiter (2003) (Correct)
Uniform Equivalence of Logic Programs under the Stable Model.. - Eiter, Fink (2003) (Correct)
Active bibliography (related documents): More All
0.5: Verifying the Equivalence of Logic Programs in the.. - Oikarinen, Janhunen (2004) (Correct)
0.4: Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
0.4: Strong Equivalence of Nonmonotonic Theories - an Algebraic.. - Truszczynski (Correct)
Similar documents based on text: More All
0.3: Answer Set Programming: From Model . . . - Niemelä (Correct)
0.2: Towards Automated Integration of Guess and Check Programs in.. - Eiter, Polleres (2004) (Correct)
0.2: Towards Automated Integration of Guess and Check . . . - Eiter (2004) (Correct)
Related documents from co-citation: More All
3: Some types of equivalence for logic programs and equilibrium logic (context) - Pearce, Valverde - 2003
3: Strong equivalence made easy: nested expressions and weight constraints - Turner - 2003
3: Strong equivalence for logic programs and default theories - Turner - 2001
BibTeX entry: (Update)
T. Eiter, M. Fink, H. Tompits, and S. Woltran. Simplifying logic programs under uniform and strong equivalence. Manuscript, submitted, July 2003. http://citeseer.ist.psu.edu/eiter04simplifying.html More
@misc{ eiter03simplifying,
author = "T. Eiter and M. Fink and H. Tompits and S. Woltran",
title = "Simplifying logic programs under uniform and strong equivalence",
text = "T. Eiter, M. Fink, H. Tompits, and S. Woltran. Simplifying logic programs
under uniform and strong equivalence. Manuscript, submitted, July 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/eiter04simplifying.html" }
Citations (may not include all citations):374 Classical Negation in Logic Programs and Disjunctive Databas.. - Gelfond, Lifschitz - 1991
120 Stable Semantics for Disjunctive Programs - Przymusinski - 1991
68 Extending and Implementing the Stable Model Semantics - Simons, Niemela et al. - 2002
67 Foundations of Deductive Databases and Logic Programming (context) - Minker - 1988
64 Optimizing Datalog Programs (context) - Sagiv
61 Equivalences of Logic Programs (context) - Maher
53 ACM Transactions on Database Systems (context) - Eiter, Gottlob et al. - 1997
37 Propositional Semantics for Disjunctive Logic Programs (context) - Ben-Eliyahu, Dechter - 1994
36 Declarative Problem-Solving Using the DLV System (context) - Eiter, Faber et al. - 2000
26 ACM Transactions on Computational Logic (context) - Lifschitz, Pearce et al. - 2001
25 ASSAT: Computing Answer Sets of a Logic Program by SAT Solve.. (context) - Lin, Zhao - 2002
19 Encodings for Equilibrium Logic and Logic Programs with Nest.. (context) - Pearce, Tompits et al. - 2001
16 Logic Programs Based on Partial Evaluation (context) - Brass, Dix et al. - 1999
16 Reducing Strong Equivalence of Logic Programs to Entailment .. (context) - Lin - 2002
12 Strong Equivalence Made Easy: Nested Expressions and Weight .. - Turner - 2003
10 Strong Equivalence for Logic Programs and Default Theories - Turner - 2001
10 Characterizations of Strongly Equivalent Logic Programs in I.. - de Jongh, Hendriks - 2003
6 Testing the Equivalence of Logic Programs under Stable Model.. - Janhunen, Oikarinen - 2002
6 Uniform Equivalence of Logic Programs under the Stable Model.. - Eiter, Fink
4 Equivalence in Answer Set Programming - Osorio, Navarro et al. - 2001
4 Some Types of Equivalence for Logic Programs and Equilibrium.. (context) - Pearce, Valverde - 2003
2 Eliminating Disjunction from Propositional Logic Programs un.. - Eiter, Fink et al. - 2003
1 LPEQ and DLPEQ -- Translators for Automated Equivalence Test.. - Janhunen, Oikarinen
1 Comparisons and Computation of Well-founded Semantics for Di.. (context) - Wang, Zhou - 2003
Documents on the same site (http://www.kr.tuwien.ac.at/staff/eiter/et-archive/): More
On the Difference of Horn Theories (Extended Abstract) - Eiter, Ibaraki, Makino (Correct)
Complexity of Nested Circumscription and Abnormality Theories - Cadoli (2001) (Correct)
Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (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