Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

DOI10.1145/3143804MaRDI QIDQ4608717zbMATH OpenOpenAlexWikidataFDO

Authors Marco Calautti, Sergio Greco, Irina Trubitsyna

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

answer set programmingbottom-up evaluationcomputational complexityfunction symbolsprogram terminationstable models

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On the termination of logic programs with function symbols
• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
• On functional symbol-free logic programs
• On proving functional incompleteness in symbolic logic classes
• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• On termination of functional symbol-free logic programs
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• On the complexity of index sets for finite predicate logic programs which allow function symbols
• Checking termination of bottom-up evaluation of logic programs with function symbols

Cited in

(7)

• Incremental computation of deterministic extensions for dynamic argumentation frameworks
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Using linear constraints for logic program termination analysis
• On the termination of logic programs with function symbols
• Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes

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

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