Sciweavers

3658 search results - page 85 / 732
» The logic of proofs, semantically
Sort
View
MST
2008
101views more  MST 2008»
13 years 10 months ago
Realizability interpretation of proofs in constructive analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
ASM
2008
ASM
14 years 11 days ago
On the Purpose of Event-B Proof Obligations
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges o...
Stefan Hallerstede
TPHOL
2003
IEEE
14 years 3 months ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
IJCAI
1997
13 years 11 months ago
Automation of Diagrammatic Reasoning
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
Mateja Jamnik, Alan Bundy, Ian Green
ILP
2001
Springer
14 years 2 months ago
Induction of Stable Models
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
Ramón P. Otero