6 search results - page 1 / 2 » Paraconsistent set theory by predicating on consistency |
ILP
2000
Springer
14 years 9 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
DAC
2006
ACM
15 years 6 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
CAV
2006
Springer
14 years 9 months ago
2006
Springer
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
JSYML
2008
14 years 5 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
142
click to vote
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in ...