2022 search results - page 72 / 405 » Complexity of Non-Monotonic Logics |
164
Voted
CONCUR
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
176
click to vote
PODS
1998
ACM
15 years 10 months ago
1998
ACM
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
149
click to vote
AAAI
2000
15 years 7 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
167
click to vote
DLT
2008
15 years 7 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
163
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...