On the computational complexity of stratified negation in linear-time temporal logic programming

MaRDI QIDQ2758303zbMATH OpenFDO

Authors Costas D. Koutras, Christos Nomikos

Publication date 2000

zbMATH Keywords

Chronolog programcycle sum test

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Stratified negation in temporal logic programming and the cycle-sum test
• Temporal stratification tests for linear and branching-time deductive databases
• Foundations of linear-time logic programming
• scientific article; zbMATH DE number 54243
• scientific article; zbMATH DE number 879002

Cited in

(2)

• Temporal stratification tests for linear and branching-time deductive databases
• Stratified negation in temporal logic programming and the cycle-sum test

This page was built for publication: On the computational complexity of stratified negation in linear-time temporal logic programming

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