Sciweavers

784 search results - page 84 / 157
» Relaxing the Value Restriction
Sort
View
CSR
2007
Springer
14 years 3 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
DAWAK
2007
Springer
14 years 3 months ago
Automating the Schema Matching Process for Heterogeneous Data Warehouses
Abstract. A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In ...
Marko Banek, Boris Vrdoljak, A. Min Tjoa, Zoran Sk...
LPNMR
2007
Springer
14 years 3 months ago
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
Pedro Cabalar, David Pearce, Panos Rondogiannis, W...
CSFW
1999
IEEE
14 years 1 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
CEC
2010
IEEE
13 years 10 months ago
Evolving programs with parameters and loops
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...
Gayan Wijesinghe, Victor Ciesielski