Decidability of the Clark's completion semantics for monadic programs and queries

DOI10.1017/S1471068414000660zbMath1379.68071arXiv1410.6505MaRDI QIDQ4592984

Levon Haykazyan

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.6505

zbMATH Keywords

decidabilityClark's completiongeneral programsmonadic programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Decidability of theories and sets of sentences (03B25) Logic programming (68N17)

Cites Work

• Monadic logic programs and functional complexity
• Negation in logic programming
• The decision problem for standard classes
• Decidability of Second-Order Theories and Automata on Infinite Trees
• The accepting power of unary string logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of the Clark's completion semantics for monadic programs and queries