Efficient reasoning using the local closed-world assumption

DOI10.1007/3-540-45331-8_5MaRDI QIDQ2753783zbMATH OpenFDO

Authors Patrick Doherty, Witold Łukaszewicz, Andrzej Szałas

Publication date 4 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45331-8_5

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Sound and efficient closed-world reasoning for planning
• Two approaches to efficient open-world reasoning
• Closed-world databases and circumscription
• scientific article; zbMATH DE number 589696
• Logic Programming and Nonmonotonic Reasoning

Cited in

(5)

• Sound and efficient closed-world reasoning for planning
• Rough set reasoning using answer set programs
• Two approaches to efficient open-world reasoning
• Applying the closed world assumption to SUMO-based FOL ontologies for effective commonsense reasoning
• Inference rules using local contexts

This page was built for publication: Efficient reasoning using the local closed-world assumption

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