3440 search results - page 135 / 688 » Logics For Context-Free Languages |
195
Voted
ICALP
2005
Springer
16 years 12 days ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
183
click to vote
AIML
2006
15 years 8 months ago
2006
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
224
click to vote
LCC
1994
15 years 11 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
158
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a separation logic framework which can express properties of memory separation between different points in a program. We describe an algorithm based on this fr...
164
click to vote
LPAR
2005
Springer
16 years 11 days ago
2005
Springer
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...