Sciweavers

5 search results - page 1 / 1
» Adjunct Elimination in Context Logic for Trees
Sort
View
APLAS
2007
ACM
13 years 9 months ago
Adjunct Elimination in Context Logic for Trees
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not po...
Cristiano Calcagno, Thomas Dinsdale-Young, Philipp...
POPL
2007
ACM
14 years 5 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
KESAMSTA
2011
Springer
12 years 7 months ago
Extending the JADE Agent Behaviour Model with JBehaviourTrees Framework
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
Iva Bojic, Tomislav Lipic, Mario Kusek, Gordan Jez...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 5 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
KR
2004
Springer
13 years 10 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner