Sciweavers

3044 search results - page 233 / 609
» Linear logical approximations
Sort
View
BIRTHDAY
2003
Springer
15 years 12 months ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
PTS
1998
81views Hardware» more  PTS 1998»
15 years 8 months ago
Testing Temporal Logic Properties in Distributed Systems
Based on the notion of event-based behavioral abstraction EBBA we specify properties of object-oriented distributed systems in linear time temporal logic. These properties are the...
Falk Dietrich, Xavier Logean, Shawn Koppenhoefer, ...
SAT
2005
Springer
145views Hardware» more  SAT 2005»
16 years 3 days ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
DAC
2009
ACM
16 years 7 months ago
BDD-based synthesis of reversible logic for large functions
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...
Robert Wille, Rolf Drechsler
ESOP
2010
Springer
16 years 4 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey