Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Formalizing incomplete knowledge in incomplete databases

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

DOI10.1007/BF02943545zbMath0821.68049MaRDI QIDQ1337644

Yi-Dong Shen

Publication date: 8 November 1994

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


zbMATH Keywords

incomplete knowledgeincomplete databases


Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30)




Cites Work

  • Closed-world databases and circumscription
  • On the relationship between circumscription and negation as failure
  • An algorithm to compute circumscription
  • Circumscription - a form of non-monotonic reasoning
  • An algorithm for determining database consistency under the closed world assumption
  • Answering atomic queries in indefinite deductive databases
  • Contributions to the Theory of Logic Programming
  • The Semantics of Predicate Logic as a Programming Language
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Formalizing incomplete knowledge in incomplete databases

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