1410 search results - page 213 / 282 » Proving theorems by reuse |
150
click to vote
PEPM
2010
ACM
15 years 3 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
119
click to vote
CSL
2010
Springer
15 years 3 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
134
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
112
click to vote
ACS
2007
15 years 2 months ago
2007
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...
111
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...