Sciweavers

120 search results - page 13 / 24
» From CTL to Datalog
Sort
View
LICS
2006
IEEE
15 years 3 months ago
On Tractability and Congruence Distributivity
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
Emil W. Kiss, Matthew Valeriote
UAI
2003
14 years 11 months ago
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
Vítor Santos Costa, David Page, Maleeha Qaz...
DKE
2006
138views more  DKE 2006»
14 years 9 months ago
Using the uni-level description (ULD) to support data-model interoperability
We describe a framework called the Uni-Level Description (ULD) for accurately representing information from a broad range of data models. The ULD extends previous metadata-model a...
Shawn Bowers, Lois M. L. Delcambre
CSIE
2009
IEEE
15 years 4 months ago
A Metamodel for Tracing Non-functional Requirements
The tendency for Non-Functional Requirements (NFRs) to have a wide-ranging impact on a software system, and the strong interdependencies and tradeoffs that exist between NFRs and ...
Mohamad Kassab, Olga Ormandjieva, Maya Daneva
CSFW
2007
IEEE
15 years 4 months ago
Do As I SaY! Programmatic Access Control with Explicit Identities
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, J...