Expressive power (computer science)

Known as: Expressivity (computer science) 
In computer science, the expressive power (also called expressiveness or expressivity) of a language is the breadth of ideas that can be represented… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2017
05010019672017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The common abstraction of XML Schema by unranked regular tree languages is not entirely accurate. To shed some light on the… (More)
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider large margin estimation in a broad range of prediction models where inference involves solving combinatorial… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This article presents a Support Vector Machine (SVM) like learning system to handle multi-label problems. Such problems are… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A programmable coordination medium is a shared communication device whose behaviour can be defined by means of a suitable… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The literature on programming languages contains an abundance of informal claims on the relative expressive power of programming… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We study here the language Datalog(≠), which is the query language obtained from Datalog by allowing equalities and inequalities… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The <italic>set-height</italic> of a complex object type is defined to be its level of nesting of the set construct. In a query… (More)
  • figure 1
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point… (More)
Is this relevant?