3566 search results - page 146 / 714 » Signed Logic Programs |
128
Voted
ACL
2008
15 years 4 months ago
2008
The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
107
Voted
LREC
2010
15 years 4 months ago
2010
This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target text...
100
Voted
FLAIRS
1998
15 years 4 months ago
1998
In this papera newoperatorfor agent's implicit belief revisionis presented.Thisoperatoris conceptually based on the following requirement:anagent should find first anexplanat...
114
Voted
SEMWEB
2009
Springer
15 years 9 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...
112
Voted
EUROCOLT
1999
Springer
15 years 7 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 ...