Sciweavers

64 search results - page 11 / 13
» On the Proof Complexity of Deep Inference
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 3 months ago
Analysis Of Cancer Omics Data In A Semantic Web Framework
Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and ...
Matthew Holford, James P. McCusker, Kei-Hoi Cheung...
AAAI
1993
13 years 7 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
APAL
2010
124views more  APAL 2010»
13 years 6 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
IAT
2007
IEEE
14 years 8 days ago
Revisiting ADOPT-ing and its Feedback Schemes
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...
Marius-Calin Silaghi, Makoto Yokoo
AIML
2008
13 years 7 months ago
Labelled modal tableaux
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This pap...
Guido Governatori