Results 1  10
of
1,415,204
Strongly Equivalent Logic Programs
 ACM Transactions on Computational Logic
, 2000
"... A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong equival ..."
Abstract

Cited by 229 (35 self)
 Add to MetaCart
A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong
Strong Equivalence for Causal Theories
 In V. Lifschitz and I. Niemelä (eds) Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, Springer LNAI 2923
, 2004
"... Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonic theory. This paper considers strong equivalence for nonmonotonic causal theories of the kind introduced by McCain and Turner. Causal theories T_1 and T_2 are strongly equivalent if, ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonic theory. This paper considers strong equivalence for nonmonotonic causal theories of the kind introduced by McCain and Turner. Causal theories T_1 and T_2 are strongly equivalent if
Checking Strong Equivalence with
"... Abstract. In Answer Set Programming, Lifschitz, Pearce and Valverde have defined Strong equivalence as follows: Π1 and Π2 are strongly equivalent if for every program Π, Π1 ∪ Π and Π2 ∪ Π are equivalent, i.e., have the same answer sets. A logical characterization of Strong Equivalence is provided by ..."
Abstract
 Add to MetaCart
Abstract. In Answer Set Programming, Lifschitz, Pearce and Valverde have defined Strong equivalence as follows: Π1 and Π2 are strongly equivalent if for every program Π, Π1 ∪ Π and Π2 ∪ Π are equivalent, i.e., have the same answer sets. A logical characterization of Strong Equivalence is provided
On Modular Translations and Strong Equivalence
 Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR05), volume 3552 of LNCS, 79–91
"... Abstract. Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main theorem of this paper characterizes the existence of such a translation in terms of strong equivalence. The theor ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main theorem of this paper characterizes the existence of such a translation in terms of strong equivalence
Yet Another Characterization of Strong Equivalence ∗
"... Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas. 1 ..."
Abstract
 Add to MetaCart
Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas. 1
On Strongly Equivalent Nonrandomized Transition Probabilities
"... Dvoretzky, Wald and Wolfowitz proved in 1951 the existence of equivalent and strongly equivalent mappings for a given transition probability when the number of nonatomic measures is finite and the decision set is finite. This paper introduces a notion of strongly equivalent transition probabilities ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Dvoretzky, Wald and Wolfowitz proved in 1951 the existence of equivalent and strongly equivalent mappings for a given transition probability when the number of nonatomic measures is finite and the decision set is finite. This paper introduces a notion of strongly equivalent transition probabilities
Strong equivalence for logic programs with preferences
 In Proc. IJCAI 2005
, 2005
"... Recently, strong equivalence for Answer Set Programming has been studied intensively, and was shown to be beneficial for modular programming and automated optimization. In this paper we define the novel notion of strong equivalence for logic programs with preferences. Based on this definition we giv ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Recently, strong equivalence for Answer Set Programming has been studied intensively, and was shown to be beneficial for modular programming and automated optimization. In this paper we define the novel notion of strong equivalence for logic programs with preferences. Based on this definition we
VIOLATION OF THE STRONG EQUIVALENCE PRINCIPLE ∗
"... This paper at first considers the basic equivalence principles (Weak EP, Einstein EP and Strong EP), and further are presented some recent results about time dependent gravitational potential in the universe. Its consequences fit with the observations: Hubble red shift, change of the orbital period ..."
Abstract
 Add to MetaCart
This paper at first considers the basic equivalence principles (Weak EP, Einstein EP and Strong EP), and further are presented some recent results about time dependent gravitational potential in the universe. Its consequences fit with the observations: Hubble red shift, change of the orbital period
A Strong Equivalence Principle
"... Consider Cn spaces where the exterior differentiation of a vector basis of C2 functions leads to a Cartan matrix of exterior differential 1forms. A second exterior differentiation leads to a Cartan matrix of curvature 2forms, which must evaluate to zero, by the Poincare lemma. The Cartan connectio ..."
Abstract
 Add to MetaCart
, and the rest of the curvature 2forms are associated withInertia, the result is a strong principle of equivalence: Gravity curvature 2forms equal Inertial curvature 2forms.
Characterizing Strong Equivalence for Argumentation Frameworks
 cf2 Semantics Revisited. Proc. COMMA 2010
, 2010
"... Since argumentation is an inherently dynamic process, it is of great importance to understand the effect of incorporating new information into given argumentation frameworks. In this work, we address this issue by analyzing equivalence between argumentation frameworks under the assumption that the f ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
equivalent when conjoined with any further framework H. Due to the nonmonotonicity of argumentation semantics, this concept is different to (but obviously implies) the standard notion of equivalence. We thus call our new notion strong equivalence and study how strong equivalence can be decided with respect
Results 1  10
of
1,415,204