4401 search results - page 388 / 881 » Computing with Default Logic |
238
click to vote
DANCE
2002
IEEE
15 years 11 months ago
2002
IEEE
Modeling and formally analyzing active network systems and protocols is quite challenging, due to their highly dynamic nature and the need for new network models. We propose a wid...
148
click to vote
TLCA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
193
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDED pronounced indee...
185
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
166
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....