Sciweavers

42 search results - page 4 / 9
» Semantic Selection of Premisses for Automated Theorem Provin...
Sort
View
TPHOL
2005
IEEE
15 years 3 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
NGC
1998
Springer
115views Communications» more  NGC 1998»
14 years 9 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
CONTEXT
1999
Springer
15 years 1 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
LICS
2012
IEEE
12 years 12 months ago
Logics of Dynamical Systems
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
André Platzer
CADE
2007
Springer
15 years 9 months ago
Hyper Tableaux with Equality
Abstract. In most 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 equ...
Björn Pelzer, Peter Baumgartner, Ulrich Furba...