Strong equivalence of logic programs under the infinite-valued semantics

DOI10.1016/j.ipl.2009.02.002zbMath1213.68181OpenAlexW2047574806MaRDI QIDQ987828

William W. Wadge, Panos Rondogiannis, Christos Nomikos

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.002

zbMATH Keywords

formal semanticsnegation in logic programmingstrong equivalence

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Cites Work

• An infinite-game semantics for well-founded negation in logic programming
• The well-founded semantics for general logic programs
• Minimum model semantics for logic programs with negation-as-failure
• Logic Programming
• Strongly equivalent logic programs

This page was built for publication: Strong equivalence of logic programs under the infinite-valued semantics