258 search results - page 30 / 52 » A High-Level Language for Modeling Algorithms and Their Prop... |
145
Voted
TSMC
2010
14 years 10 months ago
2010
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
111
click to vote
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
132
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
159
Voted
ICFP
2012
ACM
13 years 5 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
124
click to vote
ACL
1998
15 years 4 months ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...