Sciweavers

3658 search results - page 634 / 732
» The logic of proofs, semantically
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
14 years 8 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
ICFP
2004
ACM
14 years 8 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
TPHOL
2009
IEEE
14 years 2 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler
WEBI
2009
Springer
14 years 2 months ago
Measuring Inconsistency in DL-Lite Ontologies
Abstract—Measuring Inconsistency in ontologies is an important topic in ontology engineering as it can provide extra information for dealing with inconsistency. Many approaches h...
Liping Zhou, Houkuan Huang, Guilin Qi, Yue Ma, Zhi...
ICCS
2009
Springer
14 years 2 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...