Decidability of logic program semantics and applications to testing

DOI10.1016/S0743-1066(99)00067-9MaRDI QIDQ4520178zbMATH OpenWikidataFDO

Authors Salvatore Ruggieri

Publication date 5 March 2001

Published in The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

decidabilitytesting problem

Mathematics Subject Classification ID

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

Recommendations

• Decidability of the Clark's completion semantics for monadic programs and queries
• Complexity and undecidability results for logic programming
• scientific article; zbMATH DE number 176721
• A closer look at declarative interpretations
• scientific article; zbMATH DE number 1931684

Cited in

(7)

• Synthesis for testability: Binary Decision Diagrams
• scientific article; zbMATH DE number 2114138 (Why is no real title available?)
• Concolic testing in logic programming
• Axiomatization of if-then-else over possibly non-halting programs and tests
• Testing logic programs for local stratification
• scientific article; zbMATH DE number 1324657 (Why is no real title available?)
• A testing perspective on algebraic, denotational, and operational semantics

This page was built for publication: Decidability of logic program semantics and applications to testing

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