226 search results - page 4 / 46 » BDDs and Automated Deduction |
66
Voted
IJCAI
1997
14 years 11 months ago
1997
The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
90
Voted
DAC
2000
ACM
15 years 10 months ago
2000
ACM
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static orde...
91
Voted
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
94
Voted
TIME
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
98
Voted
ASE
2005
14 years 9 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...