A decidable subclass of finitary programs

DOI10.1017/S1471068410000232zbMath1205.68114arXiv1007.3663OpenAlexW2035046277MaRDI QIDQ3585163

Sabrina Baselice, Piero A. Bonatti

Publication date: 19 August 2010

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

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

zbMATH Keywords

normsanswer set programming with function symbolsinfinite stable models

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (4)

A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions ⋮ Constraint Answer Set Programming without Grounding ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing

Uses Software

• Gringo
• Smodels

Cites Work

• Unnamed Item
• Reasoning with infinite stable models
• Norms on terms and their use in proving universal termination of a logic program
• Logic programming. 24th international conference, ICLP 2008, Udine, Italy, December 9--13 2008. Proceedings
• Erratum to: ``Reasoning with infinite stable models
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• On finitely recursive programs

This page was built for publication: A decidable subclass of finitary programs