Testing the equivalence of logic programs under stable model semantics

DOI10.1007/3-540-45757-7_41MaRDI QIDQ4708942zbMATH OpenFDO

Authors Tomi Janhunen, Emilia Oikarinen

Publication date 20 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2424/24240493.htm

Mathematics Subject Classification ID

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

Recommendations

• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• scientific article; zbMATH DE number 2090116
• Logic Programming

Cited in

(12)

• Hyperequivalence of logic programs with respect to supported models
• A Translation-based Approach to the Verification of Modular Equivalence
• scientific article; zbMATH DE number 3956409 (Why is no real title available?)
• Stable model checking for disjunctive logic programs
• Decidability of logic program semantics and applications to testing
• Non-constructive procedural theory of propositional problems and the equivalence of solutions
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Equivalence of propositional Prolog programs

Describes a project that uses

Uses Software

• lpeq
• Smodels

This page was built for publication: Testing the equivalence of logic programs under stable model semantics

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