Sciweavers

1302 search results - page 143 / 261
» Free-Style Theorem Proving
Sort
View
CONTEXT
1999
Springer
15 years 8 months ago
Contextual Inference in Computational Semantics
Appeared in: P. Bouquet, P. Br´ezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.), 2nd International and Interdisciplinary Conference on Modeling and Using Context (CONT...
Christof Monz
AIMSA
1998
Springer
15 years 8 months ago
A Blackboard Architecture for Guiding Interactive Proofs
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
Christoph Benzmüller, Volker Sorge
CDC
2009
IEEE
112views Control Systems» more  CDC 2009»
15 years 8 months ago
A Floquet-like factorization for linear periodic systems
In this note, the novel representation is proposed for a linear periodic continuous-time system with T-periodic real-valued coefficients. We prove that a T-periodic real-valued fac...
Ichiro Jikuya, Ichijo Hodaka
BIRTHDAY
2006
Springer
15 years 8 months ago
Reductio ad Absurdum: Planning Proofs by Contradiction
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
Erica Melis, Martin Pollet, Jörg H. Siekmann
137
Voted
BIRTHDAY
2006
Springer
15 years 8 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon