FAQ

Epistemic closure

Known as: Theory of closure, Principle of epistemic closure, Closed system of belief 
Epistemic closure is a property of some belief systems. It is the principle that if a subject knows , and knows that entails , then can thereby come… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1940-2017
010020019402016

Related topics

Related topics

5 relations
Belief revisionEpistemic modal logicKK thesisModal logic
(More)

Related mentions per year

Related mentions per year

1941-2018
19401960198020002020
Epistemic closure
Modal logic
Belief revision
Epistemic modal logic
Property
KK thesis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Epistemic closure and commutative, nonassociative residuated structures
K–axiom–based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential… (More)
Is this relevant?
2012
2012
Epistemic closure, skepticism and defeasibility
Those of us who have followed Fred Dretske’s lead with regard to epistemic closure and its impact on skepticism have been half… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Computing iceberg concept lattices with Titanic
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A neural correlate of response bias in monkey caudate nucleus.
Primates are equipped with neural circuits in the prefrontal cortex, the parietal cortex and the basal ganglia that predict the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Indexing and Querying XML Data for Regular Path Expressions
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes… (More)
  • figure 2
  • figure 4
  • table 1
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects
This paper addresses the problem of computing stable grasps of three dimensional poly hedral objects We consider the case of a… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Size-Estimation Framework with Applications to Transitive Closure and Reachability
Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Closure properties of constraints
Many combinatorial search problems can be expressed as “constraint satisfaction problems” and this class of problems… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
On the Closure Properties of Robotic Grasping
The form{closure and force{closure properties of robotic grasping are investigated. Loosely speaking, these properties are… (More)
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Closure and Convergence: A Foundation of Fault-Tolerant Computing
We give a formal de nition of what it means for a system to \tolerate" a class of \faults". The de nition consists of two… (More)
Is this relevant?