On the complexity of formulas in semantic programming

MaRDI QIDQ1615728zbMATH OpenFDO

Authors R. Smith

Publication date 31 October 2018

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

\(\Delta_0\)-formulaslist structurespolynomial time/space complexitysemantic programming

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Fixed-parameter complexity of semantics for logic programs
• scientific article; zbMATH DE number 2085278
• On the complexity of propositional calculus formulae
• scientific article; zbMATH DE number 5263419
• Semantic programming and polynomially computable representations
• Efficient program synthesis: semantics, logic, complexity
• Publication:3495341
• Program Development in Computational Logic

Cites work

• Computational Complexity
• Conditional terms in semantic programming
• Document models
• scientific article; zbMATH DE number 4139721 (Why is no real title available?)
• scientific article; zbMATH DE number 4047058 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 890268 (Why is no real title available?)

Cited in

(8)

• Conditional terms in semantic programming
• Recursive terms in semantic programming
• The expressiveness of looping terms in the semantic programming
• On termination of transactions over semantic document models
• Logical language of description of polynomial computing
• scientific article; zbMATH DE number 3995073 (Why is no real title available?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• Some questions on polynomially computable representations for generating grammars and Backus-Naur forms

This page was built for publication: On the complexity of formulas in semantic programming

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