Sciweavers

3119 search results - page 105 / 624
» General Default Logic
Sort
View
ICFCA
2009
Springer
14 years 5 months ago
Exploring Finite Models in the Description Logic
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
Franz Baader, Felix Distel
KES
2005
Springer
14 years 3 months ago
Uncertainty Management in Logic Programming: Simple and Effective Top-Down Query Answering
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certai...
Umberto Straccia
ERSHOV
2001
Springer
14 years 2 months ago
Reexecution-Based Analysis of Logic Programs with Delay Declarations
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
Agostino Cortesi, Baudouin Le Charlier, Sabina Ros...
FMLDO
2000
Springer
138views Database» more  FMLDO 2000»
14 years 1 months ago
Schema Evolution and Versioning: A Logical and Computational Characterisation
In this paper a semantic approach for the specification and the management of databases with evolving schemata is introduced. It is shown how a general objectoriented model for sc...
Enrico Franconi, Fabio Grandi, Federica Mandreoli
CADE
2001
Springer
14 years 10 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester