Characterization of strongly equivalent logic programs in intermediate logics

DOI10.1017/S147106840200159XzbMath1069.68538OpenAlexW2090184124MaRDI QIDQ4452594

Lex Hendriks, Dick H. J. de Jongh

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s147106840200159x

zbMATH Keywords

answer set semanticspropositional intermediate logicsstrongly equivalent programs

Mathematics Subject Classification ID

Logic programming (68N17) Intermediate logics (03B55)

Related Items (11)

Here and There among Logics for Logic Programming ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Equilibrium logic ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ Cut-free formulations for a quantified logic of here and there ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming ⋮ A first order nonmonotonic extension of constructive logic

This page was built for publication: Characterization of strongly equivalent logic programs in intermediate logics