Answering atomic queries in indefinite deductive databases

DOI10.1002/INT.4550040402MaRDI QIDQ3486861zbMATH OpenOpenAlexFDO

Authors Eliezer L. Lozinskii

Publication date 1989

Published in International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/int.4550040402

zbMATH Keywords

atomic queriesindefinite deductive databasesnon-Horn clausesplausible world assumptionsingleton-head-rulesstable beliefs

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27)

Recommendations

• Evaluation of queries under closed-world assumption
• scientific article; zbMATH DE number 219217
• scientific article; zbMATH DE number 1735824
• Negation as failure: careful closure procedure
• Deduction in non-Horn databases

Cites work

• A logic for default reasoning
• A problem-oriented inferential database system
• Circumscription - a form of non-monotonic reasoning
• Deduction in non-Horn databases
• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 3984612 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• On recursive axioms in deductive databases
• Saturation, nonmonotonic reasoning and the closed-world assumption

Cited in

(3)

• Counting propositional models
• Resolving contradictions: A plausible semantics for inconsistent systems
• Formalizing incomplete knowledge in incomplete databases

This page was built for publication: Answering atomic queries in indefinite deductive databases

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