Complexity results for abductive logic programming

DOI10.1007/3-540-59487-6_1zbMath1496.68332OpenAlexW1596541925MaRDI QIDQ5101437

Nicola Leone, Thomas Eiter, Georg Gottlob

Publication date: 30 August 2022

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59487-6_1

Mathematics Subject Classification ID

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

Related Items (1)

Semantics and complexity of abduction from default theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abduction versus closure in causal theories.
• General logical databases and programs: Default logic semantics and stratification
• On the Relationship Between Abduction and Deduction
• SLDNFA: An abductive procedure for abductive logic programs
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Logic programming and knowledge representation
• Computing abduction by using TMS with top-down expectation
• Representing Incomplete Knowledge in Abductive Logic Programming
• Abductive Logic Programming

This page was built for publication: Complexity results for abductive logic programming