Sciweavers

1549 search results - page 177 / 310
» On the rules of intermediate logics
Sort
View
LPAR
2001
Springer
14 years 1 months ago
A Computer Environment for Writing Ordinary Mathematical Proofs
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
David McMath, Marianna Rozenfeld, Richard Sommer
SSR
2001
134views more  SSR 2001»
13 years 10 months ago
Generation of visitor components that implement program transformations
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
Kurt Stirewalt, Laura K. Dillon
AAAI
1990
13 years 10 months ago
Operationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Stanley Letovsky
CADE
2004
Springer
14 years 9 months ago
Uniform variable splitting
ended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called indep...
Roger Antonsen
SEMWEB
2005
Springer
14 years 2 months ago
A Fuzzy Semantics for Semantic Web Languages
Although the model-theoretic semantics of the languages used in the Semantic Web are crisps, the need arise to extend them to represent fuzzy data, in the same way fuzzy logic exte...
Mauro Mazzieri, Aldo Franco Dragoni