360 search results - page 32 / 72 » Explanations and Proof Trees |
AML
2002
13 years 9 months ago
2002
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
ICFP
2007
ACM
14 years 10 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...