265 search results - page 31 / 53 » Weakly Algebraizable Logics |
108
click to vote
ENTCS
2007
15 years 1 months ago
2007
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
131
click to vote
FSTTCS
1999
Springer
15 years 6 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
117
Voted
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
119
Voted
NAACL
2007
15 years 3 months ago
2007
We propose a high-performance cascaded hybrid model for Chinese NER. Firstly, we use Boosting, a standard and theoretically wellfounded machine learning method to combine a set of...
108
click to vote
AAAI
1990
15 years 3 months ago
1990
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...