Skip to search formSkip to main contentSkip to account menu

Fagin's theorem

Known as: Fagin (disambiguation), Fagin theorem 
Fagin's theorem is a result in descriptive complexity theory that states that the set of all properties expressible in existential second-order logic… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We define Recursive Markov Chains (RMCs), a class of finitely presented denumerable Markov chains, and we study algorithms for… 
Highly Cited
2007
Highly Cited
2007
Background: Humanitarian aid workers (HAWs) who aid traumatized populations experience emotional, cognitive, and physical… 
Highly Cited
2006
Highly Cited
2005
Highly Cited
2005
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline… 
Highly Cited
2005
Highly Cited
2005
We present a formal model that captures the subtle interaction between knowledge and action in distributed systems. We view a… 
Highly Cited
2004
Highly Cited
2004
Recently, there has been a great deal of interest in the development of techniques to evaluate path expressions over collections… 
Review
1999
Review
1999
The notion of priority is very important in the study of knowledge-based systems [Fagin et al., 1983] . In practice, knowledge… 
Highly Cited
1998
Highly Cited
1998
This paper presents a logical system in which various group-level epistemic actions are incorporated into the object language… 
Highly Cited
1997
Highly Cited
1997
In this paper, we study a simple SQL extension that enables query writers to explicitly limit the cardinality of a query result… 
Highly Cited
1997