Sciweavers

3319 search results - page 608 / 664
» Subshifts, Languages and Logic
Sort
View
CP
2003
Springer
14 years 27 days ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
CP
2003
Springer
14 years 27 days ago
Using Constraints for Exploring Catalogs
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
François Laburthe, Yves Caseau
FM
2003
Springer
115views Formal Methods» more  FM 2003»
14 years 27 days ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn
ICLP
2003
Springer
14 years 27 days ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
ISMIS
2003
Springer
14 years 26 days ago
A Formal Approach to Describing Action Concepts in Taxonomical Knowledge Bases
T his paper outlines a formal theory for de fining action concepts in taxonomical knowledge representation languages, in a form closely related to description logics. The central p...
Christel Kemke