3738 search results - page 337 / 748 » Parametrized Logic Programming |
137
Voted
PRICAI
2004
Springer
15 years 9 months 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...
163
click to vote
ACL
1997
15 years 5 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 ...
147
click to vote
CORR
2004
Springer
15 years 3 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...
152
click to vote
IGPL
2011
14 years 7 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...
248
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...