Sciweavers

699 search results - page 49 / 140
» A Computational Model for Functional Logic Deductive Databas...
Sort
View
ACL
1990
13 years 8 months ago
Designer Definites in Logical Form
In this paper, we represent singular definite noun phrases as functions in logical form. This representation is designed to model the behaviors of both anaphoric and non-anaphoric...
Mary P. Harper
IWFM
1998
13 years 9 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 7 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CN
2004
109views more  CN 2004»
13 years 7 months ago
Architectures and protocols for mobile computing applications: a reconfigurable approach
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs...
Carla-Fabiana Chiasserini, Francesca Cuomo, Leonar...
LOPSTR
1999
Springer
13 years 12 months ago
Roles of Program Extension
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
Ralf Lämmel, Günter Riedewald, Wolfgang ...