Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

DOI10.1145/3143804zbMath1407.68078OpenAlexW2769306164WikidataQ130847072 ScholiaQ130847072MaRDI QIDQ4608717

Irina Trubitsyna, Sergio Greco, Marco Calautti

Publication date: 22 March 2018

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/74662984/Detecting_Decidable_Classes_of_Finitely_Ground_Logic_Programs_with_Function_Symbols.pdf

zbMATH Keywords

computational complexityanswer set programmingfunction symbolsstable modelsprogram terminationbottom-up evaluation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

This page was built for publication: Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols