Sciweavers

1051 search results - page 112 / 211
» Foundations of Constraint Satisfaction
Sort
View
AAAI
2007
14 years 11 days ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
CSL
2010
Springer
13 years 11 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
CIA
1998
Springer
14 years 2 months ago
Cooperative vs. Competitive Multi-Agent Negotiations in Retail Electronic Commerce
A key lesson learned from economic and game theory research is that negotiation protocols have substantial, rippling effects on the overall nature of the system. online auctions a...
Robert H. Guttman, Pattie Maes
IJMC
2007
40views more  IJMC 2007»
13 years 10 months ago
Valuing wireless data services solutions for corporate clients using real options
: The paper deals with wireless data services and their importance in the enterprise world. Provisioning in difficult-to-reach areas of tall buildings is challenging. To extend cov...
William Ramirez, Fotios C. Harmantzis, Venkata Pra...
SAC
2006
ACM
13 years 10 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...