Sciweavers

2154 search results - page 91 / 431
» On the notion of concept I
Sort
View
CSL
2002
Springer
13 years 9 months ago
On the Automatizability of Resolution and Related Propositional Proof Systems
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
Albert Atserias, Maria Luisa Bonet
APAL
1998
71views more  APAL 1998»
13 years 9 months ago
On the Finiteness of the Recursive Chromatic Number
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
William I. Gasarch, Andrew C. Y. Lee
AML
2007
68views more  AML 2007»
13 years 10 months ago
A note on weak dividing
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
Byunghan Kim, Niandong Shi
I3E
2001
105views Business» more  I3E 2001»
13 years 11 months ago
XML-based Process Representation for e-Government Serviceflows
: Addressing new public challenges such as the one-stop government and improved service quality, we introduce serviceflow management as a generic concept to coordinate cross-organi...
Ralf Klischewski, Ingrid Wetzel
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
14 years 10 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...