… use a stronger subsystem of classical propositional logic—“the logic of here-and-there,” …
logic of here-and-there and the strong equivalence of logic programs: two programs are strongly …

… classes of strongly equivalent sets of logic program rules … strongly equivalent, then we can
replace one by the other in any logic program without changing the semantics of the program…

… -theoretic characterization of strong equivalence in terms of pairs of … logic programs to
propositional theories that reduces strong equivalence to entailment in classical propositional logic…

… logic programs under the stablemodel semantics, with respect to the notions of strong and
uniform equivalence between logic programs… ered for nonmonotonic logic programs (the latter …

… the answer set semantics for logic programs gives rise to a relationship of strong equivalence
between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest …

… Pearce’s equilibrium logic [5,6]. In the current paper, strong equivalence of logic programs is
… no knowledge of the logic of here-and-there is required. This simplifies the proof of the main …

… now that any theory is strongly equivalent to a nonnested logic program. Nevertheless, this
… nested program can always be transformed into a nonnested one under strong equivalence …

… within any logic program preserves the program’s stable models. The familiar characterization
of strong equivalence of grounded programs in terms of the propositional logic of here-and…

… strong equivalence for logic programs that represent transition systems. To this aim, we revisit
a temporal extension of Equilibrium Logic … those handled in Linear Temporal Logic (LTL) […

… of strong equivalence is easily extended to default logic (… to nested programs but also to the
weight constraint programs of … of strong equivalence of two weight constraint programs in a …