Sciweavers

265 search results - page 28 / 53
» How to Prove Inductive Theorems
Sort
View
COLING
2002
13 years 7 months ago
An Inference-based Approach to Dialogue System Design
We present an architecture for spoken dialogue systems where first-order inference (both theorem proving and model building) plays a crucial role in interpreting utterances of dia...
Johan Bos, Tetsushi Oka
ENTCS
2002
121views more  ENTCS 2002»
13 years 7 months ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
JACM
2002
163views more  JACM 2002»
13 years 7 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
ENDM
2007
106views more  ENDM 2007»
13 years 7 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
FLAIRS
2004
13 years 9 months ago
Decision Tree Extraction from Trained Neural Networks
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in ...
Darren Dancey, David McLean, Zuhair Bandar