28 search results - page 3 / 6 » On the Logic of Theory Change: Contraction without Recovery |
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
HIS
2003
13 years 8 months ago
2003
We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membe...
MSCS
2007
13 years 7 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
Modern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For e...
JAIR
2008
13 years 7 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...