Composing Normal Programs with Function Symbols

DOI10.1007/978-3-540-89982-2_38MaRDI QIDQ5504671zbMATH OpenOpenAlexFDO

Authors Sabrina Baselice, P. A. Bonatti

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_38

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 6139984
• Modularity in smodels Programs
• Finitely recursive programs: decidability and bottom-up computation
• A decidable subclass of finitary programs
• Modular nonmonotonic logic programming revisited

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic programming and nonmonotonic reasoning. Proceedings of the 4th international conference, LPNMR '97, held in Dagstuhl, Germany, July 28--31, 1997
• On Finitely Recursive Programs
• On the Expressibility of Stable Logic Programming
• On the partial semantics for disjunctive deductive databases
• Reasoning with infinite stable models
• The Stable Models of a Predicate Logic Program

Cited in

(1)

• Answer Set Programming: A Primer

Describes a project that uses

Uses Software

• Datalog
• Smodels

This page was built for publication: Composing Normal Programs with Function Symbols

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