615 search results - page 55 / 123 » Completeness of Combinations of Constructor Systems |
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
WM
2003
13 years 9 months ago
2003
: One of today’s hottest IT topics is integration, as bringing together information from different sources and structures is not completely solved. The approach outlined here wan...
AIPS
1994
13 years 9 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
ENTCS
2008
13 years 7 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
SIGDIAL
2010
13 years 5 months ago
2010
We investigate the clarification strategies exhibited by a hybrid POMDP dialog manager based on data obtained from a phone-based user study. The dialog manager combines task struc...