On the complexity of formulas in semantic programming
type: Item
instance of: scholarly article
title: On the complexity of formulas in semantic programming
zbMATH Open document ID: 1403.03061
author: R. Smith
publication date: 2018-10-31T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6969396
zbMATH Keywords: semantic programming
zbMATH Keywords: list structures
zbMATH Keywords: polynomial time/space complexity
zbMATH Keywords: \(\Delta_0\)-formulas
MaRDI profile type: Publication
cites work: Q4882531
cites work: Q4075450
cites work: Q3472084
cites work: Q3783515
cites work: Conditional terms in semantic programming
cites work: Computational Complexity
cites work: Q4298260
cites work: Q4131648
cites work: Document models
published in: Sibirskie Elektronnye Matematicheskie Izvestiya
Recommended article: Fixed-parameter complexity of semantics for logic programs
Recommended article: Q4736513
Recommended article: Q5457670
Recommended article: Q5457669
Recommended article: Q6062761
Recommended article: Efficient program synthesis: Semantics, logic, complexity
Recommended article: Q3495341
Recommended article: Program Development in Computational Logic
description: scientific article; zbMATH DE number 6969396