Sciweavers

58 search results - page 10 / 12
» Intensional Sets in CLP
Sort
View
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 7 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
120
Voted
DEXA
2000
Springer
76views Database» more  DEXA 2000»
15 years 6 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
VLDB
2002
ACM
156views Database» more  VLDB 2002»
15 years 1 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu
ER
2007
Springer
74views Database» more  ER 2007»
15 years 8 months ago
Schema Exchange: A Template-Based Approach to Data and Metadata Translation
In this paper we study the problem of schema exchange, a natural extension of the data exchange problem to an intensional level. To this end, we first introduce the notion of sche...
Paolo Papotti, Riccardo Torlone
129
Voted
EPIA
1993
Springer
15 years 5 months ago
A Uniform Framework for Deductive Database Derivation Strategies
A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a ge...
Robert Demolombe