1588 search results - page 68 / 318 » On the Logic of Constitutive Rules |
178
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
181
click to vote
LOGCOM
2010
15 years 29 days ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
172
click to vote
AIML
2004
15 years 7 months ago
2004
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
162
click to vote
TASE
2009
IEEE
16 years 28 days ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...