186 search results - page 14 / 38 » Categorical Views on Computations on Trees (Extended Abstrac... |
JFPLC
2004
14 years 7 days ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
AI
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
ESOP
2008
Springer
14 years 18 days ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
FLOPS
2008
Springer
14 years 12 days ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
CALCO
2007
Springer
14 years 5 months ago
2007
Springer
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...