Sciweavers

101 search results - page 13 / 21
» Maintaining constraints expressed as formulas in collaborati...
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ECAI
2008
Springer
13 years 9 months ago
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
OWLED
2008
13 years 9 months ago
Managing Change: An Ontology Version Control System
In this paper we present the basic requirements and initial design of a system which manages and facilitates changes to an OWL ontology in a multi-editor environment. This system u...
Timothy Redmond, Michael Smith, Nick Drummond, Tan...
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 2 months ago
A Data Model for Moving Objects Supporting Aggregation
Moving objects databases (MOD) have been receiving increasing attention from the database community in recent years, mainly due to the wide variety of applications that technology...
Bart Kuijpers, Alejandro A. Vaisman
ACSAC
2006
IEEE
14 years 1 months ago
A Module System for Isolating Untrusted Software Extensions
With the recent advent of dynamically extensible software systems, in which software extensions may be dynamically loaded into the address space of a core application to augment i...
Philip W. L. Fong, Simon A. Orr