42 search results - page 6 / 9 » Semantic Selection of Premisses for Automated Theorem Provin... |
177
click to vote
CSL
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
162
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
129
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
164
click to vote
DLOG
2003
15 years 7 months ago
2003
The Wine Agent is a demonstration system that uses an underlying domain ontology to provide suitable wines for a given meal. In doing so it serves as a testbed, not only for the l...
154
click to vote
VSTTE
2005
Springer
15 years 11 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...