454 search results - page 24 / 91 » Representation results for defeasible logic |
PLILP
1997
Springer
14 years 23 days ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
AUSAI
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
PEPM
1993
ACM
14 years 21 days ago
1993
ACM
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
TABLEAUX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
JAIR
2006
13 years 8 months ago
2006
Logical hidden Markov models (LOHMMs) upgrade traditional hidden Markov models to deal with sequences of structured symbols in the form of logical atoms, rather than flat characte...