Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,227,503 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
Blackfin
Chomsky hierarchy
Ciao
Codd's theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Phraseology in Two Slavic Valency Dictionaries: Limitations and Perspectives
A. Przepiórkowski
,
Jan Hajic
,
E. Hajnicz
,
Zdenka Uresová
2016
Corpus ID: 62490358
Phraseological components of valency dictionaries for two West Slavic languages are presented, namely, of the PDT-Vallex…
Expand
2010
2010
Extending OWL with Integrity Constraints
Jiao Tao
,
E. Sirin
,
J. Bao
,
Deborah L. McGuinness
Description Logics
2010
Corpus ID: 9621977
Since m1 and m2 are not explicitly defined to be different from each other, they will be inferred to be same due to the…
Expand
2007
2007
Transformation of a Mamdani FIS to First Order Sugeno FIS
J. Jassbi
,
S. H. Alavi
,
Paulo J. A. Serra
,
Rita Almeida Ribeiro
IEEE International Fuzzy Systems Conference
2007
Corpus ID: 14266871
In many decision support applications, it is important to guarantee the expressive power, easy formalization and interpretability…
Expand
2007
2007
Data Complexity in the EL family of DLs
Adila Alfa Krisnadhi
,
C. Lutz
Description Logics
2007
Corpus ID: 14879338
In recent years, lightweight description logics (DLs) have experienced increased interest because they admit highly efficient…
Expand
2005
2005
Embedded supervisory control of discrete-event systems
Y. Yang
,
R. Gohari
IEEE International Conference on Automation…
2005
Corpus ID: 31873258
In this paper we propose to implement supervisory control by extending the plant finite state machine (FSM). Plant and supervisor…
Expand
2005
2005
Expressing Default Logic Variants in Default Logic
James P. Delgrande
,
Torsten Schaub
Journal of Logic and Computation
2005
Corpus ID: 3190309
Reiter's default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of…
Expand
2002
2002
Knowledge representation in RDF / XML , KIF , Frame-CG and Formalized-English
Philippe A. Martin
2002
Corpus ID: 14722681
This article shows how RDF/XML, KIF, Frame-CG (FCG) and Formalized-English (FE) can be used in a panorama of knowledge…
Expand
1991
1991
An evaluation framework for algebraic object-oriented query models
Yu Li
,
Sylvia L. Osborn
[] Proceedings. Seventh International Conference…
1991
Corpus ID: 30394808
An evaluation framework consisting of five categories of criteria is developed for evaluating the relative merits of objects…
Expand
1988
1988
Rewrite systems, pattern matching, and code generation
Eduardo Pelegrí-Llopart
,
Susan J. Graham
1988
Corpus ID: 120523610
Trees are convenient representations because of their hierarchical structure, which models many situations, and ease with which…
Expand
Review
1973
Review
1973
Comparison of Programming Languages
B. S. Gottfried
1973
Corpus ID: 59629217
(a) Overview. (b) SPARK Ada. • Logical soundness. – Is there a sound, unambiguous definition of the languag • Complexity of…
Expand