Closed-world assumption

Known as: Generalized Closed World Assumption, Extended Closed World Assumption, Extended Generalized Closed World Assumption 
The closed-world assumption (CWA), in a formal system of logic used for knowledge representation, is the presumption that a statement that is true is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2018
0102019712018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Existing research on multiclass text classification mostly makes the closed world assumption, which focuses on designing accurate… (More)
Is this relevant?
2014
2014
Forensic stylometry is a form of authorship attribution that relies on the linguistic information found in a document. While… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2013
2013
Time plays an important role in the vast majority of problems and, as such, it is a vital issue to be considered when developing… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2013
2013
One of the major advantages of semantically annotating resources on Web is the facilitation of web services discovery. Languages… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2009
2009
This paper presents a formalism for representing and reasoning about Web services with local closed world assumption (LCWA) on… (More)
Is this relevant?
2000
2000
We present a sound and complete, tractable inference method for reasoning with localized closed world assumptions (LCWA’s) which… (More)
Is this relevant?
1997
1997
We study the semantics of disjunctive logic programs that simultaneously contain multiple kinds of default negations. We… (More)
Is this relevant?
1992
1992
Pereira, L.M., J.J. Alferes, J.N. Aparicio, Adding closed world assumptions to well-founded semantics, Theoretical Computer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Explicit representation of negative information in logic programs is not feasible in many applications such as deductive… (More)
Is this relevant?
Highly Cited
1982