FDNC
From MaRDI portal
Publication:2946602
DOI10.1145/1656242.1656249zbMath1351.68052OpenAlexW2051741066MaRDI QIDQ2946602
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
computational complexityreasoning about actionsdescription logicsanswer set programmingfunction symbolsknowledge compilationnonmonotonic logic programs
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)
Related Items
The delay and window size problems in rule-based stream reasoning ⋮ Simulating Production Rules Using ACTHEX ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Recent Advances in Datalog$$^\pm $$ ⋮ Weight constraint programs with evaluable functions ⋮ Datalog and Its Extensions for Semantic Web Databases