155 search results - page 12 / 31 » Bounded Arithmetic and Descriptive Complexity |
JAR
2007
13 years 7 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
AML
2008
13 years 7 months ago
2008
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
IJCAI
2003
13 years 8 months ago
2003
Many description logics (DLs) combine knowledge tation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings. We propose to extend ...
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...