2022 search results - page 97 / 405 » Complexity of Non-Monotonic Logics |
145
click to vote
ENTCS
2000
15 years 6 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
137
click to vote
FUIN
2000
15 years 6 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
172
Voted
CORR
1999
Springer
15 years 5 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
160
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
184
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...