4401 search results - page 365 / 881 » Computing with Default Logic |
170
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...
188
click to vote
ICLP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
174
click to vote
EUROCOLT
1999
Springer
15 years 11 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
296
click to vote
SIGLEX
1991
15 years 10 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
186
click to vote
AIML
2008
15 years 8 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...