1127 search results - page 147 / 226 » Theory Extension in ACL2(r) |
163
click to vote
ENGL
2007
15 years 6 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
161
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. The paper starts from the standard relational view linking objects and properties in formal concept analysis, here augmented with four modal-style operators (known as suf...
183
click to vote
IANDC
2007
15 years 6 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
166
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
191
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...