Sciweavers

278 search results - page 29 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
13 years 12 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ECOOP
2009
Springer
14 years 8 months ago
Coinductive Type Systems for Object-Oriented Languages
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
Davide Ancona, Giovanni Lagorio
EPIA
1995
Springer
13 years 11 months ago
The Retrieval Problem in a Concept Language with Number Restrictions
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
Aida Vitória, Margarida Mamede, Luís...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
IS
2011
13 years 2 months ago
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
Pekka Kilpeläinen