2022 search results - page 75 / 405 » Complexity of Non-Monotonic Logics |
74
Voted
APAL
2008
15 years 24 days ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
122
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
115
Voted
CORR
2004
Springer
15 years 16 days ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
109
Voted
PODS
2010
ACM
15 years 27 days ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
97
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...