Sciweavers

1445 search results - page 53 / 289
» Uniformly Hard Languages
Sort
View
IRI
2007
IEEE
14 years 4 months ago
ModelML: a Markup Language for Automatic Model Synthesis
Domain-specific modeling has become a popular way of designing and developing systems. It generally involves a systematic use of a set of object-oriented models to represent vari...
Cong Zhang, Amol Bakshi, Viktor K. Prasanna
LICS
2007
IEEE
14 years 4 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
JSAT
2006
126views more  JSAT 2006»
13 years 10 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
SEMWEB
2007
Springer
14 years 4 months ago
From Web Directories to Ontologies: Natural Language Processing Challenges
Hierarchical classifications are used pervasively by humans as a means to organize their data and knowledge about the world. One of their main advantages is that natural language ...
Ilya Zaihrayeu, Lei Sun, Fausto Giunchiglia, Wei P...
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
14 years 3 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek