778 search results - page 5 / 156 » Expressiveness and complexity of graph logic |
IJAR
2008
13 years 11 months ago
2008
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
CORR
2009
Springer
13 years 8 months ago
2009
Springer
DIMACS
1996
14 years 5 days ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...