Sciweavers

961 search results - page 121 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
AINA
2007
IEEE
14 years 3 months ago
A Class-Based Search System in Unstructured P2P Networks
— Efficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant a...
Juncheng Huang, Xiuqi Li, Jie Wu
ICTAC
2010
Springer
13 years 6 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
ICDT
2012
ACM
293views Database» more  ICDT 2012»
11 years 11 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
DBKDA
2009
IEEE
136views Database» more  DBKDA 2009»
14 years 22 days ago
Visualization and Integration of Databases Using Self-Organizing Map
Abstract--With the growing computer networks, accessible data is becoming increasing distributed. Understanding and integrating remote and unfamiliar data sources are important dat...
Farid Bourennani, Ken Q. Pu, Ying Zhu
ACL
2001
13 years 10 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré