725 search results - page 130 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
128
click to vote
DFG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Today's manufacturing industry demands flexible and decentralized production control systems to avoid hours of down time of the production line in case of a failure ...
140
click to vote
AGP
1999
IEEE
15 years 6 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
133
click to vote
DLT
2006
15 years 3 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
152
click to vote
TDSC
2008
15 years 2 months ago
2008
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
118
click to vote
LATIN
1998
Springer
15 years 6 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...