Sciweavers

1024 search results - page 71 / 205
» Value complete, column complete, predicate complete
Sort
View
RTA
2004
Springer
15 years 7 months ago
Rewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Herman Geuvers, Rob Nederpelt
ICDCS
2003
IEEE
15 years 7 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
ICLP
2009
Springer
15 years 6 months ago
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...
Marco Gavanelli, Marco Alberti, Evelina Lamma
105
Voted
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 5 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
KR
1992
Springer
15 years 5 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden