3470 search results - page 468 / 694 » Head-Elementary-Set-Free Logic Programs |
201
click to vote
EPIA
2003
Springer
15 years 11 months ago
2003
Springer
Modern information retrieval systems need the capability to reason about the knowledge conveyed by text bases. In this paper a methodology to automatically create ontologies and cl...
141
click to vote
IFL
2001
Springer
15 years 10 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
154
click to vote
SEMWEB
2007
Springer
16 years 11 days ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
180
click to vote
CSL
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
154
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...