Sciweavers

1486 search results - page 198 / 298
» A Logically Saturated Extension of
Sort
View
ESOP
2000
Springer
15 years 9 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
CORR
2011
Springer
185views Education» more  CORR 2011»
15 years 1 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
ML
2011
ACM
308views Machine Learning» more  ML 2011»
15 years 20 days ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
LPNMR
2007
Springer
16 years 10 days ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele
PODS
2008
ACM
152views Database» more  PODS 2008»
16 years 6 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...