scientific article

zbMATH Open0726.68016MaRDI QIDQ3348391

No author found.

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity of computations of logic programsconservative normal form

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Trace rewriting: Computing normal forms in time O(n log n) ⋮ Symbolic computation of normal forms for semi-simple cases

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Compact normal forms in propositional logic and integer programming formulations 👍 👎
• Normal forms in combinatory logic 👍 👎
• Normal forms for second-order logic over finite structures, and classification of NP optimization problems 👍 👎
• On the likelihood of normalization in combinatory logic 👍 👎
• Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems 👍 👎
• Compositionality of normal open logic programs 👍 👎
• On correctness of normal logic programs 👍 👎
• Proof-theoretic foundations of normal logic programs 👍 👎

This page was built for publication: