Sciweavers

2145 search results - page 402 / 429
» Lax Logical Relations
Sort
View
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
AI
2007
Springer
13 years 7 months ago
Audiences in argumentation frameworks
Although reasoning about what is the case has been the historic focus of logic, reasoning about what should be done is an equally important capacity for an intelligent agent. Reas...
Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. D...
JCB
2006
185views more  JCB 2006»
13 years 7 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
KES
2008
Springer
13 years 7 months ago
Classification and Retrieval through Semantic Kernels
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito