1598 search results - page 105 / 320 » A Unified Computation Model for Functional and Logic Program... |
152
click to vote
DLOG
2006
15 years 6 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
151
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
256
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
151
click to vote
ICTAC
2005
Springer
15 years 10 months ago
2005
Springer
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the ...
148
click to vote
ENTCS
2008
15 years 4 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...