Sciweavers

2540 search results - page 334 / 508
» Abstract Logics as Dialgebras
Sort
View
AAAI
2008
14 years 1 months ago
A Formalization of Program Debugging in the Situation Calculus
Program debugging is one of the most time-consuming parts of the software development cycle. In recent years, automatic debugging has been an active research area in software engi...
Yongmei Liu
FLOPS
1999
Springer
14 years 3 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
CADE
1998
Springer
14 years 3 months ago
A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application to Newton's Principia
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
Jacques D. Fleuriot, Lawrence C. Paulson
CADE
1998
Springer
14 years 3 months ago
A Proof Environment for the Development of Group Communication Systems
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
Christoph Kreitz, Mark Hayden, Jason Hickey
FUZZY
1997
Springer
260views Fuzzy Logic» more  FUZZY 1997»
14 years 2 months ago
Forecasting Sales Using Neural Networks
Abstract. In this paper, neural networks trained with the back-propagation algorithm are applied to predict the future values of time series that consist of the weekly demand on it...
Frank M. Thiesing, Oliver Vornberger