36,909 research outputs found
Facets and Typed Relations as Tools for Reasoning Processes in Information Retrieval
Faceted arrangement of entities and typed relations for representing
different associations between the entities are established tools in knowledge
representation. In this paper, a proposal is being discussed combining both
tools to draw inferences along relational paths. This approach may yield new
benefit for information retrieval processes, especially when modeled for
heterogeneous environments in the Semantic Web. Faceted arrangement can be used
as a se-lection tool for the semantic knowledge modeled within the knowledge
repre-sentation. Typed relations between the entities of different facets can
be used as restrictions for selecting them across the facets
Recommended from our members
The development of complex verb constructions in British Sign Language
This study focuses on the mapping of events onto verb-argument structures in British Sign Language (BSL). The development of complex sentences in BSL is described in a group of 30 children, aged 3;2–12;0, using data from comprehension measures and elicited sentence production. The findings support two interpretations: firstly, in the mapping of concepts onto language, children acquiring BSL overgeneralize the use of argument structure related to perspective shifting;secondly, these overgeneralizations are predicted by the typological characteristics of the language and modality. Children under age 6;0, in attempting to produce sentences encoded through a perspective shift, begin by breaking down double-verb constructions (AB verbs) into components, producing only the part of the verb phrase which describes the perspective of the patient. There is also a prolonged period of development of non-manual features, with the full structure not seen in its adult form until after 9;0. The errors in the use of AB verbs and the subsequent protracted development of correct usage are explained in terms of the conceptual–linguistic interface
Regular Boardgames
We propose a new General Game Playing (GGP) language called Regular
Boardgames (RBG), which is based on the theory of regular languages. The
objective of RBG is to join key properties as expressiveness, efficiency, and
naturalness of the description in one GGP formalism, compensating certain
drawbacks of the existing languages. This often makes RBG more suitable for
various research and practical developments in GGP. While dedicated mostly for
describing board games, RBG is universal for the class of all finite
deterministic turn-based games with perfect information. We establish
foundations of RBG, and analyze it theoretically and experimentally, focusing
on the efficiency of reasoning. Regular Boardgames is the first GGP language
that allows efficient encoding and playing games with complex rules and with
large branching factor (e.g.\ amazons, arimaa, large chess variants, go,
international checkers, paper soccer).Comment: AAAI 201
Extensible Automated Constraint Modelling
In constraint solving, a critical bottleneck is the formulationof an effective constraint model of a given problem. The CONJURE system described in this paper, a substantial step forward over prototype versions of CONJURE previously reported, makes a valuable contribution to the automation of constraint modelling by automatically producing constraint models from their specifications in the abstract constraint specification language ESSENCE. A set of rules is used to refine an abstract specification into a concrete constraint model. We demonstrate that this set of rules is readily extensible to increase the space of possible constraint models CONJURE can produce. Our empirical results confirm that CONJURE can reproduce successfully the kernels of the constraint models of 32 benchmark problems found in the literature
Generating Bijections between HOAS and the Natural Numbers
A provably correct bijection between higher-order abstract syntax (HOAS) and
the natural numbers enables one to define a "not equals" relationship between
terms and also to have an adequate encoding of sets of terms, and maps from one
term family to another. Sets and maps are useful in many situations and are
preferably provided in a library of some sort. I have released a map and set
library for use with Twelf which can be used with any type for which a
bijection to the natural numbers exists.
Since creating such bijections is tedious and error-prone, I have created a
"bijection generator" that generates such bijections automatically together
with proofs of correctness, all in the context of Twelf.Comment: In Proceedings LFMTP 2010, arXiv:1009.218
- …