181 search results - page 4 / 37 » On Quantification with A Finite Universe |
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
WSPI
2004
13 years 9 months ago
2004
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...
CAV
1998
Springer
13 years 12 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...