Evaluation of queries under closed-world assumption

DOI10.1023/A:1005723423016zbMATH Open0884.03030OpenAlexW1559192138MaRDI QIDQ1367075FDOQ1367075

Authors: Marek A. Suchenek 

Publication date: 1 April 1998

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005723423016

Recommendations

• Evaluation of queries under closed-world assumption. II: The hierarchical case
• Negation as failure: careful closure procedure
• Saturation, nonmonotonic reasoning and the closed-world assumption
• scientific article; zbMATH DE number 589696

zbMATH Keywords

deductive databasecomputational feasibilityfirst-order consequence operationminimal indefinite Herbrand modelparallel positive resolution

Mathematics Subject Classification ID

Database theory (68P15) Abstract deductive systems (03B22) Other applications of logic (03B80)

Cited In (4)

• Finite Open-World Query Answering with Number Restrictions
• Answering atomic queries in indefinite deductive databases
• Title not available (Why is that?)
• Evaluation of queries under closed-world assumption. II: The hierarchical case

This page was built for publication: Evaluation of queries under closed-world assumption

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