2062 search results - page 254 / 413 » Derivatives of Logical Formulas |
140
click to vote
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
Deductive conceptualmodels(DCMs) aim at providing a complete specification of information systems,expressing only its logic component.It hasbeenshownthatDCMs have some advantagesw...
138
Voted
CADE
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
162
Voted
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
170
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
212
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
This paper addresses the problem of characterizing
a general class of cameras under reasonable, “linear”
assumptions. Concretely, we use the formalism and
terminology of cla...