scientific article; zbMATH DE number 2090537

MaRDI QIDQ4812969zbMATH OpenFDO

Authors P. A. Bonatti

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2401/24010333.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Reasoning with infinite stable models
• On finitely recursive programs
• On Finitely Recursive Programs
• scientific article; zbMATH DE number 25192
• Expressiveness of logic programs under the general stable model semantics

Cited in

(19)

• Domain expansion for ASP-programs with external sources
• One More Decidable Class of Finitely Ground Programs
• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Computable Functions in ASP: Theory and Implementation
• Stable classes and operator pairs for disjunctive programs
• Reasoning with infinite stable models
• Ordered completion for first-order logic programs on finite structures
• Disjunctive logic programs with existential quantification in rule heads
• A decidable subclass of finitary programs
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• On Finitely Recursive Programs
• Bottom-up computation of perfect models for disjunctive theories
• Expressiveness of logic programs under the general stable model semantics
• On finitely recursive programs
• Embedding functions into disjunctive logic programs
• Erratum to: ``Reasoning with infinite stable models
• Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
• Dual-normal logic programs -- the forgotten class
• Embedding functions into disjunctive logic programs

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 Q4812969)