465 search results - page 66 / 93 » Knowledge and the Problem of Logical Omniscience |
AAAI
2000
13 years 10 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
WM
2003
13 years 10 months ago
2003
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
ERSHOV
2009
Springer
14 years 21 days ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
FUZZIEEE
2007
IEEE
14 years 3 months ago
2007
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
ESWS
2008
Springer
13 years 10 months ago
2008
Springer
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...