Sciweavers

2917 search results - page 49 / 584
» Satisfying Interaction Constraints
Sort
View
ICALP
1998
Springer
14 years 1 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
DAC
2001
ACM
14 years 9 months ago
Power-Aware Scheduling under Timing Constraints for Mission-Critical Embedded Systems
Power-aware systems are those that must make the best use of available power. They subsume traditional low-power systems in that they must not only minimize power when the budget ...
Jinfeng Liu, Pai H. Chou, Nader Bagherzadeh, Fadi ...
AGP
1999
IEEE
14 years 1 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
FOIKS
2006
Springer
14 years 13 days ago
Equational Constraint Solving Via a Restricted Form of Universal Quantification
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
Javier Álvez, Paqui Lucio
CAISE
2006
Springer
13 years 10 months ago
Resolving Underconstrained and Overconstrained Systems of Conjunctive Constraints for Service Requests
Given a service request such as scheduling an appointment or purchasing a product, it is possible that the invocation of the service results in too many solutions that all satisfy ...
Muhammed Al-Muhammed, David W. Embley