3319 search results - page 62 / 664 » Subshifts, Languages and Logic |
ICALP
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
CVPR
2012
IEEE
12 years 3 days ago
2012
IEEE
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
AAAI
1998
13 years 11 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...
JLP
2011
13 years 4 months ago
2011
Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed...
CSL
1999
Springer
14 years 2 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...