Sciweavers

884 search results - page 148 / 177
» A Proof Theory for DL-Lite
Sort
View
IJAR
2007
86views more  IJAR 2007»
14 years 11 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron
98
Voted
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 11 months ago
Multi-Agent Only Knowing
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Joseph Y. Halpern, Gerhard Lakemeyer
ENTCS
2002
128views more  ENTCS 2002»
14 years 11 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
SIAMCO
2000
75views more  SIAMCO 2000»
14 years 11 months ago
Generic Simplicity of the Spectrum and Stabilization for a Plate Equation
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
Jaime H. Ortega, Enrique Zuazua
DATAMINE
1998
145views more  DATAMINE 1998»
14 years 11 months ago
A Tutorial on Support Vector Machines for Pattern Recognition
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
Christopher J. C. Burges