19 search results - page 2 / 4 » Practical Partition-Based Theorem Proving for Large Knowledg... |
SYNASC
2006
IEEE
13 years 10 months ago
2006
IEEE
In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst al...
AAAI
1998
13 years 5 months ago
1998
The technology for building large knowledge bases (KBs) is yet to witness a breakthrough so that a KB can be constructed by the assembly of prefabricated knowledge components. Kno...
JACM
2010
13 years 2 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...