64 search results - page 8 / 13 » The Complexity of Logic-Based Abduction |
CSL
2001
Springer
15 years 4 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
CIE
2008
Springer
15 years 1 months ago
2008
Springer
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
161
click to vote
CADE
2002
Springer
15 years 12 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
90
Voted
IJCAI
2007
15 years 1 months ago
2007
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
109
click to vote
ICCS
2005
Springer
15 years 5 months ago
2005
Springer
Google’s project to digitize five of the world's greatest libraries will dramatically extend their search engine reach in the future. Current search-engine philosophy, which...