Strong equivalence of logic programs under the infinite-valued semantics

DOI10.1016/J.IPL.2009.02.002MaRDI QIDQ987828zbMATH OpenOpenAlexFDO

Authors Christos Nomikos, Panos Rondogiannis, W. W. Wadge

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

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

Recommendations

• Infinitary Equilibrium Logic and Strong Equivalence
• Infinitary equilibrium logic and strongly equivalent logic programs
• Strongly equivalent logic programs
• Propositional theories are strongly equivalent to logic programs
• scientific article; zbMATH DE number 1884383

Cites work

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

Cited in

(6)

• Characterization of strongly equivalent logic programs in intermediate logics
• Infinitary equilibrium logic and strongly equivalent logic programs
• Infinitary Equilibrium Logic and Strong Equivalence
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987828)