1548 search results - page 250 / 310 » Computational Approaches to Sentence Completion |
ATAL
1997
Springer
14 years 27 days ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
ICLP
1990
Springer
14 years 23 days ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
ICLP
2010
Springer
14 years 18 days ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
3DPVT
2004
IEEE
14 years 14 days ago
2004
IEEE
Abstract-General information about a class of objects, such as human faces or teeth, can help to solve the otherwise ill-posed problem of reconstructing a complete surface from spa...
APPROX
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...