409 search results - page 61 / 82 » Semantics for a theory of defeasible reasoning |
141
click to vote
SDB
1995
15 years 3 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
JELIA
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
100
click to vote
DAGSTUHL
2008
15 years 1 months ago
2008
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
120
click to vote
EUSFLAT
2009
14 years 9 months ago
2009
The need for an automatic inference process able to deal with information coming from unreliable sources is becoming a relevant issue both on corporate networks and on the open Web...
CADE
2005
Springer
16 years 3 days ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...