1224 search results - page 94 / 245 » Theory decision by decomposition |
102
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
95
Voted
TYPES
1999
Springer
15 years 5 months ago
1999
Springer
We propose a method to search for a lemma in a goq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the funct...
103
Voted
UAI
1998
15 years 2 months ago
1998
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of...
100
click to vote
ATVA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
121
Voted
ICDE
2010
IEEE
16 years 13 days ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...