2022 search results - page 44 / 405 » Complexity of Non-Monotonic Logics |
IPL
2006
15 years 17 days ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
105
click to vote
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal l...
92
Voted
CSMR
1998
IEEE
15 years 4 months ago
1998
IEEE
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
171
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...