Sciweavers

496 search results - page 80 / 100
» Practical Reasoning for Very Expressive Description Logics
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
14 years 8 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
KRDB
2003
117views Database» more  KRDB 2003»
14 years 11 months ago
On a Unifying Framework for Comparing Knowledge Representation Schemes
Given the numerous knowledge representation models (KR-schemes) that have been proposed, it would be desirable to have a formal, unifying model for the description of a KR-scheme,...
Giorgos Flouris, Dimitris Plexousakis, Grigoris An...
POPL
2004
ACM
15 years 10 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
CADE
2009
Springer
15 years 10 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
FMCAD
2008
Springer
14 years 11 months ago
A Write-Based Solver for SAT Modulo the Theory of Arrays
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras...