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 (opens in a new tab)

Related topics

Related topics

8 relations
Descriptive complexity theoryFirst-order logicHO (complexity)Lexicographical order

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
An analytical framework for soft and hard data fusion: a dempster-shafer belief theoretic approach
The recent experiences of asymmetric urban military operations have highlighted the pressing need for incorporation of soft data… 
2011
2011
Efficient top-k retrieval for user preference queries
Efficient retrieval of the most relevant (i.e. top-k) tuples is an important requirement in information systems which access… 
2011
2011
Evaluating Top-k Algorithms with Various Sources of Data and User Preferences
Our main motivation is the data access model and aggregation algorithm for middleware by R. Fagin, A. Lotem and M. Naor. They… 
2006
2006
Inverting schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed… 
2006
2006
Finding the Plateau in an Aggregated Time Series
Given d input time series, an aggregated series can be formed by aggregating the d values at each time position. It is often… 
2000
2000
On the sources of complexity in agent design
This article addresses the question of what makes agent design hard. This is a fundamental issue not just for the intelligent… 
Review
1999
Review
1999
The logic of knowledge games : showing a cardHans
Modelling the dynamics of multi-agent systems currently gets much attention from the research community, e. g. Gerbrandy 99… 
1999
1999
On the Adequacy of Modal Logic
McCarthy has argued that modal logic is too limited for various purposes. I consider the extent to which he is right. 
1999
1999
Modal Logics with a Hierarchyof Local Propositional Quanti ers
Although modal logics are most commonly studied in their propositional forms, which may often be interpreted in rst order logic… 
1996
1996
Knowledge Based Programs: On the Complexity of Perfect Recall in Finite Environments
Knowledge based programs have been proposed as an abstract formalism for the design of multi-agent protocols, based on the idea… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)