Sciweavers

571 search results - page 92 / 115
» Domain Theory in Logical Form
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 6 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
ICFP
2005
ACM
16 years 5 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
OTM
2005
Springer
15 years 11 months ago
Reasoning on Dynamically Built Reasoning Space with Ontology Modules
Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerfu...
Fabio Porto
DEXA
2000
Springer
76views Database» more  DEXA 2000»
15 years 10 months ago
Semantic Verification of Rule-Based Systems with Arithmetic Constraints
The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a rule-based system (RBS). A semantic inconsistency is defined by...
Jaime Ramírez, Angélica de Antonio
MST
2010
140views more  MST 2010»
15 years 4 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh