Sciweavers

2410 search results - page 9 / 482
» Multiset Ordering Constraints
Sort
View
ENTCS
2008
64views more  ENTCS 2008»
14 years 9 months ago
Service Discovery and Negotiation With COWS
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform ...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
15 years 1 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
CSCLP
2005
Springer
15 years 3 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
RTA
2009
Springer
15 years 4 months ago
The Derivational Complexity Induced by the Dependency Pair Method
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
Georg Moser, Andreas Schnabl
CSR
2009
Springer
15 years 4 months ago
On Random Ordering Constraints
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
Andreas Goerdt