7167 search results - page 870 / 1434 » Answer Set Programming |
142
Voted
ENTCS
2010
15 years 2 months ago
2010
mented Abstractions Matt Eldera,1 , Denis Gopanb,2 , and Thomas Repsa,b,3 a Computer Sciences Department, Univ. of Wisconsin; Madison, WI; USA b GrammaTech, Inc.; Ithaca, NY; USA ...
147
click to vote
JAPLL
2010
14 years 12 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Here we propose a sentence-generation method using templates that can be applied to create a speech database. This method requires the recording of a relatively small sentence set...
194
click to vote
ICLA
2011
Springer
14 years 8 months ago
2011
Springer
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
134
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...