162 search results - page 14 / 33 » Completeness Guarantees for Incomplete Reasoners |
JAIR
2006
14 years 9 months ago
2006
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
DKE
2007
14 years 9 months ago
2007
ct 9 The benefits of modular representations are well known from many areas of computer science. While in software engi10 neering modularization is mainly a vehicle for supporting...
JAIR
2006
14 years 9 months ago
2006
It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is us...
ICDT
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...