Sciweavers

778 search results - page 115 / 156
» Expressiveness and complexity of graph logic
Sort
View
ECBS
2008
IEEE
124views Hardware» more  ECBS 2008»
14 years 22 days ago
Hierarchical Model to Develop Component-Based Systems
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...
Abdelkrim Amirat, Mourad Oussalah
AMW
2010
14 years 13 days ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
CORR
2006
Springer
86views Education» more  CORR 2006»
13 years 11 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu
ESWS
2009
Springer
14 years 5 months ago
Representing, Querying and Transforming Social Networks with RDF/SPARQL
As social networks are becoming ubiquitous on the Web, the Semantic Web goals indicate that it is critical to have a standard model allowing exchange, interoperability, transformat...
Mauro San Martín, Claudio Gutierrez
RECSYS
2009
ACM
14 years 5 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina