1322 search results - page 172 / 265 » Unsound Theorem Proving |
TABLEAUX
1999
Springer
14 years 1 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
TABLEAUX
1999
Springer
14 years 1 months ago
1999
Springer
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
CSFW
1997
IEEE
14 years 1 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
KR
1998
Springer
14 years 1 months ago
1998
Springer
Our concern in this paper is with conjecturing diagnoses to explain what happened to a system, given a theory of system behaviour and some observed (aberrant) behaviour. We charac...
QCQC
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...