Closed world assumptions having precedence in predicates

DOI10.1007/BF03037516zbMath0711.68093MaRDI QIDQ922726

Hirofumi Katsuno

Publication date: 1990

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

closed world assumptiondeductive databaseHorn clausestratified programs

Mathematics Subject Classification ID

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

Cites Work

• Saturation, nonmonotonic reasoning and the closed-world assumption
• Closed-world databases and circumscription
• Negation as failure: careful closure procedure
• On the relationship between circumscription and negation as failure
• Deduction in non-Horn databases
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Equality and Domain Closure in First-Order Databases
• Horn clauses and database dependencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item