FDNC: decidable nonmonotonic disjunctive logic programs with function symbols

DOI10.1145/1656242.1656249MaRDI QIDQ2946602zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Mantas Šimkus

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1656242.1656249

zbMATH Keywords

computational complexityanswer set programmingdescription logicsreasoning about actionsfunction symbolsknowledge compilationnonmonotonic logic programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• scientific article; zbMATH DE number 2090537
• scientific article; zbMATH DE number 6139984
• Finitely recursive programs: decidability and bottom-up computation
• Reasoning with infinite stable models

Cited in

(9)

• Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
• The delay and window size problems in rule-based stream reasoning
• Recent advances in Datalog\(^\pm \)
• Simulating production rules using ACTHEX
• Weight constraint programs with evaluable functions
• Towards more expressive ontology languages: the query answering problem
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Datalog and Its Extensions for Semantic Web Databases
• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

This page was built for publication: FDNC: decidable nonmonotonic disjunctive logic programs with function symbols

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