3440 search results - page 288 / 688 » Logics For Context-Free Languages |
186
click to vote
JAPLL
2011
15 years 2 months ago
2011
The paper proposes a formal analysis of a theory of norms resulting from pulling together Anderson’s reduction, the analysis of counts-as, and a novel approach to the formal rep...
208
click to vote
JAPLL
2010
15 years 2 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
292
click to vote
ICFP
2009
ACM
16 years 8 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
308
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
307
click to vote
ICLP
2009
Springer
16 years 8 months ago
2009
Springer
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...