Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An algorithm for determining database consistency under the closed world assumption

From MaRDI portal
Publication:1337643
Jump to:navigation, search

DOI10.1007/BF02943544zbMATH Open0941.68556OpenAlexW1994636208MaRDI QIDQ1337643FDOQ1337643


Authors: Yi-Dong Shen Edit this on Wikidata


Publication date: 26 February 1996

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02943544





Mathematics Subject Classification ID

Database theory (68P15)


Cites Work

  • The Semantics of Predicate Logic as a Programming Language
  • Title not available (Why is that?)
  • Saturation, nonmonotonic reasoning and the closed-world assumption


Cited In (1)

  • Formalizing incomplete knowledge in incomplete databases





This page was built for publication: An algorithm for determining database consistency under the closed world assumption

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1337643&oldid=13465189"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 13:07. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki