797 search results - page 64 / 160 » Eliminating Proofs from Programs |
213
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
138
Voted
AAAI
1996
15 years 2 months ago
1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
106
click to vote
JSAT
2008
15 years 19 days ago
2008
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
119
click to vote
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
112
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...