4573 search results - page 490 / 915 » Automated Reasoning |
127
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our appr...
125
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract. Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure in...
137
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
176
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
123
click to vote
CSL
2005
Springer
15 years 10 months ago
2005
Springer
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...