Sciweavers

2917 search results - page 15 / 584
» Satisfying Interaction Constraints
Sort
View
JAIR
2010
130views more  JAIR 2010»
13 years 2 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
AGP
1998
IEEE
13 years 11 months ago
Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint ...
Agostino Dovier, Carla Piazza, Gianfranco Rossi
CADE
2007
Springer
14 years 7 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
DLOG
2010
13 years 5 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
ER
2010
Springer
132views Database» more  ER 2010»
13 years 5 months ago
Full Satisfiability of UML Class Diagrams
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...