111 search results - page 18 / 23 » Definability in Logic and Rough Set Theory |
CMSB
2008
Springer
14 years 11 months ago
2008
Springer
Model checking has historically been an important tool to verify models of a wide variety of systems. Typically a model has to exhibit certain properties to be classed `acceptable&...
78
Voted
ISMIS
2003
Springer
15 years 2 months ago
2003
Springer
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
161
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
98
Voted
TPLP
2002
14 years 9 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...