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 programmingASP programs with functionsdecidability of class membershipdecidability of coherence checkingexpressivenessfinite bottom-up evaluationsfinite representations of stable modelsfinite top-down evaluationsprograms with decidable reasoningrecursive structuresuninterpreted function symbols

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

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)