Sciweavers

1453 search results - page 103 / 291
» Partial Constraint Satisfaction
Sort
View
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
15 years 1 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
CI
2004
85views more  CI 2004»
15 years 3 months ago
Soft Constraint Propagation and Solving in Constraint Handling Rules
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
ICTAI
2002
IEEE
15 years 9 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
CONCUR
2000
Springer
15 years 8 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
CADE
2010
Springer
15 years 5 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer