2022 search results - page 259 / 405 » Complexity of Non-Monotonic Logics |
149
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
150
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
137
click to vote
VLSID
2004
IEEE
16 years 6 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
157
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
266
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...