4573 search results - page 402 / 915 » Automated Reasoning |
174
Voted
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
226
click to vote
DEON
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We show that a recently developed theory of positive permission based on the notion of derogation is hampered by a triviality result that indicates a problem with the und...
178
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...
175
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
187
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...