3691 search results - page 320 / 739 » Bayesian Logic Programs |
228
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
184
click to vote
PRICAI
2004
Springer
16 years 3 days ago
2004
Springer
In this paper, we extend our earlier work on modelling the mental states of PRS-like agents by considering the dynamics of belief and modelling of action attempts. The major constr...
209
click to vote
ACL
1997
15 years 8 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
191
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
198
click to vote
IGPL
2011
14 years 10 months ago
2011
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...