4217 search results - page 67 / 844 » Computational indistinguishability logic |
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
AUSAI
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we extend Defeasible Logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with...