Answering atomic queries in indefinite deductive databases

DOI10.1002/int.4550040402zbMath0706.68043OpenAlexW2168105301MaRDI QIDQ3486861

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

non-Horn clausesatomic queriesindefinite deductive databasesplausible world assumptionsingleton-head-rulesstable beliefs

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Saturation, nonmonotonic reasoning and the closed-world assumption
• On recursive axioms in deductive databases
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Deduction in non-Horn databases
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• A problem-oriented inferential database system