First-order definable counting-only queries

[1]  Jef Wijsen,et al.  Calculi for symmetric queries , 2019, J. Comput. Syst. Sci..

[2]  Nicole Schweikardt,et al.  First-order logic with counting , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[3]  Jef Wijsen,et al.  An Approach towards the Study of Symmetric Queries , 2013, Proc. VLDB Endow..

[4]  Jan Van den Bussche,et al.  Towards a theory of search queries , 2010, TODS.

[5]  Toon Calders,et al.  Non-derivable itemset mining , 2007, Data Mining and Knowledge Discovery.

[6]  Stanley Peters,et al.  Quantifiers in language and logic , 2006 .

[7]  Dirk Van Gucht,et al.  Differential constraints , 2005, PODS '05.

[8]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[9]  Martin Grohe,et al.  Finite Variable Logics in Descriptive Complexity Theory , 1998, Bulletin of Symbolic Logic.

[10]  Jouko A. Väänänen,et al.  Generalized Quantifiers, an Introduction , 1997, ESSLLI.

[11]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[12]  Dirk Van Gucht,et al.  Converting nested algebra expressions into flat algebra expressions , 1992, TODS.

[13]  John C. Smart,et al.  Mapping intellectual structure of a scientific subfield through author cocitations , 1990, J. Am. Soc. Inf. Sci..

[14]  I. Anderson.  Combinatorics of Finite Sets , 1987 .

[15]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

[16]  François Bancilhon,et al.  On the Completeness of Query Languages for Relational Data Bases , 1978, MFCS.

[17]  Jan Paredaens,et al.  On the Expressive Power of the Relational Algebra , 1978, Inf. Process. Lett..

[18]  Willard Van Orman Quine,et al.  Selected Logic Papers , 1966 .

[19]  V. Vianu,et al.  Computationally Complete Relational Query Languages , 2009, Encyclopedia of Database Systems.

[20]  J. Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[21]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[22]  Bart Goethals,et al.  Survey on Frequent Pattern Mining , 2003 .

[23]  J. Väänänen.  Generalized quantifiers and computation : 9th European Summer School in Logic, Language, and Information, ESSLLI '97 Workshop, Aix-en-Provence, France, August 11-22, 1997 : revised lectures , 1999 .

[24]  Jouko A. Väänänen,et al.  Generalized Quantifiers , 1997, Bull. EATCS.

[25]  Serge Abiteboul,et al.  Foundations of Databases: The Logical Level , 1995 .

[26]  Antonio Badia,et al.  Querying with Generalized Quantifiers , 1993, Workshop on Programming with Logic Databases , ILPS.

[27]  Patrick C. Fischer,et al.  Nested Relational Structures , 1986, Adv. Comput. Res..