3440 search results - page 79 / 688 » Logics For Context-Free Languages |
125
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Traditionally a rigorous mathematical document consists of a sequence of definition
160
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
159
click to vote
AAAI
1998
15 years 7 months ago
1998
Deonticlogic, the logic of obligations andpermissions, is plagued by several paradoxes that have to be understood before deontic logic can be used as a knowledge representation la...