scientific article; zbMATH DE number 6139984

MaRDI QIDQ4906882zbMATH OpenFDO

Authors M. Alviano, Francesco Calimeri, Wolfgang Faber, Giovambattista Ianni, N. Leone

Publication date 28 February 2013

zbMATH Keywords

answer set programmingexpressivenessrecursive structuresuninterpreted function symbolsASP programs with functionsdecidability of class membershipdecidability of coherence checkingfinite bottom-up evaluationsfinite representations of stable modelsfinite top-down evaluationsprograms with decidable reasoning

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Computable Functions in ASP: Theory and Implementation
• ASP with non-herbrand partial functions: a language and system for practical use
• scientific article; zbMATH DE number 1799312

Cited in

(10)

• Finitely recursive programs: decidability and bottom-up computation
• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Computable Functions in ASP: Theory and Implementation
• Automata and Answer Set Programming
• Disjunctive ASP with functions: decidable queries and effective computation
• Effectively reasoning about infinite sets in answer set programming
• Functional answer set programming
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• Composing Normal Programs with Function Symbols
• A ``conservative approach to extending answer set programming with non-Herbrand functions

Describes a project that uses

Uses Software

• Gringo

This page was built for publication:

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