Sciweavers

699 search results - page 12 / 140
» A Computational Model for Functional Logic Deductive Databas...
Sort
View
BIRTHDAY
2003
Springer
13 years 11 months ago
Aspect Validation Using Model Checking
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
Shmuel Katz, Marcelo Sihman
ZUM
2000
Springer
13 years 11 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp
AIR
2006
124views more  AIR 2006»
13 years 7 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
AAAI
2000
13 years 8 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
FOIKS
2010
Springer
13 years 10 months ago
On the Existence of Armstrong Data Trees for XML Functional Dependencies
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
Sven Hartmann, Henning Köhler, Thu Trinh