1418 search results - page 189 / 284 » The Dynamic Complexity of Formal Languages |
143
click to vote
BDA
2007
15 years 6 months ago
2007
We present Pattern-by-Example (PBE), a graphical language that allows users with little or no knowledge of pattern-matching and functional programming to define complex and optim...
163
click to vote
CLA
2004
15 years 6 months ago
2004
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
139
click to vote
AAAI
1994
15 years 6 months ago
1994
Predicting the behavior of physical systems is essential to both common sense and engineering tasks. It is made especially challenging by the lack of complete precise knowledge of...
134
Voted
CORR
2000
Springer
15 years 4 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
157
click to vote
WWW
2003
ACM
16 years 5 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...