Sciweavers

3573 search results - page 570 / 715
» Reasoning about Codata
Sort
View
116
Voted
CSL
2010
Springer
15 years 2 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
125
Voted
ECAI
2010
Springer
15 years 2 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
116
Voted
ECAI
2010
Springer
15 years 1 months ago
Learning to Author Text with textual CBR
Abstract. Textual reuse is an integral part of textual case-based reasoning (TCBR) which deals with solving new problems by reusing previous similar problem-solving experiences doc...
Ibrahim Adeyanju, Nirmalie Wiratunga, Juan A. Reci...
106
Voted
BMCBI
2008
130views more  BMCBI 2008»
15 years 1 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
112
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 1 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger