On finitely recursive programs

DOI10.1017/S147106840900372XzbMath1166.68311OpenAlexW1965483956MaRDI QIDQ3621269

Sabrina Baselice, Giovanni Criscuolo, Piero A. Bonatti

Publication date: 15 April 2009

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

Full work available at URL: https://doi.org/10.1017/s147106840900372x

zbMATH Keywords

compactnessinfinite stable modelsanswer set programming with infinite domainsfinitary programsskeptical resolution

Mathematics Subject Classification ID

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

Related Items

Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics, Constraint Answer Set Programming without Grounding, Terminating Evaluation of Logic Programs with Finite Three-Valued Models, Checking termination of bottom-up evaluation of logic programs with function symbols, Using linear constraints for logic program termination analysis, Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments, A decidable subclass of finitary programs, Disjunctive ASP with functions: Decidable queries and effective computation

Cites Work

• Unnamed Item
• Reasoning with infinite stable models
• Logic programs with stable model semantics as a constraint programming paradigm
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Resolution for skeptical stable model semantics