82 search results - page 14 / 17 » Datalog and Description Logics: Expressive Power |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
OWLED
2008
13 years 9 months ago
2008
The annotation of the GENIA corpus, a set of biomedical articles, targets the classification of biological entities based on their association with a domain-tailored taxonomy of ca...
FLAIRS
2006
13 years 9 months ago
2006
Intelligent Tutoring Systems (ITS) typically contain elements of instruction, assessment, feedback and guidance for the trainee. Most of the time, the ITS is controlling the dialo...
DIMACS
1996
13 years 9 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...